M. Guignard

发表

Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space

M. Guignard, 1969 .

Lagrangean relaxation

M. Guignard, 2003 .

Algorithms for Exploiting the Structure of the Simple Plant Location Problem

M. Guignard, K. Spielberg, 1977 .

Lagrangean decomposition for integer programming: theory and applications

M. Guignard, Siwhan Kim, 1987 .

A Lagrangean dual ascent algorithm for simple plant location problems

M. Guignard, 1988 .

Reduction Methods for State Enumeration Integer Programming

M. Guignard, K. Spielberg, 1977 .

An application-oriented guide for designing Lagrangean dual ascent algorithms

M. Rosenwein, M. Guignard, 1989 .

Polyhedral Analysis and Decompositions for Capacitated Plant Location-type Problems

M. Guignard, Bin Chena, 1998, Discret. Appl. Math..

The performance of rolling production schedules in a process industry

Monique Guignard, Renato de Matta, M. Guignard, 1995 .

Studying the effects of production loss due to setup in dynamic production scheduling

Renato de Matta, M. Guignard, R. Matta, 1994 .

Lagrangean dual ascent algorithms for computing bounds in capacitated plant location problems

M. Guignard, Kongkiat Opaswongkarn, 1990 .

Fractional vertices, cuts and facets of the simple plant location problem

M. Guignard, 1980 .

Applying a modified coefficient reduction method to a dynamic production scheduling model

M. Guignard, M. Liberatore, 1992 .

An approximate algorithm for multidimensional zero-one knapsack problems

Jae Sik Lee, Monique Guignard, M. Guignard, 1988 .

Algorithms for the Cross-dock Door Assignment Problem

Monique Guignard, Peter M. Hahn, M. Guignard, 2012 .

Hybrid ARQ Symbol Mapping in Digital Wireless Communication Systems Based on the Quadratic 3-dimensional Assignment Problem (Q3AP)

Zhi Ding, Thomas Stützle, Bum-Jin Kim, 2005 .

Strong RLT1 bounds from decomposable Lagrangean relaxation for some quadratic 0–1 optimization problems with linear constraints

M. Guignard, 2018, Ann. Oper. Res..

Combining Approaches to Improve Bounds on Convex Quadratic MINLP Problems 1

M. Guignard, 2010 .

Contents ( Sommaire ) Combining Approaches to Improve Bounds on Convex Quadratic MINLP Problems

M. Guignard, 2022 .

Efficient cuts in Lagrangean 'Relax-and-cut' schemes

M. Guignard, 1998, Eur. J. Oper. Res..

Solving Makespan Minimization Problems with Lagrangean Decomposition

M. Guignard, 1993, Discret. Appl. Math..

Search techniques with adaptive features for certain integer and mixed integer programming problems

Monique Guignard-Spielberg, Kurt Spielberg, M. Guignard, 1968, IFIP Congress.

Finding Alternative Solutions of Interest for the Cross-Dock Door Assignment ( CDAP ) Problem

M. Guignard, S. Kimbrough, 2018 .

Uncertainty in Forest Production Planning

L. Escudero, M. Guignard, A. Weintraub, 2011 .

Medium range optimization of copper extraction planning under uncertainty in future copper prices

Laureano F. Escudero, Monique Guignard-Spielberg, Andrés Weintraub, 2014, Eur. J. Oper. Res..

The convex hull heuristic for nonlinear integer programming problems with linear constraints and application to quadratic 0–1 problems

M. Guignard, Aykut Ahlatçioglu, 2020, Journal of Heuristics.

Combining QCR and CHR for convex quadratic pure 0–1 programming problems with linear constraints

Alexander Meeraus, M. Guignard, M. Bussieck, 2011, Annals of Operations Research.

Strong RLT1 bounds from decomposable Lagrangean relaxation for some quadratic 0–1 optimization problems with linear constraints

M. Guignard, 2018, Annals of Operations Research.

Risk management for forestry planning under uncertainty in demand and prices

Laureano F. Escudero, Monique Guignard-Spielberg, Andrés Weintraub, 2017, Eur. J. Oper. Res..

Redefining Event Variables for Efficient Modeling of Continuous-Time Batch Processing

Monique Guignard-Spielberg, Siqun Wang, M. Guignard, 2002, Ann. Oper. Res..

A Hybrid approach for integer programming combining genetic algorithms, linear programming and ordinal optimization

Chun-Hung Chen, Monique Guignard-Spielberg, Yuh-Chuyn Luo, 2001, J. Intell. Manuf..

An EÅcient Approach Integrating Genetic Algorithm, Linear Programming, and Ordinal Optimization for Linear Mixed Integer Programming Problems

Chun-Hung Chen, Monique Guignard, Yuh-Chyun Luo, 2001 .

School redistricting: embedding GIS tools with integer programming

Felipe Caro, Monique Guignard-Spielberg, Andrés Weintraub, 2004, J. Oper. Res. Soc..

The quadratic three-dimensional assignment problem: Exact and approximate solution methods

Zhi Ding, Thomas Stützle, Harvind Samra, 2008, Eur. J. Oper. Res..

A Problem of Forest Harvesting and Road Building Solved Through Model Strengthening and Lagrangean Relaxation

Monique Guignard-Spielberg, Andrés Weintraub, Adrian Magendzo, 2003, Oper. Res..

Optimizing the pipeline planning system at the national oil company

Monique Guignard-Spielberg, Andrés Weintraub, Martín Quinteros, 2019, Eur. J. Oper. Res..

Lagrangean decomposition: A model yielding stronger lagrangean bounds

Monique Guignard-Spielberg, Siwhan Kim, M. Guignard, 1987, Math. Program..

Dynamic Production Scheduling for a Process Industry

Monique Guignard-Spielberg, Renato de Matta, Renato E. deMatta, 1994, Oper. Res..

Term-end exam scheduling at United States Military Academy/West Point

Michael R. Bussieck, Monique Guignard-Spielberg, Alexander Meeraus, 2010, J. Sched..

The convex hull heuristic for nonlinear integer programming problems with linear constraints and application to quadratic 0–1 problems

Monique Guignard, Aykut Ahlatcioglu, M. Guignard, 2020, J. Heuristics.

The Convex Hull Heuristic for Nonlinear 0-1 Programming Problems with Linear Constraints

M. Guignard, Aykut Ahlatçioglu, 2017 .

Forestry management under uncertainty

Laureano F. Escudero, Monique Guignard-Spielberg, Andrés Weintraub, 2011, Ann. Oper. Res..

On dealing with strategic and tactical decision levels in forestry planning under uncertainty

Laureano F. Escudero, Monique Guignard-Spielberg, Andrés Weintraub, 2020, Comput. Oper. Res..

Combining QCR and CHR for convex quadratic pure 0–1 programming problems with linear constraints

Michael R. Bussieck, Monique Guignard-Spielberg, Jan-Hendrick Jagla, 2012, Annals of Operations Research.

Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the Reformulation-Linearization Technique

Monique Guignard-Spielberg, Artur Alves Pessoa, Peter M. Hahn, 2010, Eur. J. Oper. Res..

Logical Reduction Methods in Zero-One Programming - Minimal Preferred Variables

Monique Guignard-Spielberg, Kurt Spielberg, M. Guignard, 1981, Oper. Res..

A direct dual method for the mixed plant location problem with some side constraints

Monique Guignard-Spielberg, Kurt Spielberg, M. Guignard, 1979, Math. Program..

The Container Scheduling and Cross-dock Door Selection Problem

B. Jaumard, M. Guignard, P. Hahn, 2017 .

A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships

Kavindra Malik, Laureano F. Escudero, Monique Guignard-Spielberg, 1994, Ann. Oper. Res..

Exact solution of emerging quadratic assignment problems

Monique Guignard-Spielberg, James MacGregor Smith, Peter M. Hahn, 2010, Int. Trans. Oper. Res..

Memory-Aware Parallelized RLT 3 for solving Quadratic Assignment Problems

M. Guignard, A. Roth, M. Saltzman, 2013 .

A level-2 reformulation-linearization technique bound for the quadratic assignment problem

Monique Guignard-Spielberg, Warren P. Adams, Peter M. Hahn, 2007, Eur. J. Oper. Res..

Lagrangean Relaxation A Tutorial

Monique Guignard, M. Guignard, 2008 .

A branch-and-cluster coordination scheme for selecting prison facility sites under uncertainty

Vladimir Marianov, Laureano F. Escudero, Monique Guignard-Spielberg, 2012, Comput. Oper. Res..

Selection of Capacity Expansion Projects

Hochang Lee, Monique Guignard, M. Guignard, 1995 .

An algorithm for the generalized quadratic assignment problem

Monique Guignard-Spielberg, James MacGregor Smith, Bum-Jin Kim, 2008, Comput. Optim. Appl..

Technical Note - An Improved Dual Based Algorithm for the Generalized Assignment Problem

Monique Guignard-Spielberg, Moshe B. Rosenwein, M. Rosenwein, 1989, Oper. Res..