Search techniques with adaptive features for certain integer and mixed integer programming problems. - Monique Guignard 001; Kurt Spielberg (IFIP Congress (1), 1968)

The Collapsing 0-1 Knapsack Problem. - Marc E. Posner; Monique Guignard 001 (Math. Program., 1978)

A direct dual method for the mixed plant location problem with some side constraints. - Monique Guignard 001; Kurt Spielberg (Math. Program., 1979)

Logical Reduction Methods in Zero-One Programming - Minimal Preferred Variables. - Monique Guignard 001; Kurt Spielberg (Oper. Res., 1981)

Lagrangean decomposition: A model yielding stronger lagrangean bounds. - Monique Guignard 001; Siwhan Kim (Math. Program., 1987)

Technical Note - An Improved Dual Based Algorithm for the Generalized Assignment Problem. - Monique Guignard 001; Moshe B. Rosenwein (Oper. Res., 1989)

An application of lagrangean decomposition to the resource-constrained minimum weighted arborescence problem. - Monique Guignard 001; Moshe B. Rosenwein (Networks, 1990)

Variations in model formulations. - Jae Sik Lee; Monique Guignard 001; Christopher V. Jones (Ann. Oper. Res., 1992)

Solving Makespan Minimization Problems with Lagrangean Decomposition. - Monique Guignard 001 (Discret. Appl. Math., 1993)

A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships. - Laureano F. Escudero; Monique Guignard 001; Kavindra Malik (Ann. Oper. Res., 1994)

Dynamic Production Scheduling for a Process Industry. - Renato E. deMatta; Monique Guignard 001 (Oper. Res., 1994)

Polyhedral Analysis and Decompositions for Capacitated Plant Location-type Problems. - Bintong Chena; Monique Guignard 001 (Discret. Appl. Math., 1998)

Efficient cuts in Lagrangean 'Relax-and-cut' schemes. - Monique Guignard 001 (Eur. J. Oper. Res., 1998)

Model tightening for integrated timber harvest and transportation planning. - Monique Guignard 001; Choonho Ryu; Kurt Spielberg (Eur. J. Oper. Res., 1998)

Forest management models and combinatorial algorithms: analysis of state of the art. - Andrés Weintraub; Richard L. Church; Alan T. Murray; Monique Guignard 001 (Ann. Oper. Res., 2000)

A Hybrid approach for integer programming combining genetic algorithms, linear programming and ordinal optimization. - Yuh-Chuyn Luo; Monique Guignard 001; Chun-Hung Chen (J. Intell. Manuf., 2001)

Redefining Event Variables for Efficient Modeling of Continuous-Time Batch Processing. - Siqun Wang; Monique Guignard 001 (Ann. Oper. Res., 2002)

A Problem of Forest Harvesting and Road Building Solved Through Model Strengthening and Lagrangean Relaxation. - Nicolas Andalaft; Pablo Andalaft; Monique Guignard 001; Adrian Magendzo; Alexis Wainer; Andrés Weintraub (Oper. Res., 2003)

Scheduling Deliveries in Vehicles with Multiple Compartments. - Emmanuel D. Chajakis; Monique Guignard 001 (J. Glob. Optim., 2003)

School redistricting: embedding GIS tools with integer programming. - Felipe Caro; Takeshi Shirabe; Monique Guignard 001; Andrés Weintraub (J. Oper. Res. Soc., 2004)

Preface. - Monique Guignard-Spielberg; Kurt Spielberg (Ann. Oper. Res., 2005)

Logical Processing for Integer Programming. - Monique Guignard 001; Ellis L. Johnson; Kurt Spielberg (Ann. Oper. Res., 2005)

Hybridizing discrete- and continuous-time models for batch sizing and scheduling problems. - Siqun Wang; Monique Guignard 001 (Comput. Oper. Res., 2006)

En hommage à Joseph-Louis Lagrange et à Pierre Huard. - Monique Guignard 001 (Ann. Oper. Res., 2007)

Preface: History of integer programming: distinguished personal notes and reminiscences. - Kurt Spielberg; Monique Guignard-Spielberg (Ann. Oper. Res., 2007)

A level-2 reformulation-linearization technique bound for the quadratic assignment problem. - Warren P. Adams; Monique Guignard 001; Peter M. Hahn; William L. Hightower (Eur. J. Oper. Res., 2007)

An algorithm for the generalized quadratic assignment problem. - Peter M. Hahn; Bum-Jin Kim; Monique Guignard 001; J. MacGregor Smith; Yi-Rong Zhu (Comput. Optim. Appl., 2008)

The quadratic three-dimensional assignment problem: Exact and approximate solution methods. - Peter M. Hahn; Bum-Jin Kim; Thomas Stützle; Sebastian Kanthak; William L. Hightower; Harvind Samra; Zhi Ding 001; Monique Guignard 001 (Eur. J. Oper. Res., 2008)

Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the Reformulation-Linearization Technique. - Artur Alves Pessoa; Peter M. Hahn; Monique Guignard 001; Yi-Rong Zhu (Eur. J. Oper. Res., 2010)

Exact solution of emerging quadratic assignment problems. - Peter M. Hahn; Yi-Rong Zhu; Monique Guignard 001; J. MacGregor Smith (Int. Trans. Oper. Res., 2010)

Term-end exam scheduling at United States Military Academy/West Point. - Siqun Wang; Michael R. Bussieck; Monique Guignard 001; Alexander Meeraus; Fred O'Brien (J. Sched., 2010)

Combining Approaches to Improve Bounds. - Monique Guignard 001 (Stud. Inform. Univ., 2010)

Forestry management under uncertainty. - Antonio Alonso-Ayuso; Laureano F. Escudero; Monique Guignard 001; Martín Quinteros; Andrés Weintraub (Ann. Oper. Res., 2011)

Combining QCR and CHR for convex quadratic pure 0-1 programming problems with linear constraints. - Aykut Ahlatçioglu; Michael R. Bussieck; Mustafa Esen; Monique Guignard 001; Jan-Hendrick Jagla; Alexander Meeraus (Ann. Oper. Res., 2012)

A branch-and-cluster coordination scheme for selecting prison facility sites under uncertainty. - Patricio Hernández; Antonio Alonso-Ayuso; Fernanda Bravo; Laureano F. Escudero; Monique Guignard 001; Vladimir Marianov; Andrés Weintraub (Comput. Oper. Res., 2012)

A Level-3 Reformulation-Linearization Technique-Based Bound for the Quadratic Assignment Problem. - Peter M. Hahn; Yi-Rong Zhu; Monique Guignard 001; William L. Hightower; Matthew J. Saltzman (INFORMS J. Comput., 2012)

Medium range optimization of copper extraction planning under uncertainty in future copper prices. - Antonio Alonso-Ayuso; Felipe Carvallo; Laureano F. Escudero; Monique Guignard 001; Jiaxing Pi; Raghav Puranmalka; Andrés Weintraub (Eur. J. Oper. Res., 2014)

Risk management for forestry planning under uncertainty in demand and prices. - Antonio Alonso-Ayuso; Laureano F. Escudero; Monique Guignard 001; Andrés Weintraub (Eur. J. Oper. Res., 2018)

Optimizing the pipeline planning system at the national oil company. - Martín Quinteros; Monique Guignard 001; Andrés Weintraub; Marc Llambias; Camilo Tapia (Eur. J. Oper. Res., 2019)

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

On dealing with strategic and tactical decision levels in forestry planning under uncertainty. - Antonio Alonso-Ayuso; Laureano F. Escudero; Monique Guignard 001; Andrés Weintraub (Comput. Oper. Res., 2020)

The convex hull heuristic for nonlinear integer programming problems with linear constraints and application to quadratic 0-1 problems. - Monique Guignard 001; Aykut Ahlatçioglu (J. Heuristics, 2021)