Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty Marc GoerigkAdam KasperskiPaweł Zieliński OriginalPaper Open access 05 August 2021 Pages: 497 - 527
Linear-size universal discretization of geometric center-based problems in fixed dimensions Vladimir Shenmaier OriginalPaper 06 August 2021 Pages: 528 - 542
The maximum average connectivity among all orientations of a graph Rocío M. CasablancaPeter DankelmannOrtrud Oellermann OriginalPaper 12 August 2021 Pages: 543 - 570
Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph Yong ChenYinhui CaiAn Zhang OriginalPaper 16 August 2021 Pages: 571 - 588
Advancing local search approximations for multiobjective combinatorial optimization problems Lakmali Weerasena OriginalPaper 18 August 2021 Pages: 589 - 612
Lower bounds for batched bin packing János BaloghJózsef BékésiAsaf Levin OriginalPaper 23 August 2021 Pages: 613 - 629
Rescheduling problems with allowing for the unexpected new jobs arrival Xingong ZhangWin-Chin LinChin-Chia Wu OriginalPaper 27 August 2021 Pages: 630 - 645
A value for cooperative games with coalition and probabilistic graph structures Jilei ShiLei CaiWenrong Lyu OriginalPaper 07 September 2021 Pages: 646 - 671
Adaptive online portfolio strategy based on exponential gradient updates Yong ZhangHong LinXingyu Yang OriginalPaper 09 September 2021 Pages: 672 - 696
Correction To: Solving \((k-1)\)-stable instances of k-terminal cut with isolating cuts Mark Velednitsky Correction Open access 09 September 2021 Pages: 697 - 697