default search action
EURO Journal on Computational Optimization, Volume 2
Volume 2, Numbers 1-2, June 2014
- Yuan Li, Michal Pióro, Di Yuan, Jinshu Su:
Optimizing compatible sets in wireless networks through integer programming. 1-15 - Martin Grötschel, Christian Raack, Axel Werner:
Towards optimizing the deployment of optical access networks. 17-53 - Bernard Gendron, Mathieu Larose:
Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design. 55-75 - Filipe Brandão, João Pedro Pedroso:
A complete search method for the relaxed traveling tournament problem. 77-86
Volume 2, Number 3, August 2014
- Louis-Martin Rousseau, Willem-Jan van Hoeve:
Special issue on: constraint programming approaches to combinatorial optimization. 87-88 - Gilles Pesant:
A constraint programming primer. 89-97 - Gerald Gamrath:
Improving strong branching by domain propagation. 99-122 - Pierre Schaus, Jean-Charles Régin:
Bound-consistent spread constraint. 123-146 - Elena Kelareva, Kevin Tierney, Philip Kilby:
CP methods for scheduling and routing with time-dependent task costs. 147-194 - Peter Y. Zhang, David A. Romero, J. Christopher Beck, Cristina H. Amon:
Solving wind farm layout optimization with mixed integer programs and constraint programs. 195-219
Volume 2, Number 4, November 2014
- Claudia Archetti, David Pisinger, M. Grazia Speranza:
Special issue on: "matheuristics". 221-222 - Claudia Archetti, M. Grazia Speranza:
A survey on matheuristics for routing problems. 223-246 - Roberto Cordone, Pierre Hosteins, Giovanni Righini, Paolo Ravizza, Andrea Piselli:
Optimal selection of contracts and work shifts in multi-skill call centers. 247-277 - Dhananjay R. Thiruvady, Andreas T. Ernst, Mark Wallace:
A Lagrangian-ACO matheuristic for car sequencing. 279-296
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.