default search action
François Margot
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j46]Daniel R. Schmidt
, Bernd Zey
Stronger MIP formulations for the Steiner forest problem. Math. Program. 186(1): 373-407 (2021) - [j45]Daniel R. Schmidt
Correction to: Stronger MIP formulations for the Steiner forest problem. Math. Program. 188(1): 409-410 (2021) - 2020
- [j44]Aleksandr M. Kazachkov
Partial hyperplane activation for generalized intersection cuts. Math. Program. Comput. 12(1): 69-107 (2020)
2010 – 2019
- 2018
- [j43]Miguel A. Lejeune
Aeromedical Battlefield Evacuation Under Endogenous Uncertainty in Casualty Delivery Times. Manag. Sci. 64(12): 5481-5496 (2018) - [c8]Daniel R. Schmidt, Bernd Zey
An Exact Algorithm for the Steiner Forest Problem. ESA 2018: 70:1-70:14 - 2017
- [j42]Selvaprabu Nadarajah, François Margot, Nicola Secomandi:
Comparison of least squares Monte Carlo methods with applications to energy real options. Eur. J. Oper. Res. 256(1): 196-204 (2017) - [i2]Daniel R. Schmidt, Bernd Zey, François Margot:
MIP Formulations for the Steiner Forest Problem. CoRR abs/1709.01124 (2017) - 2016
- [j41]Miguel A. Lejeune
Solving Chance-Constrained Optimization Problems with Stochastic Quadratic Inequalities. Oper. Res. 64(4): 939-957 (2016) - 2015
- [j40]Selvaprabu Nadarajah, François Margot, Nicola Secomandi:
Relaxations of Approximate Linear Programs for the Real Option Management of Commodity Storage. Manag. Sci. 61(12): 3054-3076 (2015) - [j39]Pierre Bonami, François Margot:
Cut generation through binarization. Math. Program. 154(1-2): 197-223 (2015) - [j38]Nicola Secomandi, Guoming Lai, François Margot, Alan Scheller-Wolf, Duane J. Seppi:
Merchant Commodity Storage and Term-Structure Model Error. Manuf. Serv. Oper. Manag. 17(3): 302-320 (2015) - 2014
- [c7]Pierre Bonami, François Margot:
Cut Generation through Binarization. IPCO 2014: 174-185 - 2013
- [j37]Egon Balas, François Margot:
Generalized intersection cuts and a new cut generating paradigm. Math. Program. 137(1-2): 19-35 (2013) - [j36]Gérard Cornuéjols, François Margot, Giacomo Nannicini:
On the safety of Gomory cut generators. Math. Program. Comput. 5(4): 345-395 (2013) - [j35]Iacopo Gentilini, François Margot, Kenji Shimada:
The travelling salesman problem with neighbourhoods: MINLP solution. Optim. Methods Softw. 28(2): 364-378 (2013) - 2012
- [j34]Amitabh Basu
Intersection Cuts with Infinite Split Rank. Math. Oper. Res. 37(1): 21-40 (2012) - [i1]Andrea Qualizza, Pietro Belotti, François Margot:
Linear Programming Relaxations of Quadratically Constrained Quadratic Programs. CoRR abs/1206.1633 (2012) - 2011
- [j33]Miguel A. Lejeune
Optimization for simulation: LAD accelerator. Ann. Oper. Res. 188(1): 285-305 (2011) - [j32]Amitabh Basu
Experiments with Two-Row Cuts from Degenerate Tableaux. INFORMS J. Comput. 23(4): 578-590 (2011) - [j31]Amitabh Basu
On the relative strength of split, triangle and quadrilateral cuts. Math. Program. 126(2): 281-314 (2011) - [c6]Giacomo Nannicini, Pietro Belotti
A Probing Algorithm for MINLP with Failure Prediction by SVM. CPAIOR 2011: 154-169 - 2010
- [j30]Guoming Lai, François Margot, Nicola Secomandi:
An Approximate Dynamic Programming Approach to Benchmark Practice-Based Heuristics for Natural Gas Storage Valuation. Oper. Res. 58(3): 564-582 (2010) - [p1]François Margot:
Symmetry in Integer Linear Programming. 50 Years of Integer Programming 2010: 647-686
2000 – 2009
- 2009
- [j29]Jeff T. Linderoth, François Margot, Greg Thain:
Improving Bounds on the Football Pool Problem by Integer Programming and High-Throughput Computing. INFORMS J. Comput. 21(3): 445-457 (2009) - [j28]Nicola Secomandi, François Margot:
Reoptimization Approaches for the Vehicle-Routing Problem with Stochastic Demands. Oper. Res. 57(1): 214-230 (2009) - [j27]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) - [j26]Gérard Cornuéjols, François Margot:
On the facets of mixed integer programs with two integer variables and two constraints. Math. Program. 120(2): 429-456 (2009) - [j25]François Margot:
Testing cut generators for mixed-integer linear programming. Math. Program. Comput. 1(1): 69-95 (2009) - [j24]Pietro Belotti
Branching and bounds tighteningtechniques for non-convex MINLP. Optim. Methods Softw. 24(4-5): 597-634 (2009) - [c5]Amitabh Basu
On the relative strength of split, triangle and quadrilateral cuts. SODA 2009: 1220-1229 - 2008
- [j23]Pierre Bonami, Lorenz T. Biegler
An algorithmic framework for convex mixed integer nonlinear programs. Discret. Optim. 5(2): 186-204 (2008) - [j22]Miguel A. Lejeune, François Margot:
Integer programming solution approach for inventory-production-distribution problems with direct shipments. Int. Trans. Oper. Res. 15(3): 259-281 (2008) - [c4]Gérard Cornuéjols, François Margot:
On the Facets of Mixed Integer Programs with Two Integer Variables and Two Constraints. LATIN 2008: 317-328 - 2007
- [j21]François Margot:
Symmetric ILP: Coloring and small integers. Discret. Optim. 4(1): 40-62 (2007) - [j20]Jon Lee, François Margot:
On a Binary-Encoded ILP Coloring Formulation. INFORMS J. Comput. 19(3): 406-415 (2007) - 2006
- [j19]Gareth Bendall, François Margot:
Minimum number of below average triangles in a weighted complete graph. Discret. Optim. 3(3): 206-219 (2006) - [j18]Gareth Bendall, François Margot:
Greedy-type resistance of combinatorial problems. Discret. Optim. 3(4): 288-298 (2006) - 2004
- [j17]Jon Lee
Min-up/min-down polytopes. Discret. Optim. 1(1): 77-85 (2004) - [c3]Jon Lee, François Margot:
More on a Binary-Encoded Coloring Formulation. IPCO 2004: 271-282 - 2003
- [j16]Abraham P. Punnen, François Margot, Santosh N. Kabadi:
TSP Heuristics: Domination Analysis and Complexity. Algorithmica 35(2): 111-127 (2003) - [j15]François Margot, Maurice Queyranne, Yaoguang Wang:
Decompositions, Network Flows, and a Precedence Constrained Single-Machine Scheduling Problem. Oper. Res. 51(6): 981-992 (2003) - [j14]François Margot:
Small covering designs by branch-and-cut. Math. Program. 94(2-3): 207-220 (2003) - [j13]François Margot:
Exploiting orbits in symmetric ILP. Math. Program. 98(1-3): 3-21 (2003) - 2002
- [j12]François Margot:
Pruning by isomorphism in branch-and-cut. Math. Program. 94(1): 71-90 (2002) - 2001
- [j11]Egon Balas, Sebastián Ceria, Milind Dawande
Octane: A New Heuristic for Pure 0-1 Programs. Oper. Res. 49(2): 207-225 (2001) - [c2]François Margot:
Pruning by Isomorphism in Branch-and-Cut. IPCO 2001: 304-317 - 2000
- [j10]Gérard Cornuéjols, Bertrand Guenin, François Margot:
The packing property. Math. Program. 89(1): 113-126 (2000)
1990 – 1999
- 1998
- [j9]Christine Lütolf, François Margot:
A catalog of minimally nonideal matrices. Math. Methods Oper. Res. 47(2): 221-241 (1998) - [j8]Geir Dahl
Weak k-majorization and polyhedra. Math. Program. 81: 37-53 (1998) - [c1]Gérard Cornuéjols, Bertrand Guenin, François Margot:
The Packing Property. IPCO 1998: 1-8 - 1997
- [j7]Komei Fukuda, Thomas M. Liebling, François Margot:
Analysis of Backtrack Algorithms for Listing All Vertices and All Faces of a Convex Polyhedron. Comput. Geom. 8: 1-12 (1997) - 1995
- [j6]Thomas M. Liebling, François Margot, Didier Müller, Alain Prodon, Lynn Stauffer:
Disjoint Paths in the Plane. INFORMS J. Comput. 7(1): 84-88 (1995) - [j5]François Margot, Alain Prodon, Thomas M. Liebling:
Optimal node disjoint paths on partial 2-trees: A linear algorithm and polyhedral results. Math. Methods Oper. Res. 41(3): 325-346 (1995) - [j4]David Hartvigsen, François Margot:
Multiterminal flows and cuts. Oper. Res. Lett. 17(5): 201-204 (1995) - 1994
- [j3]François Margot:
Some Complexity Results about Threshold Graphs. Discret. Appl. Math. 49(1-3): 299-308 (1994) - [j2]François Margot, Alain Prodon, Thomas M. Liebling:
Tree polytope on 2-trees. Math. Program. 63: 183-191 (1994) - 1992
- [j1]François Margot:
Quick updates for p-opt TSP heuristics. Oper. Res. Lett. 11(1): 45-46 (1992)
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-08 21:02 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: