Monique Guignard-Spielberg

According to our database1, Monique Guignard-Spielberg authored at least 41 papers between 1968 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2020
On dealing with strategic and tactical decision levels in forestry planning under uncertainty.
Computers & OR, 2020

Strong RLT1 bounds from decomposable Lagrangean relaxation for some quadratic 0-1 optimization problems with linear constraints.
Annals OR, 2020

2019
Optimizing the pipeline planning system at the national oil company.
European Journal of Operational Research, 2019

2018
Risk management for forestry planning under uncertainty in demand and prices.
European Journal of Operational Research, 2018

2014
Medium range optimization of copper extraction planning under uncertainty in future copper prices.
European Journal of Operational Research, 2014

2012
A Level-3 Reformulation-Linearization Technique-Based Bound for the Quadratic Assignment Problem.
INFORMS Journal on Computing, 2012

A branch-and-cluster coordination scheme for selecting prison facility sites under uncertainty.
Computers & OR, 2012

Combining QCR and CHR for convex quadratic pure 0-1 programming problems with linear constraints.
Annals OR, 2012

2011
Forestry management under uncertainty.
Annals OR, 2011

2010
Combining Approaches to Improve Bounds.
Stud. Inform. Univ., 2010

Term-end exam scheduling at United States Military Academy/West Point.
J. Scheduling, 2010

Exact solution of emerging quadratic assignment problems.
ITOR, 2010

Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the Reformulation-Linearization Technique.
European Journal of Operational Research, 2010

2008
The quadratic three-dimensional assignment problem: Exact and approximate solution methods.
European Journal of Operational Research, 2008

An algorithm for the generalized quadratic assignment problem.
Comp. Opt. and Appl., 2008

2007
A level-2 reformulation-linearization technique bound for the quadratic assignment problem.
European Journal of Operational Research, 2007

Preface: History of integer programming: distinguished personal notes and reminiscences.
Annals OR, 2007

En hommage à Joseph-Louis Lagrange et à Pierre Huard.
Annals OR, 2007

2006
Hybridizing discrete- and continuous-time models for batch sizing and scheduling problems.
Computers & OR, 2006

2005
Logical Processing for Integer Programming.
Annals OR, 2005

Preface.
Annals OR, 2005

2004
School redistricting: embedding GIS tools with integer programming.
JORS, 2004

2003
Scheduling Deliveries in Vehicles with Multiple Compartments.
J. Global Optimization, 2003

A Problem of Forest Harvesting and Road Building Solved Through Model Strengthening and Lagrangean Relaxation.
Operations Research, 2003

2002
Redefining Event Variables for Efficient Modeling of Continuous-Time Batch Processing.
Annals OR, 2002

2001
A Hybrid approach for integer programming combining genetic algorithms, linear programming and ordinal optimization.
J. Intelligent Manufacturing, 2001

2000
Forest management models and combinatorial algorithms: analysis of state of the art.
Annals OR, 2000

1998
Model tightening for integrated timber harvest and transportation planning.
European Journal of Operational Research, 1998

Efficient cuts in Lagrangean 'Relax-and-cut' schemes.
European Journal of Operational Research, 1998

Polyhedral Analysis and Decompositions for Capacitated Plant Location-type Problems.
Discrete Applied Mathematics, 1998

1994
Dynamic Production Scheduling for a Process Industry.
Operations Research, 1994

A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships.
Annals OR, 1994

1993
Solving Makespan Minimization Problems with Lagrangean Decomposition.
Discrete Applied Mathematics, 1993

1992
Variations in model formulations.
Annals OR, 1992

1990
An application of lagrangean decomposition to the resource-constrained minimum weighted arborescence problem.
Networks, 1990

1989
Technical Note - An Improved Dual Based Algorithm for the Generalized Assignment Problem.
Operations Research, 1989

1987
Lagrangean decomposition: A model yielding stronger lagrangean bounds.
Math. Program., 1987

1981
Logical Reduction Methods in Zero-One Programming - Minimal Preferred Variables.
Operations Research, 1981

1979
A direct dual method for the mixed plant location problem with some side constraints.
Math. Program., 1979

1978
The Collapsing 0-1 Knapsack Problem.
Math. Program., 1978

1968
Search techniques with adaptive features for certain integer and mixed integer programming problems.
Proceedings of the Information Processing, Proceedings of IFIP Congress 1968, Edinburgh, UK, 5-10 August 1968, Volume 1, 1968


  Loading...