A Lagrangian lower bound for the container transshipment problem at a railway hub for a fast branch-and-bound algorithm. - Maksim Barketau; Herbert Kopfer; Erwin Pesch (J. Oper. Res. Soc., 2013)

Minimizing maximum weight of subsets of a maximum matching in a bipartite graph. - Maksim Barketau; Erwin Pesch; Yakov M. Shafransky (Discret. Appl. Math., 2015)

Scheduling dedicated jobs with variative processing times. - Maksim Barketau; Erwin Pesch; Yakov M. Shafransky (J. Comb. Optim., 2016)

Complexity and Approximation Results for Setup-Minimal Batch Scheduling with Deadlines on a Single Processor. - Dominik Kress; Maksim Barketau; Erwin Pesch; David Müller 006 (OR, 2018)

Single-machine batch scheduling to minimize the total setup cost in the presence of deadlines. - Dominik Kress; Maksim Barketau; Erwin Pesch (J. Sched., 2018)

Determining the interset distance. - Maksim Barketau (J. Comb. Optim., 2019)

Evaluation of solution of discrete optimization problem with incomplete input. - Maksim Barketau (Optim. Lett., 2021)