Publication:4133404
From MaRDI portal
zbMath0357.90038MaRDI QIDQ4133404
Alan J. Hoffman, D. R. Fulkerson, R. Oppenheim
Publication date: 1974
Related Items
Dominating set games., A min-max relation for the partial q-colourings of a graph. II: Box perfection, Domination, independent domination, and duality in strongly chordal graphs, Total weak unimodularity: Testing and applications, On the integrality of an extreme solution to pluperfect graph and balanced systems, On the integer properties of scheduling set partitioning models, Recognizing max-flow min-cut path matrices, A note on odd/even cycles, On the 0,1 facets of the set covering polytope, Complement total unimodularity, Discrete extremal problems, Alpha-balanced graphs and matrices and GF(3)-representability of matroids, Structural properties and decomposition of linear balanced matrices, A decomposition theory for matroids. VII: Analysis of minimal violation matrices, Local unimodularity of matrix-vector pairs, An exact algorithm for multiple depot bus scheduling, Balanced matrices with row sum 3, Resolution and the integrality of satisfiability problems, One-node cutsets and the dominating set polytope, Restricted coloring models for timetabling, Decomposition of balanced matrices, Minimax relations for the partial q-colorings of a graph, Balanced \(0,\pm 1\) matrices. I: Decomposition, Reliability, covering and balanced matrices, Restrictions and preassignments in preemptive open shop scheduling, Balanced \(0,\pm 1\)-matrices, bicoloring and total dual integrality, Balanced matrices, Perfect matchings in balanced hypergraphs, A polynomial recognition algorithm for balanced matrices, Recognizing balanceable matrices, On balanced graphs, Covering, Packing and Generalized Perfection, A Class of Balanced Matrices Arising from Location Problems, Standard graded vertex cover algebras, cycles and leaves, Totally-Balanced and Greedy Matrices, A Dynamic Programming Algorithm for Covering Problems with (Greedy) Totally Balanced Constraint Matrices
