Monique Guignard-Spielberg
Orcid: 0000-0003-4084-434XAffiliations:
- University of Pennsylvania, Philadelphia, USA
According to our database1,
Monique Guignard-Spielberg
authored at least 42 papers
between 1968 and 2021.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
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
Eur. J. Oper. Res., 2019
2018
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
2010
J. Sched., 2010
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
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
2006
Hybridizing discrete- and continuous-time models for batch sizing and scheduling problems.
Comput. Oper. Res., 2006
2005
2004
J. Oper. Res. Soc., 2004
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
Ann. Oper. Res., 2000
1998
Eur. J. Oper. Res., 1998
Discret. Appl. Math., 1998
1994
A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships.
Ann. Oper. Res., 1994
1993
Discret. Appl. Math., 1993
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
Math. Program., 1987
1981
Oper. Res., 1981
1979
A direct dual method for the mixed plant location problem with some side constraints.
Math. Program., 1979
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