default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID4OR: Quarterly Journal of the Belgian, French and Italian Operations Research Societies, Volume 1
Volume 1, Number 1, March 2003
- Denis Bouyssou
, Silvano Martello, Frank Plastria:
4OR for what purpose? 1-6 - Claude Lemaréchal:
The omnipresence of Lagrange. 7-25 - Marco A. Boschetti, Aristide Mingozzi:
The two-dimensional finite bin packing problem. Part I: New lower bounds for the oriented case. 27-42 - Cyriel Van Nuffelen, Kristel Van Rompay:
Upper bounds on the independence and the clique covering number. 43-50 - Emilio Spedicato, Elena Bodon, Antonino Del Popolo, Nezam Mahdavi-Amiri:
ABS methods and ABSPACK for linear systems and optimization: A review. 51-66 - Roberto Aringhieri, Pierre Hansen, Federico Malucelli:
Chemical trees enumeration algorithms. 67-83 - Michele Monaci:
Algorithms for packing and scheduling problems. 85-87
Volume 1, Number 2, June 2003
- Jean-François Cordeau, Gilbert Laporte:
The Dial-a-Ride Problem (DARP): Variants, modeling issues and algorithms. 89-101 - Alessandro Agnetis, Paolo Detti, Carlo Meloni:
Process selection and sequencing in a two-agents production system. 103-119 - Ernesto de Queirós Vieira Martins, Marta M. B. Pascoal:
A new implementation of Yen's ranking loopless paths algorithm. 121-133 - Marco A. Boschetti, Aristide Mingozzi:
The Two-Dimensional Finite Bin Packing Problem. Part II: New lower and upper bounds. 135-147 - Francesco Maffioli:
The vehicle routing problem: A book review. 149-153 - Tito A. Ciriani, Yves Colombani, Susanne Heipcke:
Embedding optimisation algorithms with Mosel. 155-167 - Luc Muyldermans:
Routing, districting and location for arc traversal problems. 169-172
Volume 1, Number 3, October 2003
- Quentin Louveaux, Laurence A. Wolsey:
Lifting, superadditivity, mixed integer rounding and single node flow sets revisited. 173-207 - Adam N. Letchford, Andrea Lodi:
Primal separation algorithms. 209-224 - Jérôme Monnot, Olivier Spanjaard:
Bottleneck shortest paths on a partially ordered scale. 225-241 - Marta M. B. Pascoal, M. Eugénia V. Captivo, João C. N. Clímaco:
A note on a new variant of Murty's ranking assignments algorithm. 243-255 - Roberto Montemanni:
Upper and lower bounds for the fixed spectrum frequency assignment problem. 257-260
Volume 1, Number 4, December 2003
- Karen I. Aardal, Stan P. M. van Hoesel, Arie M. C. A. Koster, Carlo Mannino, Antonio Sassano:
Models and solution techniques for frequency assignment problems. 261-317 - Alberto Ceselli:
Two exact algorithms for the capacitated p-median problem. 319-340 - Kenneth Sörensen:
A framework for robust and flexible optimisation using metaheuristics. 341-345 - Denis Bouyssou, Silvano Martello, Frank Plastria:
Acknowledgement to referees. 347-348
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.
last updated on 2024-12-31 21:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
