default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMonique Guignard-Spielberg
Person information
- affiliation: University of Pennsylvania, Philadelphia, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2021
[j42]Monique Guignard
, Aykut Ahlatçioglu:
The convex hull heuristic for nonlinear integer programming problems with linear constraints and application to quadratic 0-1 problems. J. Heuristics 27(1-2): 251-265 (2021)- 2020
- [j41]Monique Guignard:
Strong RLT1 bounds from decomposable Lagrangean relaxation for some quadratic 0-1 optimization problems with linear constraints. Ann. Oper. Res. 286(1): 173-200 (2020) - [j40]Antonio Alonso-Ayuso, Laureano F. Escudero, Monique Guignard, Andrés Weintraub:
On dealing with strategic and tactical decision levels in forestry planning under uncertainty. Comput. Oper. Res. 115: 104836 (2020) - 2019
- [j39]Martín Quinteros, Monique Guignard, Andrés Weintraub, Marc Llambias, Camilo Tapia:
Optimizing the pipeline planning system at the national oil company. Eur. J. Oper. Res. 277(2): 727-739 (2019) - 2018
- [j38]Antonio Alonso-Ayuso, Laureano F. Escudero, Monique Guignard, Andrés Weintraub:
Risk management for forestry planning under uncertainty in demand and prices. Eur. J. Oper. Res. 267(3): 1051-1074 (2018) - 2014
- [j37]Antonio Alonso-Ayuso, Felipe Carvallo, Laureano F. Escudero, Monique Guignard, Jiaxing Pi, Raghav Puranmalka, Andrés Weintraub:
Medium range optimization of copper extraction planning under uncertainty in future copper prices. Eur. J. Oper. Res. 233(3): 711-726 (2014) - 2012
- [j36]Aykut Ahlatçioglu, Michael R. Bussieck, Mustafa Esen, Monique Guignard, Jan-Hendrick Jagla, Alexander Meeraus:
Combining QCR and CHR for convex quadratic pure 0-1 programming problems with linear constraints. Ann. Oper. Res. 199(1): 33-49 (2012) - [j35]Patricio Hernández, Antonio Alonso-Ayuso, Fernanda Bravo, Laureano F. Escudero, Monique Guignard, Vladimir Marianov, Andrés Weintraub:
A branch-and-cluster coordination scheme for selecting prison facility sites under uncertainty. Comput. Oper. Res. 39(9): 2232-2241 (2012) - [j34]Peter M. Hahn, Yi-Rong Zhu, Monique Guignard, William L. Hightower, Matthew J. Saltzman:
A Level-3 Reformulation-Linearization Technique-Based Bound for the Quadratic Assignment Problem. INFORMS J. Comput. 24(2): 202-209 (2012) - 2011
- [j33]Antonio Alonso-Ayuso, Laureano F. Escudero, Monique Guignard, Martín Quinteros, Andrés Weintraub:
Forestry management under uncertainty. Ann. Oper. Res. 190(1): 17-39 (2011) - 2010
- [j32]Artur Alves Pessoa, Peter M. Hahn, Monique Guignard, Yi-Rong Zhu:
Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the Reformulation-Linearization Technique. Eur. J. Oper. Res. 206(1): 54-63 (2010) - [j31]Peter M. Hahn, Yi-Rong Zhu, Monique Guignard, J. MacGregor Smith:
Exact solution of emerging quadratic assignment problems. Int. Trans. Oper. Res. 17(5): 525-552 (2010) - [j30]Siqun Wang, Michael R. Bussieck, Monique Guignard, Alexander Meeraus, Fred O'Brien:
Term-end exam scheduling at United States Military Academy/West Point. J. Sched. 13(4): 375-391 (2010) - [j29]Monique Guignard:
Combining Approaches to Improve Bounds. Stud. Inform. Univ. 8(2): 1-16 (2010) - 2008
- [j28]Peter M. Hahn, Bum-Jin Kim, Monique Guignard, J. MacGregor Smith, Yi-Rong Zhu:
An algorithm for the generalized quadratic assignment problem. Comput. Optim. Appl. 40(3): 351-372 (2008) - [j27]Peter M. Hahn, Bum-Jin Kim, Thomas Stützle, Sebastian Kanthak, William L. Hightower, Harvind Samra, Zhi Ding, Monique Guignard:
The quadratic three-dimensional assignment problem: Exact and approximate solution methods. Eur. J. Oper. Res. 184(2): 416-428 (2008) - 2007
- [j26]Kurt Spielberg, Monique Guignard-Spielberg:
Preface: History of integer programming: distinguished personal notes and reminiscences. Ann. Oper. Res. 149(1): 3-4 (2007) - [j25]Monique Guignard:
En hommage à Joseph-Louis Lagrange et à Pierre Huard. Ann. Oper. Res. 149(1): 103-116 (2007) - [j24]Warren P. Adams, Monique Guignard, Peter M. Hahn, William L. Hightower:
A level-2 reformulation-linearization technique bound for the quadratic assignment problem. Eur. J. Oper. Res. 180(3): 983-996 (2007) - 2006
- [j23]Siqun Wang, Monique Guignard:
Hybridizing discrete- and continuous-time models for batch sizing and scheduling problems. Comput. Oper. Res. 33: 971-993 (2006) - 2005
- [j22]Monique Guignard-Spielberg, Kurt Spielberg:
Preface. Ann. Oper. Res. 139(1): 17-20 (2005) - [j21]Monique Guignard-Spielberg, Kurt Spielberg:
Preface. Ann. Oper. Res. 140(1): 17-20 (2005) - [j20]Monique Guignard, Ellis L. Johnson, Kurt Spielberg:
Logical Processing for Integer Programming. Ann. Oper. Res. 140(1): 263-304 (2005) - 2004
- [j19]Felipe Caro, Takeshi Shirabe, Monique Guignard, Andrés Weintraub:
School redistricting: embedding GIS tools with integer programming. J. Oper. Res. Soc. 55(8): 836-849 (2004) - 2003
- [j18]Nicolas Andalaft, Pablo Andalaft, Monique Guignard, Adrian Magendzo, Alexis Wainer, Andrés Weintraub:
A Problem of Forest Harvesting and Road Building Solved Through Model Strengthening and Lagrangean Relaxation. Oper. Res. 51(4): 613-628 (2003) - [j17]Emmanuel D. Chajakis, Monique Guignard:
Scheduling Deliveries in Vehicles with Multiple Compartments. J. Glob. Optim. 26(1): 43-78 (2003) - 2002
- [j16]Siqun Wang, Monique Guignard:
Redefining Event Variables for Efficient Modeling of Continuous-Time Batch Processing. Ann. Oper. Res. 116(1-4): 113-126 (2002) - 2001
- [j15]Yuh-Chuyn Luo, Monique Guignard, Chun-Hung Chen:
A Hybrid approach for integer programming combining genetic algorithms, linear programming and ordinal optimization. J. Intell. Manuf. 12(5-6): 509-519 (2001) - 2000
- [j14]Andrés Weintraub, Richard L. Church, Alan T. Murray, Monique Guignard:
Forest management models and combinatorial algorithms: analysis of state of the art. Ann. Oper. Res. 96(1-4): 271-285 (2000) - 1998
- [j13]Bintong Chena, Monique Guignard:
Polyhedral Analysis and Decompositions for Capacitated Plant Location-type Problems. Discret. Appl. Math. 82(1-3): 79-91 (1998) - [j12]Monique Guignard:
Efficient cuts in Lagrangean 'Relax-and-cut' schemes. Eur. J. Oper. Res. 105(1): 216-223 (1998) - [j11]Monique Guignard, Choonho Ryu, Kurt Spielberg:
Model tightening for integrated timber harvest and transportation planning. Eur. J. Oper. Res. 111(3): 448-460 (1998) - 1994
- [j10]Laureano F. Escudero, Monique Guignard, Kavindra Malik:
A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships. Ann. Oper. Res. 50(1): 219-237 (1994) - [j9]Renato E. deMatta, Monique Guignard:
Dynamic Production Scheduling for a Process Industry. Oper. Res. 42(3): 492-503 (1994) - 1993
- [j8]Monique Guignard:
Solving Makespan Minimization Problems with Lagrangean Decomposition. Discret. Appl. Math. 42(1): 17-29 (1993) - 1992
- [j7]Jae Sik Lee, Monique Guignard, Christopher V. Jones:
Variations in model formulations. Ann. Oper. Res. 38(1): 325-357 (1992) - 1990
- [j6]Monique Guignard, Moshe B. Rosenwein:
An application of lagrangean decomposition to the resource-constrained minimum weighted arborescence problem. Networks 20(3): 345-359 (1990) - 1989
- [j5]Monique Guignard, Moshe B. Rosenwein:
Technical Note - An Improved Dual Based Algorithm for the Generalized Assignment Problem. Oper. Res. 37(4): 658-663 (1989) - 1987
- [j4]Monique Guignard, Siwhan Kim:
Lagrangean decomposition: A model yielding stronger lagrangean bounds. Math. Program. 39(2): 215-228 (1987) - 1981
- [j3]Monique Guignard, Kurt Spielberg:
Logical Reduction Methods in Zero-One Programming - Minimal Preferred Variables. Oper. Res. 29(1): 49-74 (1981) - 1979
- [j2]Monique Guignard, Kurt Spielberg:
A direct dual method for the mixed plant location problem with some side constraints. Math. Program. 17(1): 198-228 (1979) - 1978
- [j1]Marc E. Posner, Monique Guignard:
The Collapsing 0-1 Knapsack Problem. Math. Program. 15(1): 155-161 (1978)
Conference and Workshop Papers
- 1968
- [c1]Monique Guignard, Kurt Spielberg:
Search techniques with adaptive features for certain integer and mixed integer programming problems. IFIP Congress (1) 1968: 238-244
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-02 20:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
