- Journal of Combinatorial Theory, Series B 83, 320 330 (2001) A Transformation Which Preserves the Clique Number
- Incomplete Service and Split Deliveries in a Routing Problem with Profits
- The Split Delivery Capacitated Team Orienteering Problem
- Les Cahiers du GERAD ISSN: 07112440 On Compact k-Edge-Colorings
- Les Cahiers du GERAD ISSN: 07112440 Augmenting Chains in Graphs
- Pickup and delivery problems with services on nodes or arcs of a network
- TRANSPORTATION SCIENCE Vol. 40, No. 1, February 2006, pp. 6473
- Guidelines for the use of meta-heuristics in combinatorial optimization
- Client assignment algorithms for home care services Alain Hertz
- Les Cahiers du GERAD ISSN: 07112440 Lower Bounds and a Tabu Search
- Les Cahiers du GERAD ISSN: 07112440 On a Reduction of the Interval
- ELSEMER Discrete Applied Mathematics X9 (199X) 263-267 MATHEMATICS
- Journal of Heuristics, 5, 145158 (1999) c 1999 Kluwer Academic Publishers, Boston. Manufactured in The Netherlands.
- DOI: 10.1007/s10288-004-0057-3 4OR 3: 139161 (2005) Industry
- ELSEVIER Discrete Applied Mathematics 94 ( 1999) i-7 MATHEMATICS
- MATHEMATICS ELSEVIER Discrete Mathematics 165/166 (1997) 403-419
- Total Domination and the Caccetta-Haggkvist Conjecture Patrick St-Louis
- Comparison of heuristic approaches for the multiple depot vehicle scheduling problem
- MATHEMATICS ELSEVIER Discrete Applied Mathematics 65 (1996) 285 3 1X
- A magnetic procedure for the stability number Alain Hertz
- Les Cahiers du GERAD ISSN: 07112440 The Capacitated Team
- A SEQUENTIAL ELIMINATION ALGORITHM FOR COMPUTING BOUNDS ON THE CLIQUE NUMBER OF A
- Les Cahiers du GERAD ISSN: 07112440 On a Generalization of the
- Efficient Algorithms for Finding Critical Subgraphs C. Desrosiers1
- Les Cahiers du GERAD ISSN: 07112440 An Adaptive Memory Algorithm for the
- RAIRO Operations Research Will be set by the publisher
- On edge orienting methods for graph coloring Bernard Gendron1
- Recent trends in arc routing Alain Hertz
- Les Cahiers du GERAD ISSN: 07112440 New Heuristics for the Vehicle
- Discrete Applied Mathematics 132 (2004) 121136 www.elsevier.com/locate/dam
- A variable neighborhood search for graph coloring Ceedric Avanthay a
- Discrete Applied Mathematics 128 (2003) 395419 www.elsevier.com/locate/dam
- Discrete Applied Mathematics 98 (1999) 119 On some properties of DNA graphs
- ELSEVIER Discrete Mathematics195 (1999) 93-101 MATHEMATICS
- ELSEVIER EuropeanJournalof OperationalResearch108(1998) 585-603 OF OPERATIONAL
- ELSEVIER Discrete Applied Mathematics 76 (1997)183-203 MATHEMATICS
- MATHEMATICS ELS&ER Discrete Applied Mathematics 65 (1996) 3 19%34S
- Confection de calendriers de matchs pour le sport universitaire et collegial au Quebec
- Les Cahiers du GERAD ISSN : 07112440 La coloration des sommets d'un
- Les Cahiers du GERAD ISSN: 07112440 Automated Generation of
- International Conference on Industrial Engineering and Systems Management
- Integer linear programming models for a cement delivery problem
- Les Cahiers du GERAD ISSN: 07112440 Average Distance and
- Variable Space Search for Graph Coloring Alain Hertz1
- Operations Research Letters 24 (1999) 2935 3-approximation algorithm for the clustered traveling
- Invited Review A framework for the description of evolutionary algorithms
- Improving frequent subgraph mining in the presence of symmetry
- Les Cahiers du GERAD ISSN: 07112440 Solution Techniques for the Large
- Metaheuristics and scheduling 3.1. Introduction
- Finding the Chromatic Number by Means of Critical Francine Herrmann
- L'enseignement de la thorie des graphes l'aide d'intrigues policires Alain Hertz
- Information Processing Letters 86 (2003) 311316 www.elsevier.com/locate/ipl
- Les Cahiers du GERAD ISSN: 07112440 SyGMA: Reducing Symmetry in
- Journal of Heuristics, 8: 449465, 2002 c 2002 Kluwer Academic Publishers. Manufactured in The Netherlands.
- Les Cahiers du GERAD ISSN: 07112440 Using Heuristics to Speed Up
- Discrete Applied Mathematics 132 (2004) 109119 www.elsevier.com/locate/dam
- A Hybrid Heuristic for an Inventory-Routing Claudia Archetti (1)
- A New Ant Algorithm for Graph Coloring Alain Hertz1
- LES MTA-HEURISTIQUES : quelques conseils pour en faire bon usage Alain HERTZ
- Discrete Mathematics 222 (2000) 6172 www.elsevier.com/locate/disc
- Les Cahiers du GERAD ISSN: 07112440 On rrr-Equitable Colorings of
- Elsevier Editorial System(tm) for Journal of Combinatorial Theory, Series B Manuscript Draft
- A branch-and-price algorithm for the robust graph coloring problem
- Optimizing the Design of a Wind Farm Collection Network
