The strength of multi-row models
暂无分享,去创建一个
Domenico Salvagnin | Laurent Poirrier | Quentin Louveaux | Domenico Salvagnin | Q. Louveaux | Laurent Poirrier
[1] S. Janson,et al. Wiley‐Interscience Series in Discrete Mathematics and Optimization , 2011 .
[2] Laurence A. Wolsey,et al. Two row mixed-integer cuts via lifting , 2010, Math. Program..
[3] Gérard Cornuéjols,et al. A Probabilistic Analysis of the Strength of the Split and Triangle Closures , 2011, IPCO.
[4] Alper Atamtürk,et al. Sequence Independent Lifting for Mixed-Integer Programming , 2004, Oper. Res..
[5] Sanjeeb Dash,et al. Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra , 2012, Math. Program..
[6] Gérard Cornuéjols,et al. A Geometric Perspective on Lifting , 2011, Oper. Res..
[7] Egon Balas,et al. Lift-and-project for Mixed 0-1 programming: recent progress , 2002, Discret. Appl. Math..
[8] Martin W. P. Savelsbergh,et al. An Updated Mixed Integer Programming Library: MIPLIB 3.0 , 1998 .
[9] Matteo Fischetti,et al. A relax-and-cut framework for Gomory mixed-integer cuts , 2011, Math. Program. Comput..
[10] Laurence A. Wolsey,et al. Experiments with Two Row Tableau Cuts , 2010, IPCO.
[11] Ricardo Fukasawa,et al. On the exact separation of mixed integer knapsack cuts , 2007, Math. Program..
[12] Matteo Fischetti,et al. A Relax-and-Cut Framework for Gomory's Mixed-Integer Cuts , 2010, CPAIOR.
[13] R. Gomory. Some polyhedra related to combinatorial problems , 1969 .
[14] Ellis L. Johnson,et al. Some continuous functions related to corner polyhedra , 1972, Math. Program..
[15] Alexander Schrijver,et al. Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.
[16] William J. Cook,et al. TSP Cuts Which Do Not Conform to the Template Paradigm , 2000, Computational Combinatorial Optimization.
[17] Egon Balas,et al. A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming , 2003, Math. Program..
[18] Laurent Poirrier,et al. Multi-row approaches to cutting plane generation , 2012 .
[19] Daniel Espinoza González. Computing with Multi-row Gomory Cuts , 2008 .
[20] R E Gomory,et al. ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS. , 1965, Proceedings of the National Academy of Sciences of the United States of America.
[21] H. P. Williams. THEORY OF LINEAR AND INTEGER PROGRAMMING (Wiley-Interscience Series in Discrete Mathematics and Optimization) , 1989 .
[22] Gérard Cornuéjols,et al. Experiments with Two-Row Cuts from Degenerate Tableaux , 2011, INFORMS J. Comput..
[23] Jean-Philippe P. Richard,et al. Linear-Programming-Based Lifting and Its Application to Primal Cutting-Plane Algorithms , 2009, INFORMS J. Comput..
[24] Laurence A. Wolsey,et al. Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles , 2008, IPCO.
[25] Laurent Poirrier,et al. An algorithm for the separation of two-row cuts , 2014, Math. Program..
[26] Egon Balas,et al. Generating Cuts from Multiple-Term Disjunctions , 2001, IPCO.
[27] Kent Andersen,et al. Mixed-integer sets from two rows of two adjacent simplex bases , 2009, Math. Program..
[28] Gérard Cornuéjols,et al. On the facets of mixed integer programs with two integer variables and two constraints , 2008, Math. Program..
[29] Daniel G. Espinoza. Computing with multi-row Gomory cuts , 2008, Oper. Res. Lett..
[30] George L. Nemhauser,et al. Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms , 2002, Math. Program..
[31] Sanjeeb Dash,et al. A heuristic to generate rank-1 GMI cuts , 2010, Math. Program. Comput..
[32] Matteo Fischetti,et al. Approximating the Split Closure , 2013, INFORMS J. Comput..
[33] Gérard Cornuéjols,et al. Minimal Inequalities for an Infinite Relaxation of Integer Programs , 2010, SIAM J. Discret. Math..
[34] Laurence A. Wolsey,et al. On the Practical Strength of Two-Row Tableau Cuts , 2014, INFORMS J. Comput..
[35] Laurence A. Wolsey,et al. A recursive procedure to generate all cuts for 0–1 mixed integer programs , 1990, Math. Program..
[36] Egon Balas,et al. Intersection Cuts - A New Type of Cutting Planes for Integer Programming , 1971, Oper. Res..
[37] Thorsten Koch,et al. Konrad-zuse-zentrum F ¨ Ur Informationstechnik Berlin Miplib 2003 , 2022 .
[38] Santanu S. Dey,et al. Split Rank of Triangle and Quadrilateral Inequalities , 2009, Math. Oper. Res..
[39] William J. Cook,et al. Local cuts for mixed-integer programming , 2013, Math. Program. Comput..
[40] Oktay Günlük,et al. Strengthening lattice-free cuts using non-negativity , 2011, Discret. Optim..
[41] E. Andrew Boyd,et al. Generating Fenchel Cutting Planes for Knapsack Polyhedra , 1993, SIAM J. Optim..
[42] Gerhard J. Woeginger,et al. Integer Programming and Combinatoral Optimization - 15th International Conference, IPCO 2011, New York, NY, USA, June 15-17, 2011. Proceedings , 2011, IPCO.
[43] Laurence A. Wolsey,et al. Constrained Infinite Group Relaxations of MIPs , 2010, SIAM J. Optim..
[44] Laurence A. Wolsey,et al. Inequalities from Two Rows of a Simplex Tableau , 2007, IPCO.
[45] Sanjeeb Dash,et al. Computational Experiments with Cross and Crooked Cross Cuts , 2014, INFORMS J. Comput..