☰

Francois Margot - Publications

Affiliations: 
University of Kentucky, Lexington, KY 
Area:
Mathematics
Tree Info Similar researchers PubMed Report error

37 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2020 Kazachkov AM, Nadarajah S, Balas E, Margot F. Partial hyperplane activation for generalized intersection cuts Mathematical Programming Computation. 12: 69-107. DOI: 10.1007/S12532-019-00166-2  0.339
2020 Schmidt D, Zey B, Margot F. Stronger MIP formulations for the Steiner forest problem Mathematical Programming. 1-35. DOI: 10.1007/S10107-019-01460-6  0.423
2016 Lejeune MA, Margot F. Solving Chance-Constrained Optimization Problems with Stochastic Quadratic Inequalities Operations Research. 64: 939-957. DOI: 10.1287/Opre.2016.1493  0.439
2015 Nadarajah S, Margot F, Secomandi N. Relaxations of approximate linear programs for the real option management of commodity storage Management Science. 61: 3054-3076. DOI: 10.1287/Mnsc.2014.2136  0.307
2014 Bonami P, Margot F. Cut generation through binarization Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8494: 174-185. DOI: 10.1007/S10107-015-0924-Z  0.45
2013 Gentilini I, Margot F, Shimada K. The travelling salesman problem with neighbourhoods: MINLP solution Optimization Methods and Software. 28: 364-378. DOI: 10.1080/10556788.2011.648932  0.406
2013 Cornuéjols G, Margot F, Nannicini G. On the safety of Gomory cut generators Mathematical Programming Computation. 5: 345-395. DOI: 10.1007/S12532-013-0057-4  0.35
2013 Balas E, Margot F. Generalized intersection cuts and a new cut generating paradigm Mathematical Programming. 137: 19-35. DOI: 10.1007/S10107-011-0483-X  0.339
2012 Basu A, Cornuéjols G, Margot F. Intersection cuts with infinite split rank Mathematics of Operations Research. 37: 21-40. DOI: 10.1287/Moor.1110.0522  0.326
2011 Basu A, Bonami P, Cornuéjols G, Margot F. Experiments with two-row cuts from degenerate tableaux Informs Journal On Computing. 23: 578-590. DOI: 10.1287/Ijoc.1100.0437  0.352
2010 Lai G, Margot F, Secomandi N. An approximate dynamic programming approach to benchmark practice-based heuristics for natural gas storage valuation Operations Research. 58: 564-582. DOI: 10.1287/Opre.1090.0768  0.309
2009 Secomandi N, Margot F. Reoptimization approaches for the vehicle-routing problem with stochastic demands Operations Research. 57: 214-230. DOI: 10.1287/Opre.1080.0520  0.373
2009 Linderoth J, Margot F, Thain G. Improving bounds on the football pool problem by integer programming and high-throughput computing Informs Journal On Computing. 21: 445-457. DOI: 10.1287/Ijoc.1090.0334  0.383
2009 Belotti P, Lee J, Liberti L, Margot F, Wächter A. Branching and bounds tighteningtechniques for non-convex MINLP Optimization Methods and Software. 24: 597-634. DOI: 10.1080/10556780903087124  0.362
2009 Margot F. Testing cut generators for mixed-integer linear programming Mathematical Programming Computation. 1: 69-95. DOI: 10.1007/S12532-009-0003-7  0.366
2009 Basu A, Bonami P, Cornuéjols G, Margot F. On the relative strength of split, triangle and quadrilateral cuts Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 1220-1229. DOI: 10.1007/S10107-009-0281-X  0.33
2009 Cornuéjols G, Margot F. On the facets of mixed integer programs with two integer variables and two constraints Mathematical Programming. 120: 429-456. DOI: 10.1007/S10107-008-0221-1  0.313
2009 Bonami P, Cornuéjols G, Lodi A, Margot F. A Feasibility Pump for mixed integer nonlinear programs Mathematical Programming. 119: 331-352. DOI: 10.1007/S10107-008-0212-2  0.331
2008 Lejeune MA, Margot F. Integer Programming Solution Approach for Inventory-Production-Distribution Problems with Direct Shipments International Transactions in Operational Research. 15: 259-281. DOI: 10.1111/J.1475-3995.2008.00621.X  0.355
2008 Bulutoglu DA, Margot F. Classification of orthogonal arrays by integer programming Journal of Statistical Planning and Inference. 138: 654-666. DOI: 10.1016/J.Jspi.2006.12.003  0.348
2008 Bonami P, Biegler LT, Conn AR, Cornuéjols G, Grossmann IE, Laird CD, Lee J, Lodi A, Margot F, Sawaya N, Wächter A. An algorithmic framework for convex mixed integer nonlinear programs Discrete Optimization. 5: 186-204. DOI: 10.1016/J.Disopt.2006.10.011  0.346
2007 Lee J, Margot F. On a binary-encoded ILP coloring formulation Informs Journal On Computing. 19: 406-415. DOI: 10.1287/Ijoc.1060.0178  0.331
2007 Margot F. Symmetric ILP: Coloring and small integers Discrete Optimization. 4: 40-62. DOI: 10.1016/J.Disopt.2006.10.008  0.39
2006 Bendall G, Margot F. Minimum number of below average triangles in a weighted complete graph Discrete Optimization. 3: 206-219. DOI: 10.1016/J.Disopt.2006.05.004  0.531
2006 Bendall G, Margot F. Greedy-type resistance of combinatorial problems Discrete Optimization. 3: 288-298. DOI: 10.1016/J.Disopt.2006.03.001  0.542
2004 Lee J, Leung J, Margot F. Min-up/min-down polytopes Discrete Optimization. 1: 77-85. DOI: 10.1016/J.Disopt.2003.12.001  0.351
2003 Margot F, Queyranne M, Wang Y. Decompositions, network flows, and a precedence constrained single-machine scheduling problem Operations Research. 51: 981-992. DOI: 10.1287/Opre.51.6.981.24912  0.41
2003 Margot F. Exploiting orbits in symmetric ILP Mathematical Programming. 98: 3-21. DOI: 10.1007/S10107-003-0394-6  0.364
2003 Punnen A, Margot F, Kabadi S. TSP heuristics: Domination analysis and complexity Algorithmica (New York). 35: 111-127. DOI: 10.1007/S00453-002-0986-1  0.425
2002 Margot F. Pruning by isomorphism in branch-and-cut Mathematical Programming, Series B. 94: 71-90. DOI: 10.1007/S10107-002-0358-2  0.417
2001 Balas E, Ceria S, Dawande M, Margot F, Pataki G. Octane: A new heuristic for pure 0-1 programs Operations Research. 49: 207-225. DOI: 10.1287/Opre.49.2.207.13535  0.337
1998 Cornuéjols G, Guenin B, Margot F. The packing property Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1412: 1-8. DOI: 10.1007/Pl00011389  0.409
1997 Fukuda K, Liebling TM, Margot F. Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedron Computational Geometry: Theory and Applications. 8: 1-12.  0.349
1995 Liebling TM, Margot F, Müller D, Prodon A, Stauffer L. Disjoint paths in the plane Informs Journal On Computing. 7: 84-88. DOI: 10.1287/Ijoc.7.1.84  0.366
1995 Hartvigsen D, Margot F. Multiterminal flows and cuts Operations Research Letters. 17: 201-204. DOI: 10.1016/0167-6377(95)00018-F  0.379
1995 Margot F, Prodon A, Liebling TM. Optimal node disjoint paths on partial 2-trees: A linear algorithm and polyhedral results Zor Zeitschrift FüR Operations Research Mathematical Methods of Operations Research. 41: 325-346. DOI: 10.1007/Bf01432363  0.381
1994 Margot F. Some complexity results about threshold graphs Discrete Applied Mathematics. 49: 299-308. DOI: 10.1016/0166-218X(94)90214-3  0.346
Show low-probability matches.