François Margot

Publication Activity (10 Years)

Years Active: 1992-2021
Publications (10 Years): 8

Top Topics

Mixed Integer Programming

Quadratically Constrained Quadratic

Monte Carlo Methods

Top Venues

Math. Program. Comput.

Publications

Daniel R. Schmidt, Bernd Zey, François Margot
Correction to: Stronger MIP formulations for the Steiner forest problem. Math. Program. 188 (1) (2021)
Daniel R. Schmidt, Bernd Zey, François Margot
Stronger MIP formulations for the Steiner forest problem. Math. Program. 186 (1) (2021)
Aleksandr M. Kazachkov, Selvaprabu Nadarajah, Egon Balas, François Margot
Partial hyperplane activation for generalized intersection cuts. Math. Program. Comput. 12 (1) (2020)
Daniel R. Schmidt, Bernd Zey, François Margot
An Exact Algorithm for the Steiner Forest Problem. ESA (2018)
Miguel A. Lejeune, François Margot
Aeromedical Battlefield Evacuation Under Endogenous Uncertainty in Casualty Delivery Times. Manag. Sci. 64 (12) (2018)
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) (2017)
Daniel R. Schmidt, Bernd Zey, François Margot
MIP Formulations for the Steiner Forest Problem. CoRR (2017)
Miguel A. Lejeune, François Margot
Solving Chance-Constrained Optimization Problems with Stochastic Quadratic Inequalities. Oper. Res. 64 (4) (2016)
Pierre Bonami, François Margot
Cut generation through binarization. Math. Program. 154 (1-2) (2015)
Selvaprabu Nadarajah, François Margot, Nicola Secomandi
Relaxations of Approximate Linear Programs for the Real Option Management of Commodity Storage. Manag. Sci. 61 (12) (2015)
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) (2015)
Pierre Bonami, François Margot
Cut Generation through Binarization. IPCO (2014)
Gérard Cornuéjols, François Margot, Giacomo Nannicini
On the safety of Gomory cut generators. Math. Program. Comput. 5 (4) (2013)
Egon Balas, François Margot
Generalized intersection cuts and a new cut generating paradigm. Math. Program. 137 (1-2) (2013)
Iacopo Gentilini, François Margot, Kenji Shimada
The travelling salesman problem with neighbourhoods: MINLP solution. Optim. Methods Softw. 28 (2) (2013)
Andrea Qualizza, Pietro Belotti, François Margot
Linear Programming Relaxations of Quadratically Constrained Quadratic Programs CoRR (2012)
Amitabh Basu, Gérard Cornuéjols, François Margot
Intersection Cuts with Infinite Split Rank. Math. Oper. Res. 37 (1) (2012)
Miguel A. Lejeune, François Margot
Optimization for simulation: LAD accelerator. Ann. Oper. Res. 188 (1) (2011)
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) (2011)
Amitabh Basu, Pierre Bonami, Gérard Cornuéjols, François Margot
Experiments with Two-Row Cuts from Degenerate Tableaux. INFORMS J. Comput. 23 (4) (2011)
Giacomo Nannicini, Pietro Belotti, Jon Lee, Jeff T. Linderoth, François Margot, Andreas Wächter
A Probing Algorithm for MINLP with Failure Prediction by SVM. CPAIOR (2011)
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) (2010)
Pietro Belotti, Jon Lee, Leo Liberti, François Margot, Andreas Wächter
Branching and bounds tighteningtechniques for non-convex MINLP. Optim. Methods Softw. 24 (4-5) (2009)
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) (2009)
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) (2009)
Pierre Bonami, Gérard Cornuéjols, Andrea Lodi, François Margot
A Feasibility Pump for mixed integer nonlinear programs. Math. Program. 119 (2) (2009)
François Margot
Testing cut generators for mixed-integer linear programming. Math. Program. Comput. 1 (1) (2009)
Amitabh Basu, Pierre Bonami, Gérard Cornuéjols, François Margot
On the relative strength of split, triangle and quadrilateral cuts. SODA (2009)
Nicola Secomandi, François Margot
Reoptimization Approaches for the Vehicle-Routing Problem with Stochastic Demands. Oper. Res. 57 (1) (2009)
Miguel A. Lejeune, François Margot
Integer programming solution approach for inventory-production-distribution problems with direct shipments. Int. Trans. Oper. Res. 15 (3) (2008)
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) (2008)
Gérard Cornuéjols, François Margot
On the Facets of Mixed Integer Programs with Two Integer Variables and Two Constraints. LATIN (2008)
Jon Lee, François Margot
On a Binary-Encoded ILP Coloring Formulation. INFORMS J. Comput. 19 (3) (2007)
François Margot
Symmetric ILP: Coloring and small integers. Discret. Optim. 4 (1) (2007)
Gareth Bendall, François Margot
Minimum number of below average triangles in a weighted complete graph. Discret. Optim. 3 (3) (2006)
Gareth Bendall, François Margot
Greedy-type resistance of combinatorial problems. Discret. Optim. 3 (4) (2006)
Jon Lee, Janny Leung, François Margot
Min-up/min-down polytopes. Discret. Optim. 1 (1) (2004)
Jon Lee, François Margot
More on a Binary-Encoded Coloring Formulation. IPCO (2004)
François Margot
Small covering designs by branch-and-cut. Math. Program. 94 (2-3) (2003)
François Margot, Maurice Queyranne, Yaoguang Wang
Decompositions, Network Flows, and a Precedence Constrained Single-Machine Scheduling Problem. Oper. Res. 51 (6) (2003)
François Margot
Exploiting orbits in symmetric ILP. Math. Program. 98 (1-3) (2003)
Abraham P. Punnen, François Margot, Santosh N. Kabadi
TSP Heuristics: Domination Analysis and Complexity. Algorithmica 35 (2) (2003)
François Margot
Pruning by isomorphism in branch-and-cut. Math. Program. 94 (1) (2002)
François Margot
Pruning by Isomorphism in Branch-and-Cut. IPCO (2001)
Egon Balas, Sebastián Ceria, Milind Dawande, François Margot, Gábor Pataki
Octane: A New Heuristic for Pure 0-1 Programs. Oper. Res. 49 (2) (2001)
Gérard Cornuéjols, Bertrand Guenin, François Margot
The packing property. Math. Program. 89 (1) (2000)
Gérard Cornuéjols, Bertrand Guenin, François Margot
The Packing Property. IPCO (1998)
Christine Lütolf, François Margot
A catalog of minimally nonideal matrices. Math. Methods Oper. Res. 47 (2) (1998)
Geir Dahl, François Margot
Weak k-majorization and polyhedra. Math. Program. 81 (1998)
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 (1997)
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) (1995)
David Hartvigsen, François Margot
Multiterminal flows and cuts. Oper. Res. Lett. 17 (5) (1995)
Thomas M. Liebling, François Margot, Didier Müller, Alain Prodon, Lynn Stauffer
Disjoint Paths in the Plane. INFORMS J. Comput. 7 (1) (1995)
François Margot, Alain Prodon, Thomas M. Liebling
Tree polytope on 2-trees. Math. Program. 63 (1994)
François Margot
Some Complexity Results about Threshold Graphs. Discret. Appl. Math. 49 (1-3) (1994)
François Margot
Quick updates for p-opt TSP heuristics. Oper. Res. Lett. 11 (1) (1992)