On cycles and the stable multi-set polytope

Discrete Optimization - Tập 2 - Trang 241-255 - 2005
Arie M.C.A. Koster1, Adrian Zymolka1
1Zuse Institute Berlin (ZIB), Takustraße 7, D-14195 Berlin, Germany

Tài liệu tham khảo

Caprara, 1996, {0,12}-Chvátal-Gomory cuts, Math. Programming, 74, 221, 10.1007/BF02592196

Caprara, 2000, On the separation of maximally violated mod-k cuts, Math. Programming, 87, 37, 10.1007/s101079900107

Cheng, 2004, A note on the multi-oddity constrained shortest circuits and their separation over the stable multi-set polytope, Oper. Res. Lett., 32, 181, 10.1016/j.orl.2003.05.001

Gerards, 1986, Matrices with the Edmonds–Johnson property, Combinatorica, 6, 365, 10.1007/BF02579262

Gerards, 1998, The graphs with all subgraphs t-perfect, SIAM J. Discrete Math., 11, 524, 10.1137/S0895480196306361

Gijswijt, 2003, On the b-stable set polytope of graphs without bad K4, SIAM J. Discrete Math., 16, 511, 10.1137/S0895480102417343

M. Grötschel, L. Lovász, A. Schrijver, Geometric Algorithms and Combinatorial Optimization, Algorithms and Combinatorics, vol. 2, Springer, Berlin, 1988.

ILOG, CPLEX version 9.0, http://www.ilog.com/products/cplex (2003).

Koster, 2002, Stable multi-sets, Math. Methods Oper. Res., 56, 45, 10.1007/s001860200199

K. Mehlhorn, S. Näher, M. Seel, C. Uhrig, LEDA version 4.1 (2000).

Padberg, 1973, On the facial structure of set packing polyhedra, Math. Programming, 5, 199, 10.1007/BF01580121

A. Schrijver, Combinatorial Optimization—Polyhedra and Efficiency, Algorithms and Combinatorics, vol. 24, Springer, Berlin, 2003.

The second DIMACS implementation challenge: NP-Hard Problems: Maximum Clique, Graph Coloring, and Satisfiability, See http://dimacs.rutgers.edu/Challenges/ or http://mat.gsia.cmu.edu/challenge.html (1992–1993).

Thông tin
Thông tin xuất bản

Discrete Optimization

Tập 2

241-255

Thông tin tác giả