External Links

    Journal: EURO J. Computational Optimization

    Volume 6, Issue 4

    315 -- 337Jannis Kurtz. Robust combinatorial optimization under budgeted-ellipsoidal uncertainty
    339 -- 365Christina Büsing, Sigrid Knust, Xuan Thanh Le. Trade-off between robustness and cost for a storage loading problem: rule-based scenario generation
    367 -- 393Kamyar Kargar, Halil Bayrak, Mustafa Ç. Pinar. Robust bilateral trade with discrete types
    395 -- 434Walid Ben-Ameur, Adam Ouorou, Guanglei Wang, Mateusz Zotkiewicz. Multipolar robust optimization

    Volume 6, Issue 3

    207 -- 209Arie M. C. A. Koster, Michael Poss. Special issue on: robust combinatorial optimization
    211 -- 238Christoph Buchheim, Jannis Kurtz. Robust combinatorial optimization under convex and discrete cost uncertainty
    239 -- 266Annette M. C. Ficker, Frits C. R. Spieksma, Gerhard J. Woeginger. Robust balanced optimization
    267 -- 290Virginie Gabrel, Cécile Murat, Aurélie Thiele. pw-robustness
    291 -- 313Idir Hamaz, Laurent Houssin, Sonia Cafieri. A robust basic cyclic scheduling problem

    Volume 6, Issue 2

    117 -- 142Christian Artigues, Nicolas Jozefowiez, Boadu Mensah Sarpong. Column generation algorithms for bi-objective combinatorial optimization problems with a min-max objective
    143 -- 184Mervat Chouman, Teodor Gabriel Crainic, Bernard Gendron. The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design
    185 -- 206Abdelouahab Zaghrouti, Issmail El Hallaoui, François Soumis. Improved integral simplex using decomposition for the set partitioning problem

    Volume 6, Issue 1

    1 -- 27Sune Lauth Gadegaard, Andreas Klose, Lars Relund Nielsen. An improved cut-and-solve algorithm for the single-source capacitated facility location problem
    29 -- 54Anjulika Gupta, Prabha Sharma, Hemant Salwan. A local search algorithm: minimizing makespan of deteriorating jobs with relaxed agreeable weights
    55 -- 83Dimitri J. Papageorgiou, Francisco Trespalacios. Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming
    85 -- 115Gizem Ozbaygin, Oya Ekin Karasan, Hande Yaman. New exact solution approaches for the split delivery vehicle routing problem
    runs on