Recent Publications/Preprints

J. Linderoth, F. Margot, G. Thain, "Improving Bounds on the Football Pool Problem via Symmetry Reduction and High-Throughput Computing" (2007).
football.pdf
F. Margot, "Testing Cut Generators for Mixed-Integer Linear Programming",
Tepper Working Paper 2007 E-43 (2007)
cuttest.pdf
G. Cornuejols, F. Margot, "On the Facets of Mixed Integer Programs with Two Integer Variables and Two Constraints",
Tepper Working Paper 2007 E-35 (2007)
To appear in Mathematical Programming
Abstract: FacetR2_abst.pdf
Full text available on the Tepper Working Papers web site
M. Lejeune, F. Margot, "Optimization for Simulation: LAD Accelerator"
Tepper Working Paper 2007 E-19 (2007)
lad.pdf
P. Bonami, L. Biegler, et al., "An Algorithmic Framework for Convex Mixed Integer Nonlinear Programs",
IBM Research Report RC23771 (W0511-023) (2005). To appear in Discrete Optimization.
Abstract: oabb_abst.pdf
N. Secomandi, F. Margot, "Reoptimization Approaches for the Vehicle Routing Problem with Stochastic Demands" (2007).
Tepper Working Paper 2007 E-11 (2007).
To appear in Operations Research.
Abstract: vrps_abst.pdf
Full text available on the Tepper Working Papers web site
D.A. Bulutoglu, F. Margot, "Classification of Orthogonal Arrays by Integer Programming",
Journal of Statistical Planning and Inference 138 (2008), 654-666.
Abstract: oa_abst.pdf
Full text available on the Tepper Working Papers web site
J. Linderoth, F. Margot, G. Thain, "The Tera-Gridiron: A Natural Turf for High-Throughput Computing" (2007).
tg-football.pdf
F. Margot, "BAC : A BCP based Branch-and-Cut Example",
IBM Research Report RC22799 (W0305-064) (2003), revised (2008).
bac.pdf
Original version: bac_v1.ps (May 2003)
M. Lejeune, F. Margot, "Integer Programming Solution Approach for Inventory-Production-Distribution Problems with Direct Shipments",
Tepper Working Paper 2007-E1 (2007).
International Transactions in Operational Research 15 (2008), 259-281.
Abstract: bici_abst.pdf
Full text available on the Tepper Working Papers web site
F. Margot, "Symmetric ILP: Coloring and Small Integers",
Discrete Optimization 4 (2007), 40-62.
Abstract: grpint4_abst.pdf
Full text available on the Tepper Working Papers web site
P. Bonami, G. Cornuejols, A. Lodi, F. Margot, "A Feasibility Pump for Mixed Integer Nonlinear Programs",
IBM Research Report RC23862 (W0602-029) (2006).
Abstract: oafp_abst.pdf
To appear in Mathematical Programming.
J. Lee, F. Margot, "On a Binary-Encoded ILP Coloring Formulation".
INFORMS Journal on Computing 19 (2007), 406-415.
Abstract: adif_full_abst.pdf
Published version available at INFORMS PubsOnLine.
G. Bendall, F. Margot, "Greedy Type Resistance of Combinatorial Problems".
Discrete Optimization 3 (2006), 288-298.
Abstract: galg_abst.pdf
G. Bendall, F. Margot, " Minimum Number of Below Average Triangles in a Weighted Complete Graph".
Discrete Optimization 3 (2006), 206-219.
Abstract: clique_abst.pdf
J. Lee, F. Margot, "More on a Binary-Encoded Edge Coloring Formulation", extended abstract.
Proceedings of the 10th IPCO Conference , D. Bienstock, G. Nemhauser, Eds.,
LNCS 3064, Springer (2004), 271--282.
Abstract: adif_abst.ps
J. Lee, J. Leung, F. Margot, "Min-up Min-down Polytopes",
Discrete Optimization 1 (2004), 77--85.
Abstract: updown_abst.ps
F. Margot, M. Queyranne, Y.Wang, "Decomposition, Network Flows and a Precedence Constrained Single Machine Scheduling Problem",
Operations Research 51 (2003), 981-992.
Abstract: sched_abst.ps
Published version available at INFORMS PubsOnLine.
A. Punnen, F. Margot, S. Kabadi, "TSP Heuristics: Domination Analysis and Complexity",
Algorithmica 35 (2003), 111-127. Abstract: dom_abst.ps
Published version available at Springer's Link Search Site.
F. Margot, "Exploiting Orbits in Symmetric ILP",
Mathematical Programming Ser. B 98 (2003), 3--21.
exporb_abst.ps
LP files of the test problems
Published version available at Springer's Link Search Site.
F. Margot, "Pruning by Isomorphism in Branch-and-Cut",
Mathematical Programming 94 (2002), 71-90.
prunisom_abst.ps
LP files of the test problems
Published version available at Springer's Link Search Site.
Note: The algorithm orb_in_stab() (p. 82) has a typo: In the last line,
"perm[j]" should be "loc_perm[j]", as pointed out by S. Raaphorst.
F. Margot, "A correction to "The number of non-isomorphic solutions to a problem in covering designs"".
covisom.ps
F. Margot, "Pruning by Isomorphism in Branch-and-Cut", (extended abstract)
Proceedings of the 8th International IPCO Conference , LNCS 2081, Springer (2001), 304-317.
Abstract: pruning_abst.ps
Published version available at Springer's Link Search Site.
F. Margot, "Small Covering Designs by Branch-and-Cut",
Mathematical Programming (Ser. B) 94 (2003), 207-220.
smcov_abst.ps
Published version available at Springer's Link Search Site.
E. Balas, S. Ceria, M. Dawande, F. Margot, G. Pataki, "OCTANE: A New Heuristic for Pure 0-1 Programs"
Operations Research 49 (2001), 207-235.
Abstract: octane_abst.ps
Published version available at INFORMS PubsOnLine.
G. Cornuejols, B. Guenin, F. Margot, ``The Packing Property'',
Mathematical Programming 89 (2000), 113-126.
Abstract: mnpa_abst.ps
Published version available at Springer's Link Search Site.
C. Luetolf, F. Margot, ``A Catalog of Minimally Nonideal Matrices'',
Mathematics of Operations Research 47 (1998), 221-241.
Abstract: mni_abst.ps.
A text file containing the matrices mentioned in the paper is available here.
G. Dahl, F. Margot, ``Weak k-majorization and Polyhedra'',
Mathematical Programming 81 (1998), 37-53.
Abstract: weakk_abst.ps
Published version available at Springer's Link Search Site.
K. Fukuda, Th. M. Liebling, F. Margot, ``Analysis of Backtrack Algorithms for Listing All Vertices and All Faces of a Convex Polyhedron'',
Computational Geometry 8 (1997), 1-12.
Abstract: vertface_abst.ps

Back to main page