Guignard Monique

Monique Guignard

Information about the author Monique Guignard will soon be added to the site.
Found 30 papers in total
Combining QCR and CHR for convex quadratic pure 0–1 programming problems with linear constraints
Combining QCR and CHR for convex quadratic pure 0–1 programming problems with linear constraints
2012
The convex hull relaxation (CHR) method (Albornoz 2007;...
A branch‐and‐cluster coordination scheme for selecting prison facility sites under uncertainty
A branch‐and‐cluster coordination scheme for selecting prison facility sites under uncertainty
2012
A multi‐period stochastic model and an algorithmic approach to location of...
A Level‐3 Reformulation‐Linearization Technique‐Based Bound for the Quadratic Assignment Problem
A Level‐3 Reformulation‐Linearization Technique‐Based Bound for the Quadratic Assignment Problem
2012
We apply the level‐3 reformulation‐linearization technique (RLT3) to the...
Forestry management under uncertainty
Forestry management under uncertainty
2011
The forest harvest and road construction planning problem consists fundamentally of...
Term-end exam scheduling at United States Military Academy/West Point
Term-end exam scheduling at United States Military Academy/West Point
2010
Scheduling term-end exams ( TEE ) at the United States Military Academy in West Point...
Exact solution of emerging quadratic assignment problems
Exact solution of emerging quadratic assignment problems
2010
We report on a growing class of assignment problems that are increasingly of interest...
En hommage à Joseph-Louis Lagrange et à Pierre Huard
En hommage à Joseph-Louis Lagrange et à Pierre Huard
2007
The contributions to science of Joseph-Louis Lagrange (or Giuseppe Luigi Lagrangia,...
Hybridizing discrete- and continuous-time models for batch sizing and scheduling problems
Hybridizing discrete- and continuous-time models for batch sizing and scheduling problems
2006
This paper proposes a new hybrid technique called ‘partial parameter...
A hybrid approach for integer programming combining genetic algorithms, linear programming and ordinal optimization
A hybrid approach for integer programming combining genetic algorithms, linear programming and ordinal optimization
2001
Hybrid methods are promising tools in integer programming, as they combine the best...
Logical processing for integer programming
Logical processing for integer programming
2005
This paper reviews tools which have great potential for reducing the difficulty of...
A problem of forest harvesting and road building solved through model strengthening and Lagrangean relaxation
A problem of forest harvesting and road building solved through model strengthening and Lagrangean relaxation
2003
We consider a problem of forest planning on pine plantations over a two to five year...
Redefining event variables for efficient modeling of continuous-time batch processing
Redefining event variables for efficient modeling of continuous-time batch processing
2002
We define events so as to reduce the number of events and decision variables needed...
A hybrid approach for integer programming combining genetic algorithms, linear programming and ordinal optimization
A hybrid approach for integer programming combining genetic algorithms, linear programming and ordinal optimization
2001
Hybrid methods are promising tools in integer programming, as they combine the best...
Forest management models and combinatorial algorithms: Analysis of state of the art
Forest management models and combinatorial algorithms: Analysis of state of the art
2000
Linear Programming and Mixed Integer Linear Programs have been used for forest...
Model tightening for integrated timber harvest and transportation planning
Model tightening for integrated timber harvest and transportation planning
1998
Integrated timber harvest and transportation planning problems can be modeled as 0-1...
Efficient cuts in Lagrangean ‘relax-and-cut’ schemes
Efficient cuts in Lagrangean ‘relax-and-cut’ schemes
1998
Lagrangean relaxation produces bounds on the optimal value of (mixed) integer...
Studying the effects of production loss due to setup in dynamic production scheduling
Studying the effects of production loss due to setup in dynamic production scheduling
1994
The authors study the effects of production loss during setup in dynamic production...
A hybrid bounding procedure for the workload allocation problem on parallel unrelated machines with setups
A hybrid bounding procedure for the workload allocation problem on parallel unrelated machines with setups
1996
A nonpreemptive single stage manufacturing process with parallel, unrelated machines...
Selection of capacity expansion projects
Selection of capacity expansion projects
1995
The problem of determining a project slection schedule and a...
Dynamic production scheduling for a process industry
Dynamic production scheduling for a process industry
1994
Capacity-oriented production scheduling can be described as the assignment of...
A Lagrangean relax-and-cut approach for the sequential ordering problem with precedence relationships
A Lagrangean relax-and-cut approach for the sequential ordering problem with precedence relationships
1994
The sequential ordering problem with precedence relationships was introduced by...
Exact algorithms for the Setup Knapsack problem
Exact algorithms for the Setup Knapsack problem
1994
The Setup Knapsack problem consists in selecting items from a set of disjoint families...
Applying a modified coefficient reduction method to a dynamic production scheduling model
Applying a modified coefficient reduction method to a dynamic production scheduling model
1992
This paper develops and tests a short-run production scheduling model for process...
Solving makespan minimization problems with Lagrangean decomposition
Solving makespan minimization problems with Lagrangean decomposition
1993
The problem of minimizing makespan in a single stage manufacturing process with...
Papers per page: