default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPierre Bonami
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j29]Pierre Bonami, Andrea Lodi
, Giulia Zarpellon:
A Classifier to Decide on the Linearization of Mixed-Integer Quadratic Problems in CPLEX. Oper. Res. 70(6): 3303-3320 (2022)- 2020
- [c9]Pierre Bonami, Domenico Salvagnin, Andrea Tramontani:
Implementing Automatic Benders Decomposition in a Modern MIP Solver. IPCO 2020: 78-90
2010 – 2019
- 2019
- [j28]Pierre Bonami, Andrea Lodi, Jonas Schweiger, Andrea Tramontani:
Solving Quadratic Programming by Cutting Planes. SIAM J. Optim. 29(2): 1076-1105 (2019) - 2018
- [j27]Pierre Bonami, Oktay Günlük, Jeff T. Linderoth:
Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods. Math. Program. Comput. 10(3): 333-382 (2018) - [c8]Pierre Bonami, Andrea Lodi, Giulia Zarpellon:
Learning a Classification of Mixed-Integer Quadratic Programming Problems. CPAIOR 2018: 595-604 - [i2]Pierre Bonami, Ambros M. Gleixner, Jeff T. Linderoth, Ruth Misener:
Designing and Implementing Algorithms for Mixed-Integer Nonlinear Optimization (Dagstuhl Seminar 18081). Dagstuhl Reports 8(2): 64-87 (2018) - 2017
- [j26]Pierre Bonami, Dorian Mazauric, Yann Vaxès:
Maximum flow under proportional delay constraint. Theor. Comput. Sci. 689: 58-66 (2017) - [c7]Pierre Bonami, Andrea Lodi, Andrea Tramontani, Sven Wiese:
Cutting Planes from Wide Split Disjunctions. IPCO 2017: 99-110 - 2016
- [j25]Pietro Belotti, Pierre Bonami, Matteo Fischetti, Andrea Lodi, Michele Monaci, Amaya Nogales-Gómez, Domenico Salvagnin:
On handling indicator constraints in mixed integer programming. Comput. Optim. Appl. 65(3): 545-566 (2016) - 2015
- [j24]Pierre Bonami, Andrea Lodi, Andrea Tramontani, Sven Wiese:
On mathematical programming with indicator constraints. Math. Program. 151(1): 191-223 (2015) - [j23]Pierre Bonami, François Margot:
Cut generation through binarization. Math. Program. 154(1-2): 197-223 (2015) - 2014
- [j22]Hassan L. Hijazi, Pierre Bonami, Adam Ouorou:
An Outer-Inner Approximation for Separable Mixed-Integer Nonlinear Programs. INFORMS J. Comput. 26(1): 31-44 (2014) - [j21]Pierre Bonami, Alberto Olivares, Ernesto Staffetti:
Energy-Optimal Multi-Goal Motion Planning for Planar Robot Manipulators. J. Optim. Theory Appl. 163(1): 80-104 (2014) - [c6]Pierre Bonami, François Margot:
Cut Generation through Binarization. IPCO 2014: 174-185 - 2013
- [j20]Hassan L. Hijazi, Pierre Bonami, Adam Ouorou:
Robust delay-constrained routing in telecommunications. Ann. Oper. Res. 206(1): 163-181 (2013) - [j19]Pierre Bonami, Jon Lee, Sven Leyffer, Andreas Wächter:
On branching rules for convex mixed-integer nonlinear optimization. ACM J. Exp. Algorithmics 18 (2013) - [j18]Pierre Bonami, Michele Conforti, Gérard Cornuéjols, Marco Molinaro, Giacomo Zambelli:
Cutting planes from two-term disjunctions. Oper. Res. Lett. 41(5): 442-444 (2013) - 2012
- [j17]Pierre Bonami, João P. M. Gonçalves:
Heuristics for convex mixed integer nonlinear programs. Comput. Optim. Appl. 51(2): 729-747 (2012) - [j16]Hassan L. Hijazi, Pierre Bonami, Gérard Cornuéjols, Adam Ouorou:
Mixed-integer nonlinear programs featuring "on/off" constraints. Comput. Optim. Appl. 52(2): 537-558 (2012) - [j15]Pierre Bonami, Leo Liberti, Andrew J. Miller, Annick Sartenaer:
Preface. Math. Program. 136(2): 229-231 (2012) - [j14]Pierre Bonami:
On optimizing over lift-and-project closures. Math. Program. Comput. 4(2): 151-179 (2012) - [c5]Pierre Bonami, Viet Hung Nguyen, Michel Klein, Michel Minoux:
On the Solution of a Graph Partitioning Problem under Capacity Constraints. ISCO 2012: 285-296 - 2011
- [j13]Amitabh Basu, Pierre Bonami, Gérard Cornuéjols, François Margot:
Experiments with Two-Row Cuts from Degenerate Tableaux. INFORMS J. Comput. 23(4): 578-590 (2011) - [j12]Amitabh Basu, Pierre Bonami, Gérard Cornuéjols, François Margot:
On the relative strength of split, triangle and quadrilateral cuts. Math. Program. 126(2): 281-314 (2011) - [j11]Anureet Saxena, Pierre Bonami, Jon Lee:
Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations. Math. Program. 130(2): 359-413 (2011) - [c4]Pierre Bonami:
Lift-and-Project Cuts for Mixed Integer Convex Programs. IPCO 2011: 52-64 - 2010
- [j10]Hassan L. Hijazi, Pierre Bonami, Gérard Cornuéjols, Adam Ouorou:
Mixed Integer NonLinear Programs featuring "On/Off" constraints: convex analysis and applications. Electron. Notes Discret. Math. 36: 1153-1160 (2010) - [j9]Anureet Saxena, Pierre Bonami, Jon Lee:
Convex relaxations of non-convex mixed integer quadratically constrained programs: extended formulations. Math. Program. 124(1-2): 383-411 (2010) - [i1]Pierre Bonami:
On optimizing over lift-and-project closures. CoRR abs/1010.5412 (2010)
2000 – 2009
- 2009
- [j8]Pierre Bonami, Miguel A. Lejeune:
An Exact Solution Approach for Portfolio Optimization Problems Under Stochastic and Integer Constraints. Oper. Res. 57(3): 650-670 (2009) - [j7]Pierre Bonami, Gérard Cornuéjols, Andrea Lodi, François Margot:
A Feasibility Pump for mixed integer nonlinear programs. Math. Program. 119(2): 331-352 (2009) - [j6]Egon Balas, Pierre Bonami:
Generating lift-and-project cuts from the LP simplex tableau: open source implementation and testing of new variants. Math. Program. Comput. 1(2-3): 165-199 (2009) - [c3]Amitabh Basu, Pierre Bonami, Gérard Cornuéjols, François Margot:
On the relative strength of split, triangle and quadrilateral cuts. SODA 2009: 1220-1229 - 2008
- [j5]Pierre Bonami, Lorenz T. Biegler, Andrew R. Conn, Gérard Cornuéjols, Ignacio E. Grossmann, Carl D. Laird, Jon Lee, Andrea Lodi, François Margot, Nicolas W. Sawaya, Andreas Wächter:
An algorithmic framework for convex mixed integer nonlinear programs. Discret. Optim. 5(2): 186-204 (2008) - [j4]Pierre Bonami, Gérard Cornuéjols, Sanjeeb Dash, Matteo Fischetti, Andrea Lodi:
Projected Chvátal-Gomory cuts for mixed integer linear programs. Math. Program. 113(2): 241-257 (2008) - [j3]Pierre Bonami, Gérard Cornuéjols:
A note on the MIR closure. Oper. Res. Lett. 36(1): 4-6 (2008) - [c2]Anureet Saxena, Pierre Bonami, Jon Lee:
Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs. IPCO 2008: 17-33 - 2007
- [c1]Egon Balas, Pierre Bonami:
New Variants of Lift-and-Project Cut Generation from the LP Tableau: Open Source Implementation and Testing. IPCO 2007: 89-103 - 2006
- [j2]Pierre Bonami, Michel Minoux:
Exact MAX-2SAT solution via lift-and-project closure. Oper. Res. Lett. 34(4): 387-393 (2006) - 2005
- [j1]Pierre Bonami, Michel Minoux:
Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation. Discret. Optim. 2(4): 288-307 (2005)
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 2025-01-21 00:12 CET 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:
