Projected Chvátal–Gomory cuts for mixed integer linear programs
暂无分享,去创建一个
Matteo Fischetti | Gérard Cornuéjols | Andrea Lodi | Sanjeeb Dash | Pierre Bonami | G. Cornuéjols | M. Fischetti | S. Dash | Andrea Lodi | Pierre Bonami
[1] M. Minoux,et al. Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation , 2005, Discret. Optim..
[2] Laurence A. Wolsey,et al. Aggregation and Mixed Integer Rounding to Solve MIPs , 2001, Oper. Res..
[3] Egon Balas,et al. Optimizing over the split closure , 2008, Math. Program..
[4] Matteo Fischetti,et al. A polyhedral study of the asymmetric traveling salesman problem with time windows , 2000, Networks.
[5] Vasek Chvátal,et al. Edmonds polytopes and a hierarchy of combinatorial problems , 1973, Discret. Math..
[6] Alexander Schrijver,et al. On Cutting Planes , 1980 .
[7] Laurence A. Wolsey,et al. Integer and Combinatorial Optimization , 1988 .
[8] Matteo Fischetti,et al. Combinatorial Benders' Cuts for Mixed-Integer Linear Programming , 2006, Oper. Res..
[9] Egon Balas,et al. A lift-and-project cutting plane algorithm for mixed 0–1 programs , 1993, Math. Program..
[10] Laurence A. Wolsey,et al. Integer and Combinatorial Optimization , 1988, Wiley interscience series in discrete mathematics and optimization.
[11] L. Lovász,et al. Geometric Algorithms and Combinatorial Optimization , 1981 .
[12] Matteo Fischetti,et al. Optimizing over the first Chvátal closure , 2005, Math. Program..
[13] M. Grötschel,et al. A polyhedral study of the asymmetric traveling salesman problem with time windows , 2000 .
[14] Gérard Cornuéjols,et al. A connection between cutting plane theory and the geometry of numbers , 2002, Math. Program..
[15] Alberto Caprara,et al. On the separation of split cuts and related inequalities , 2003, Math. Program..
[16] Matteo Fischetti,et al. Combinatorial Benders' Cuts , 2004, IPCO.
[17] Gérard Cornuéjols,et al. On the Rank of Mixed 0, 1 Polyhedra , 2001, IPCO.
[18] Ralph E. Gomory,et al. Outline of an Algorithm for Integer Solutions to Linear Programs and An Algorithm for the Mixed Integer Problem , 2010, 50 Years of Integer Programming.
[19] William J. Cook,et al. Chvátal closures for mixed integer programming problems , 1990, Math. Program..
[20] Andrea Lodi,et al. On the MIR Closure of Polyhedra , 2007, IPCO.
[21] Friedrich Eisenbrand,et al. NOTE – On the Membership Problem for the Elementary Closure of a Polyhedron , 1999, Comb..
[22] Ralph E. Gomory,et al. An algorithm for integer solutions to linear programs , 1958 .
[23] Norbert Ascheuer,et al. Hamiltonian path problems in the on-line optimization of flexible manufacturing systems , 1996 .
[24] Laurence A. Wolsey,et al. A recursive procedure to generate all cuts for 0–1 mixed integer programs , 1990, Math. Program..
[25] Petra Mutzel,et al. Optimal labeling of point features in rectangular labeling models , 2003, Math. Program..