|
Search the dblp DataBase
Philippe Michelon:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Charles Fleurent, Fred Glover, Philippe Michelon, Zulficar Valli
A Scatter Search Approach for Unconstrained Continuous Optimization. [Citation Graph (0, 0)][DBLP] International Conference on Evolutionary Computation, 1996, pp:643-648 [Conf]
- Philippe Michelon, Nelson Maculan
Lagrangean Methods for 0-1 Quadratic Problems. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1993, v:42, n:2, pp:257-269 [Journal]
- Jacques A. Ferland, Ilham Berrada, Imene Nabli, B. Ahiod, Philippe Michelon, Viviane Gascon, Éric Gagné
Generalized Assignment Type Goal Programming Problem: Application to Nurse Scheduling. [Citation Graph (0, 0)][DBLP] J. Heuristics, 2001, v:7, n:4, pp:391-413 [Journal]
- Sophie Demassey, Christian Artigues, Philippe Michelon
Constraint-Propagation-Based Cutting Planes: An Application to the Resource-Constrained Project Scheduling Problem. [Citation Graph (0, 0)][DBLP] INFORMS Journal on Computing, 2005, v:17, n:1, pp:52-65 [Journal]
- Philippe Michelon, Nelson Maculan
Lagrangean decomposition for integer nonlinear programming with linear constraints. [Citation Graph (0, 0)][DBLP] Math. Program., 1991, v:52, n:, pp:303-313 [Journal]
- Christian Artigues, Philippe Michelon, Stéphane Reusser
Insertion techniques for static and dynamic resource-constrained project scheduling. [Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2003, v:149, n:2, pp:249-267 [Journal]
Recent Hybrid Techniques for the Multi-Knapsack Problem. [Citation Graph (, )][DBLP]
Constraint Programming and Mixed Integer Linear Programming for Rescheduling Trains under Disrupted Operations. [Citation Graph (, )][DBLP]
On a class of periodic scheduling problems: Models, lower bounds and heuristics. [Citation Graph (, )][DBLP]
Solving the 0-1 Multidimensional Knapsack Problem with Resolution Search [Citation Graph (, )][DBLP]
Solving the Frequency Assignment Problem by Site Availability and Constraint Programming [Citation Graph (, )][DBLP]
A linearization framework for unconstrained quadratic (0-1) problems. [Citation Graph (, )][DBLP]
A multi-level search strategy for the 0-1 Multidimensional Knapsack Problem. [Citation Graph (, )][DBLP]
Search in 0.001secs, Finished in 0.002secs
|