François Margot

According to our database, François Margot authored at least 52 papers between 1992 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2021

Correction to: Stronger MIP formulations for the Steiner forest problem.

Daniel R. Schmidt, Bernd Zey, François Margot

Math. Program., 2021

Stronger MIP formulations for the Steiner forest problem.

Daniel R. Schmidt, Bernd Zey, François Margot

Math. Program., 2021

2020

Partial hyperplane activation for generalized intersection cuts.

Aleksandr M. Kazachkov, Selvaprabu Nadarajah, Egon Balas, François Margot

Math. Program. Comput., 2020

2018

Aeromedical Battlefield Evacuation Under Endogenous Uncertainty in Casualty Delivery Times.

Miguel A. Lejeune, François Margot

Manag. Sci., 2018

An Exact Algorithm for the Steiner Forest Problem.

Daniel R. Schmidt, Bernd Zey, François Margot

Proceedings of the 26th Annual European Symposium on Algorithms, 2018

2017

Comparison of least squares Monte Carlo methods with applications to energy real options.

Selvaprabu Nadarajah, François Margot, Nicola Secomandi

Eur. J. Oper. Res., 2017

MIP Formulations for the Steiner Forest Problem.

Daniel R. Schmidt, Bernd Zey, François Margot

CoRR, 2017

2016

Solving Chance-Constrained Optimization Problems with Stochastic Quadratic Inequalities.

Miguel A. Lejeune, François Margot

Oper. Res., 2016

2015

Merchant Commodity Storage and Term-Structure Model Error.

Nicola Secomandi, Guoming Lai, François Margot, Alan Scheller-Wolf, Duane J. Seppi

Manuf. Serv. Oper. Manag., 2015

Cut generation through binarization.

Pierre Bonami, François Margot

Math. Program., 2015

Relaxations of Approximate Linear Programs for the Real Option Management of Commodity Storage.

Selvaprabu Nadarajah, François Margot, Nicola Secomandi

Manag. Sci., 2015

2013

The travelling salesman problem with neighbourhoods: MINLP solution.

Iacopo Gentilini, François Margot, Kenji Shimada

Optim. Methods Softw., 2013

On the safety of Gomory cut generators.

Gérard Cornuéjols, François Margot, Giacomo Nannicini

Math. Program. Comput., 2013

Generalized intersection cuts and a new cut generating paradigm.

Egon Balas, François Margot

Math. Program., 2013

2012

Intersection Cuts with Infinite Split Rank.

Amitabh Basu, Gérard Cornuéjols, François Margot

Math. Oper. Res., 2012

Linear Programming Relaxations of Quadratically Constrained Quadratic Programs

Andrea Qualizza, Pietro Belotti, François Margot

CoRR, 2012

2011

On the relative strength of split, triangle and quadrilateral cuts.

Amitabh Basu, Pierre Bonami, Gérard Cornuéjols, François Margot

Math. Program., 2011

Experiments with Two-Row Cuts from Degenerate Tableaux.

Amitabh Basu, Pierre Bonami, Gérard Cornuéjols, François Margot

INFORMS J. Comput., 2011

Optimization for simulation: LAD accelerator.

Miguel A. Lejeune, François Margot

Ann. Oper. Res., 2011

A Probing Algorithm for MINLP with Failure Prediction by SVM.

Giacomo Nannicini, Pietro Belotti, Jon Lee, Jeff T. Linderoth, François Margot, Andreas Wächter

Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2011

2010

An Approximate Dynamic Programming Approach to Benchmark Practice-Based Heuristics for Natural Gas Storage Valuation.

Guoming Lai, François Margot, Nicola Secomandi

Oper. Res., 2010

Symmetry in Integer Linear Programming.

François Margot

Proceedings of the 50 Years of Integer Programming 1958-2008, 2010

2009

Branching and bounds tighteningtechniques for non-convex MINLP.

Pietro Belotti, Jon Lee, Leo Liberti, François Margot, Andreas Wächter

Optim. Methods Softw., 2009

Testing cut generators for mixed-integer linear programming.

François Margot

Math. Program. Comput., 2009

On the facets of mixed integer programs with two integer variables and two constraints.

Gérard Cornuéjols, François Margot

Math. Program., 2009

A Feasibility Pump for mixed integer nonlinear programs.

Pierre Bonami, Gérard Cornuéjols, Andrea Lodi, François Margot

Math. Program., 2009

Reoptimization Approaches for the Vehicle-Routing Problem with Stochastic Demands.

Nicola Secomandi, François Margot

Oper. Res., 2009

Improving Bounds on the Football Pool Problem by Integer Programming and High-Throughput Computing.

Jeff T. Linderoth, François Margot, Greg Thain

INFORMS J. Comput., 2009

2008

Integer programming solution approach for inventory-production-distribution problems with direct shipments.

Miguel A. Lejeune, François Margot

Int. Trans. Oper. Res., 2008

An algorithmic framework for convex mixed integer nonlinear programs.

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

Discret. Optim., 2008

2007

On a Binary-Encoded ILP Coloring Formulation.

Jon Lee, François Margot

INFORMS J. Comput., 2007

Symmetric ILP: Coloring and small integers.

François Margot

Discret. Optim., 2007

2006

Greedy-type resistance of combinatorial problems.

Gareth Bendall, François Margot

Discret. Optim., 2006

Minimum number of below average triangles in a weighted complete graph.

Gareth Bendall, François Margot

Discret. Optim., 2006

2004

Min-up/min-down polytopes.

Jon Lee, Janny Leung, François Margot

Discret. Optim., 2004

More on a Binary-Encoded Coloring Formulation.

Jon Lee, François Margot

Proceedings of the Integer Programming and Combinatorial Optimization, 2004

2003

Small covering designs by branch-and-cut.

François Margot

Math. Program., 2003

Exploiting orbits in symmetric ILP.

François Margot

Math. Program., 2003

Decompositions, Network Flows, and a Precedence Constrained Single-Machine Scheduling Problem.

François Margot, Maurice Queyranne, Yaoguang Wang

Oper. Res., 2003

TSP Heuristics: Domination Analysis and Complexity.

Abraham P. Punnen, François Margot, Santosh N. Kabadi

Algorithmica, 2003

2002

Pruning by isomorphism in branch-and-cut.

François Margot

Math. Program., 2002

2001

Octane: A New Heuristic for Pure 0-1 Programs.

Egon Balas, Sebastián Ceria, Milind Dawande, François Margot, Gábor Pataki

Oper. Res., 2001

2000

The packing property.

Gérard Cornuéjols, Bertrand Guenin, François Margot

Math. Program., 2000

1998

Weak k-majorization and polyhedra.

Geir Dahl, François Margot

Math. Program., 1998

A catalog of minimally nonideal matrices.

Christine Lütolf, François Margot

Math. Methods Oper. Res., 1998

1997

Analysis of Backtrack Algorithms for Listing All Vertices and All Faces of a Convex Polyhedron.

Komei Fukuda, Thomas M. Liebling, François Margot

Comput. Geom., 1997

1995

Multiterminal flows and cuts.

David Hartvigsen, François Margot

Oper. Res. Lett., 1995

Optimal node disjoint paths on partial 2-trees: A linear algorithm and polyhedral results.

François Margot, Alain Prodon, Thomas M. Liebling

Math. Methods Oper. Res., 1995

Disjoint Paths in the Plane.

Thomas M. Liebling, François Margot, Didier Müller, Alain Prodon, Lynn Stauffer

INFORMS J. Comput., 1995

1994

Tree polytope on 2-trees.

François Margot, Alain Prodon, Thomas M. Liebling

Math. Program., 1994

Some Complexity Results about Threshold Graphs.

François Margot

Discret. Appl. Math., 1994

1992

Quick updates for p-opt TSP heuristics.

François Margot

Oper. Res. Lett., 1992