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 3
Volume 3, Number 1, March 2005
- Vincent T'kindt
, Karima Bouibede-Hocine, Carl Esswein:
Counting and enumeration complexity with application to multicriteria scheduling. 1-21 - Pasquale Avella, Maurizio Boccia, Carmine Di Martino, Giuseppe Oliviero, Antonio Sforza, Igor Vasil'ev:
A decomposition approach for a very large scale optimal diversity management problem. 23-37 - Hafida Essaqote, Noureddine Zahid, Mohamed Limouri, Abderrahmane Essaid:
A new approach for unsupervised classification. 39-49 - Edmond J. Vanderperre, Stanislav S. Makhanov:
A Markov time related to a robot-safety device system. 51-57 - Philippe Galinier, Michel Gendreau, Patrick Soriano, Serge Bisaillon:
Solving the frequency assignment problem with polarization by local search and tabu. 59-78 - Pietro Belotti:
Multicommodity network design with survivability constraints: Some models and algorithms. 79-81 - Xavier Delorme:
Railroad infrastructure operations : Modeling and resolution. 83-86
Volume 3, Number 2, June 2005
- Benoît Colson, Patrice Marcotte, Gilles Savard:
Bilevel programming: A survey. 87-107 - Zvi Drezner:
A distance based rule for removing population members in genetic algorithms. 109-116 - Natalia V. Shakhlevich:
Open shop unit-time scheduling problems with symmetric objective functions. 117-131 - Cyriel Van Nuffelen, Kristel Van Rompay:
On the length of longest chordless cycles. 133-138 - Alain Hertz, David Schindl, Nicolas Zufferey:
Lower bounding and tabu search procedures for the frequency assignment problem with polarization constraints. 139-161 - Manuel Iori:
Metaheuristic algorithms for combinatorial optimization problems. 163-166 - Claude Yugma:
Dynamic management of a portfolio of orders. 167-170
Volume 3, Number 3, September 2005
- Dorit S. Hochbaum:
Complexity and algorithms for convex network optimization and other nonlinear problems. 171-216 - Moncef Abbas, Youcef Saoula:
Polynomial algorithms for kernels in comparability, permutation and P4-free graphs. 217-225 - Nicholas I. M. Gould, Dominique Orban, Annick Sartenaer, Philippe L. Toint:
Sensitivity of trust-region algorithms to their parameters. 227-241 - Dominique de Werra, Pierre Hansen:
Variations on the Roy-Gallai theorem. 243-251 - Hartanto Wong:
Pooling of repairable spare parts: A study on inventory policies. 253-256
Volume 3, Number 4, December 2005
- Julia Pahl, Stefan Voß, David L. Woodruff:
Production planning with load dependent lead times. 257-302 - Mikhail A. Kubzin, Vitaly A. Strusevich:
Two-machine flow shop no-wait scheduling with machine maintenance. 303-313 - Roberto Montemanni, Luca Maria Gambardella:
The robust shortest path problem with interval data via Benders decomposition. 315-328 - Annegret Wagler:
On rank-perfect subclasses of near-bipartite graphs. 329-336 - Fethi Jarray:
Solving problems of discrete tomography. 337-340 - Denis Bouyssou, Silvano Martello, Frank Plastria:
Acknowledgement to referees. 341-342
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 2025-04-17 23:53 CEST 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:
