Chvátal closures for mixed integer programming problems
暂无分享,去创建一个
[1] M. Padberg,et al. On the symmetric travelling salesman problem II , 1979 .
[2] Robert G. Jeroslow,et al. Cutting-Plane Theory: Disjunctive Methods , 1977 .
[3] Martin Grötschel,et al. Facets of the Bipartite Subgraph Polytope , 1985, Math. Oper. Res..
[4] Martin Grötschel,et al. On the symmetric travelling salesman problem I: Inequalities , 1979, Math. Program..
[5] Vasek Chvátal,et al. Edmonds polytopes and a hierarchy of combinatorial problems , 1973, Discret. Math..
[6] Charles E. Blair,et al. Constructive characterizations of the value-function of a mixed-integer program I , 1984, Discret. Appl. Math..
[7] Charles E. Blair,et al. Constructive characterizations of the value function of a mixed-integer program II , 1985, Discret. Appl. Math..
[8] Manfred Padberg,et al. On the Uncapacitated Plant Location Problem. I: Valid Inequalities and Facets , 1983, Math. Oper. Res..
[9] Alexander Schrijver,et al. On Cutting Planes , 1980 .
[10] Thomas L. Magnanti,et al. Valid inequalities and facets of the capacitated plant location problem , 1989, Math. Program..
[11] Laurence A. Wolsey,et al. Uncapacitated lot-sizing: The convex hull of solutions , 1984 .
[12] László Lovász,et al. Algorithmic theory of numbers, graphs and convexity , 1986, CBMS-NSF regional conference series in applied mathematics.
[13] Eric Allender. On the number of cycles possible in digraphs with large girth , 1985, Discret. Appl. Math..
[14] Ralph E. Gomory,et al. An algorithm for integer solutions to linear programs , 1958 .
[15] Vasek Chvátal. Cutting Planes in Combinatorics , 1985, Eur. J. Comb..
[16] L. E. Dickson. Introduction to the theory of numbers , 1933 .
[17] William R. Pulleyblank,et al. Clique Tree Inequalities and the Symmetric Travelling Salesman Problem , 1986, Math. Oper. Res..
[18] James B. Orlin,et al. Cyclic Scheduling via Integer Programs with Circular Ones , 1980, Oper. Res..
[19] E. Wright,et al. An Introduction to the Theory of Numbers , 1939 .
[20] Laurence A. Wolsey,et al. Valid Linear Inequalities for Fixed Charge Problems , 1985, Oper. Res..
[21] Vasek Chvátal,et al. Edmonds polytopes and weakly hamiltonian graphs , 1973, Math. Program..