default search action
4OR: Quarterly Journal of the Belgian, French and Italian Operations Research Societies, Volume 11
Volume 11, Number 1, March 2013
- Martine Labbé, Alessia Violin:
Bilevel programming and price setting problems. 1-30 - Ruibin Bai, Tom Van Woensel, Graham Kendall, Edmund K. Burke:
A new model and a hyper-heuristic approach for two-dimensional shelf space allocation. 31-55 - Nenad Mladenovic, Dragan Urosevic, Saïd Hanafi:
Variable neighborhood search for the travelling deliveryman problem. 57-73 - Michael Poss:
Robust combinatorial optimization with variable budgeted uncertainty. 75-92 - Oumar Koné:
New approaches for solving the resource-constrained project scheduling problem. 93-94 - Stefano Coniglio:
On coordinated cutting plane generation and mixed integer programs with nonconvex 2-norm constraints. 95-96 - Veronique Limère:
To kit or not to kit: optimizing part feeding in the automotive assembly industry. 97-98 - Marie-Eléonore Marmion:
Local search and combinatorial optimization: from structural analysis of a problem to efficient algorithms design. 99-100
Volume 11, Number 2, July 2013
- El-Ghazali Talbi:
Combining metaheuristics with mathematical programming, constraint programming and machine learning. 101-150 - Karel De Loof, Bernard De Baets, Hans E. De Meyer:
A necessary 4-cycle condition for dice representability of reciprocal relations. 151-170 - Pierre Janssen, Philippe Nemery:
An extension of the FlowSort sorting method to deal with imprecision. 171-193 - Roberto Roberti:
Exact algorithms for different classes of vehicle routing problems. 195-196 - Makhlouf Hadji:
On the design of networks with unicyclic connected components. 197-198 - Carla Michini:
The stable set problem: some structural properties and relaxations. 199-200
Volume 11, Number 3, September 2013
- Carlos Segura, Carlos A. Coello Coello, Gara Miranda, Coromoto León:
Using multi-objective evolutionary algorithms for single-objective optimization. 201-228 - Masoud Yaghini, Mohsen Momeni, Mohammadreza Sarmadi, Hamid Reza Ahadi:
An efficient heuristic algorithm for the capacitated $$p-\!$$ median problem. 229-248 - Vladimir G. Deineko, Gerhard J. Woeginger:
Complexity and in-approximability of a selection problem in robust optimization. 249-252 - Clara Rocha, Luis C. Dias:
MPOC: an agglomerative algorithm for multicriteria partially ordered clustering. 253-273 - Marta M. B. Pascoal, M. Eugénia V. Captivo, João C. N. Clímaco, Ana Laranjeira:
Bicriteria path problem minimizing the cost and minimizing the number of labels. 275-294 - Alberto Costa:
Applications of reformulations in mathematical programming. 295-296 - Leandro C. Coelho:
Flexibility and consistency in inventory-routing. 297-298 - Kris Braekers:
Optimization of empty container movements in intermodal transport. 299-300
Volume 11, Number 4, December 2013
- Marco Locatelli, Fabio Schoen:
Global optimization based on local searches. 301-321 - Sofie Demeyer, Jan Goedgebeur, Pieter Audenaert, Mario Pickavet, Piet Demeester:
Speeding up Martins' algorithm for multiple objective shortest path problems. 323-348 - Eduardo Álvarez-Miranda, Ivana Ljubic, Paolo Toth:
A note on the Bertsimas & Sim algorithm for robust combinatorial optimization problems. 349-360 - Saman Babaie-Kafaki:
A modified scaled memoryless BFGS preconditioned conjugate gradient method for unconstrained optimization. 361-374 - Herwig Bruneel, Willem Mélange, Bart Steyaert, Dieter Claeys, Joris Walraevens:
Effect of global FCFS and relative load distribution in two-class queues with dedicated servers. 375-391 - Claudio Iuliano:
Efficient deterministic algorithms for finding optimal cycle bases in undirected graphs. 393-394 - Victor Pillac:
Dynamic vehicle routing: Solution methods and computational tools. 395-396 - Pablo A. Maya Duque:
Optimisation models and algorithms for non-profit logistics and disaster management problems. 397-398 - Acknowledgement to referees. 399-400
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.