Monique Guignard-Spielberg

Orcid: 0000-0003-4084-434X

Affiliations:
  • University of Pennsylvania, Philadelphia, USA


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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
The convex hull heuristic for nonlinear integer programming problems with linear constraints and application to quadratic 0-1 problems.
J. Heuristics, 2021

2020
On dealing with strategic and tactical decision levels in forestry planning under uncertainty.
Comput. Oper. Res., 2020

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

2019
Optimizing the pipeline planning system at the national oil company.
Eur. J. Oper. Res., 2019

2018
Risk management for forestry planning under uncertainty in demand and prices.
Eur. J. Oper. Res., 2018

2014
Medium range optimization of copper extraction planning under uncertainty in future copper prices.
Eur. J. Oper. Res., 2014

2012
A Level-3 Reformulation-Linearization Technique-Based Bound for the Quadratic Assignment Problem.
INFORMS J. Comput., 2012

A branch-and-cluster coordination scheme for selecting prison facility sites under uncertainty.
Comput. Oper. Res., 2012

Combining QCR and CHR for convex quadratic pure 0-1 programming problems with linear constraints.
Ann. Oper. Res., 2012

2011
Forestry management under uncertainty.
Ann. Oper. Res., 2011

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

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

Exact solution of emerging quadratic assignment problems.
Int. Trans. Oper. Res., 2010

Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the Reformulation-Linearization Technique.
Eur. J. Oper. Res., 2010

2008
The quadratic three-dimensional assignment problem: Exact and approximate solution methods.
Eur. J. Oper. Res., 2008

An algorithm for the generalized quadratic assignment problem.
Comput. Optim. Appl., 2008

2007
A level-2 reformulation-linearization technique bound for the quadratic assignment problem.
Eur. J. Oper. Res., 2007

Preface: History of integer programming: distinguished personal notes and reminiscences.
Ann. Oper. Res., 2007

En hommage à Joseph-Louis Lagrange et à Pierre Huard.
Ann. Oper. Res., 2007

2006
Hybridizing discrete- and continuous-time models for batch sizing and scheduling problems.
Comput. Oper. Res., 2006

2005
Logical Processing for Integer Programming.
Ann. Oper. Res., 2005

Preface.
Ann. Oper. Res., 2005

2004
School redistricting: embedding GIS tools with integer programming.
J. Oper. Res. Soc., 2004

2003
Scheduling Deliveries in Vehicles with Multiple Compartments.
J. Glob. Optim., 2003

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

2002
Redefining Event Variables for Efficient Modeling of Continuous-Time Batch Processing.
Ann. Oper. Res., 2002

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

2000
Forest management models and combinatorial algorithms: analysis of state of the art.
Ann. Oper. Res., 2000

1998
Model tightening for integrated timber harvest and transportation planning.
Eur. J. Oper. Res., 1998

Efficient cuts in Lagrangean 'Relax-and-cut' schemes.
Eur. J. Oper. Res., 1998

Polyhedral Analysis and Decompositions for Capacitated Plant Location-type Problems.
Discret. Appl. Math., 1998

1994
Dynamic Production Scheduling for a Process Industry.
Oper. Res., 1994

A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships.
Ann. Oper. Res., 1994

1993
Solving Makespan Minimization Problems with Lagrangean Decomposition.
Discret. Appl. Math., 1993

1992
Variations in model formulations.
Ann. Oper. Res., 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.
Oper. Res., 1989

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

1981
Logical Reduction Methods in Zero-One Programming - Minimal Preferred Variables.
Oper. Res., 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...