 | 2009 |
| 20 |  | 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 |
| 19 |  | Jeff Linderoth,
François Margot,
Greg Thain:
Improving Bounds on the Football Pool Problem by Integer Programming and High-Throughput Computing.
INFORMS Journal on Computing 21(3): 445-457 (2009) |
| 18 |  | Nicola Secomandi,
François Margot:
Reoptimization Approaches for the Vehicle-Routing Problem with Stochastic Demands.
Operations Research 57(1): 214-230 (2009) |
| 2008 |
| 17 |  | 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 |
| 16 |  | 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.
Discrete Optimization 5(2): 186-204 (2008) |
| 2007 |
| 15 |  | François Margot:
Symmetric ILP: Coloring and small integers.
Discrete Optimization 4(1): 40-62 (2007) |
| 14 |  | Jon Lee,
François Margot:
On a Binary-Encoded ILP Coloring Formulation.
INFORMS Journal on Computing 19(3): 406-415 (2007) |
| 2006 |
| 13 |  | Gareth Bendall,
François Margot:
Minimum number of below average triangles in a weighted complete graph.
Discrete Optimization 3(3): 206-219 (2006) |
| 12 |  | Gareth Bendall,
François Margot:
Greedy-type resistance of combinatorial problems.
Discrete Optimization 3(4): 288-298 (2006) |
| 2004 |
| 11 |  | Jon Lee,
François Margot:
More on a Binary-Encoded Coloring Formulation.
IPCO 2004: 271-282 |
| 10 |  | Jon Lee,
Janny Leung,
François Margot:
Min-up/min-down polytopes.
Discrete Optimization 1(1): 77-85 (2004) |
| 2003 |
| 9 |  | Abraham P. Punnen,
François Margot,
Santosh N. Kabadi:
TSP Heuristics: Domination Analysis and Complexity.
Algorithmica 35(2): 111-127 (2003) |
| 8 |  | François Margot,
Maurice Queyranne,
Yaoguang Wang:
Decompositions, Network Flows, and a Precedence Constrained Single-Machine Scheduling Problem.
Operations Research 51(6): 981-992 (2003) |
| 2001 |
| 7 |  | François Margot:
Pruning by Isomorphism in Branch-and-Cut.
IPCO 2001: 304-317 |
| 1998 |
| 6 |  | Gérard Cornuéjols,
Bertrand Guenin,
François Margot:
The Packing Property.
IPCO 1998: 1-8 |
| 5 |  | Geir Dahl,
François Margot:
Weak k-majorization and polyhedra.
Math. Program. 81: 37-53 (1998) |
| 1997 |
| 4 |  | 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 |
| 3 |  | Thomas M. Liebling,
François Margot,
D. Müller,
A. Prodon,
L. Stauffer:
Disjoint Paths in the Plane.
INFORMS Journal on Computing 7(1): 84-88 (1995) |
| 1994 |
| 2 |  | François Margot:
Some Complexity Results about Threshold Graphs.
Discrete Applied Mathematics 49(1-3): 299-308 (1994) |
| 1 |  | François Margot,
A. Prodon,
Thomas M. Liebling:
Tree polytope on 2-trees.
Math. Program. 63: 183-191 (1994) |