Michelon Philippe

Philippe Michelon

Information about the author Philippe Michelon will soon be added to the site.
Found 17 papers in total
Crop rotation scheduling with adjacency constraints
Crop rotation scheduling with adjacency constraints
2011
In this article we propose a 0‐1 optimization model to determine a crop...
SAPI: Statistical Analysis of Propagation of Incidents. A new approach for rescheduling trains after disruptions
SAPI: Statistical Analysis of Propagation of Incidents. A new approach for rescheduling trains after disruptions
2011
In this paper, we present a new approach to solve the railway rescheduling problem....
Models and methods for frequency assignment with cumulative interference constraints
Models and methods for frequency assignment with cumulative interference constraints
2008
In this paper, a realistic modeling of interferences for frequency assignment in...
A constraint programming approach for the resource-constrained project scheduling problem
A constraint programming approach for the resource-constrained project scheduling problem
2008
A ‘pure’ Constraint Programming approach for the Resource-Constrained...
Constraint-propagation-based cutting planes: an application to the resource-constrained project scheduling problem
Constraint-propagation-based cutting planes: an application to the resource-constrained project scheduling problem
2005
We propose a cooperation method between constraint programming and integer programming...
“Miniaturized” linearizations for quadratic 0/1 problems
“Miniaturized” linearizations for quadratic 0/1 problems
2005
In order to solve a quadratic 0/1 problem, some techniques, consisting in deriving a...
A branch-and-bound method for solving the problem of finding the min cut with size constraint in a graph
A branch-and-bound method for solving the problem of finding the min cut with size constraint in a graph
2001
A branch-and-bound method for solving the min cut with size constraint problem is...
Solving the resource-constrained project scheduling problem with large neighbourhood search
Solving the resource-constrained project scheduling problem with large neighbourhood search
2004
This paper presents the Local Search with Subproblem Exact Resolution (LSSPER) method...
Insertion techniques for static and dynamic resource-constrained project scheduling
Insertion techniques for static and dynamic resource-constrained project scheduling
2003
A flow network model is presented for the static resource-constrained project...
Generalized assignment type goal programming problem: Application to nurse scheduling
Generalized assignment type goal programming problem: Application to nurse scheduling
2001
The notion of the Generalized Assignment Type Goal Programming Problem is introduced...
The Euclidean Steiner tree problem in Rn: A mathematical programming formulation
The Euclidean Steiner tree problem in Rn: A mathematical programming formulation
2000
A nonconvex mixed-integer programming formulation for the Euclidean Steiner Tree...
Scheduling the flying squad nurses of a hospital using a multi-objective programming model
Scheduling the flying squad nurses of a hospital using a multi-objective programming model
2000
In this paper, we address the problem of scheduling nurses working on the flying squad...
A mathematical programming approach for scheduling physicians in the emergency room
A mathematical programming approach for scheduling physicians in the emergency room
2000
Preparing a schedule for physicians in the emergency room is a complex task, which...
Lagrangean methods for the 0–1 Quadratic Knapsack
Lagrangean methods for the 0–1 Quadratic Knapsack
1996
It is well known that the Lagrangean decomposition provides better bounds than the...
Using the tabu search method for the distribution of supplies in a hospital
Using the tabu search method for the distribution of supplies in a hospital
1994
Two supply delivery systems in a hospital are compared. In order to evaluate the...
Lagrangean methods for 0-1 quadratic problems
Lagrangean methods for 0-1 quadratic problems
1993
Three Lagrangean methods for 0-1 quadratic programming are presented. The first one...
Lagrangean decomposition for integer nonlinear programming with linear constraints
Lagrangean decomposition for integer nonlinear programming with linear constraints
1991
The authors present a Lagrangean decomposition to study integer nonlinear programming...
Papers per page: