default search action
EURO Journal on Computational Optimization, Volume 1
Volume 1, Numbers 1-2, May 2013
- Martine Labbé, M. Grazia Speranza:
Editorial. 1-2 - Egon Balas, Andrea Qualizza:
Intersection cuts from multiple rows: a disjunctive programming approach. 3-49 - Florent Cadoux, Claude Lemaréchal:
Reflections on generating (disjunctive) cuts. 51-69 - Mathieu Van Vyve, Laurence A. Wolsey:
Strong and compact relaxations in the original space using a compact extended formulation. 71-80 - Ruslan Sadykov, François Vanderbeck:
Column generation for extended formulations. 81-115 - Patrice Marcotte, Gilles Savard, Alexandre Schoeb:
A hybrid approach to the solution of a pricing model with continuous demand segmentation. 117-142 - Luís Nunes Vicente:
Worst case complexity of direct search. 143-153 - Dorit S. Hochbaum, Cheng Lyu, Erik Bertelli:
Evaluating performance of image segmentation criteria and techniques. 155-180 - Mustapha Aouchiche, Gilles Caporossi, Pierre Hansen:
Open problems on graph eigenvalues studied with AutoGraphiX. 181-199 - Menal Guzelsoy, George L. Nemhauser, Martin W. P. Savelsbergh:
Restrict-and-relax search for 0-1 mixed-integer programs. 201-218
Volume 1, Numbers 3-4, November 2013
- Bernard Fortz, Luis Eduardo Neves Gouveia:
SI on computational methods for network optimization problems. 219 - Andreas Bley, Ivana Ljubic, Olaf Maurer:
Lagrangian decompositions for the two-level FTTx network design problem. 221-252 - Grit Claßen, Arie M. C. A. Koster, Anke Schmeink:
Speeding up column generation for robust wireless network planning. 253-281 - Mounira Groiez, Guy Desaulniers, Ahmed Hadjar, Odile Marcotte:
Separating valid odd-cycle and odd-set inequalities for the multiple depot vehicle scheduling problem. 283-312
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.