A DECOMPOSITION PROPERTY OF POLYHEDRA

[1] INTEGER ROUNDING FOR POLYMATROID AND BRANCHING OPTIMIZATION PROBLEMS [J]. SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1981, 2 (04): : 416 - 425

[2] Berge C, 1972, MATH PROGRAM, V2, P19, DOI 10.1007/BF01584535

[3] Bland R., 1982, 11 INT S MATH PROGR

[4] ON SOME CHARACTERIZATIONS OF TOTALLY UNIMODULAR MATRICES [J]. MATHEMATICAL PROGRAMMING, 1981, 20 (01) : 14 - 21

[5] Edmonds J., 1970, COMBINATORIAL STRUCT, P69

[6] Hoffman AJ., 1956, LINEAR INEQUALITIES, P223

[7] PREEMPTIVE SCHEDULING OF UNRELATED PARALLEL PROCESSORS BY LINEAR-PROGRAMMING [J]. JOURNAL OF THE ACM, 1978, 25 (04) : 612 - 619

[8] POLYNOMIAL ALGORITHMS FOR A CLASS OF LINEAR-PROGRAMS [J]. MATHEMATICAL PROGRAMMING, 1981, 21 (02) : 121 - 136

[9] INTEGRAL DECOMPOSITION IN POLYHEDRA [J]. MATHEMATICAL PROGRAMMING, 1983, 25 (02) : 183 - 198

[10] SCHRIJVER A, 1979, PACKING COVERING COM, P201

[1] INTEGER ROUNDING FOR POLYMATROID AND BRANCHING OPTIMIZATION PROBLEMS [J]. SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1981, 2 (04): : 416 - 425

[2] Berge C, 1972, MATH PROGRAM, V2, P19, DOI 10.1007/BF01584535

[3] Bland R., 1982, 11 INT S MATH PROGR

[4] ON SOME CHARACTERIZATIONS OF TOTALLY UNIMODULAR MATRICES [J]. MATHEMATICAL PROGRAMMING, 1981, 20 (01) : 14 - 21

[5] Edmonds J., 1970, COMBINATORIAL STRUCT, P69

[6] Hoffman AJ., 1956, LINEAR INEQUALITIES, P223

[7] PREEMPTIVE SCHEDULING OF UNRELATED PARALLEL PROCESSORS BY LINEAR-PROGRAMMING [J]. JOURNAL OF THE ACM, 1978, 25 (04) : 612 - 619

[8] POLYNOMIAL ALGORITHMS FOR A CLASS OF LINEAR-PROGRAMS [J]. MATHEMATICAL PROGRAMMING, 1981, 21 (02) : 121 - 136

[9] INTEGRAL DECOMPOSITION IN POLYHEDRA [J]. MATHEMATICAL PROGRAMMING, 1983, 25 (02) : 183 - 198

[10] SCHRIJVER A, 1979, PACKING COVERING COM, P201