scientific article

zbMath0439.90050MaRDI QIDQ3882177

Dirk Hausmann

Publication date: 1980

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

necessary and sufficient conditionsmatroidpolynomial timememory requirementsimplicants0-1 integer programming0-1 polytopescoloring algorithmssets of feasible solutionsadjacency on convex polytopescoloring criteriaextreme points on covex polytopesfundamental adjacency conditionsimplicant graphPL/1 implementationstesting adjacency

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Boolean programming (90C09) Combinatorial aspects of matroids and geometric lattices (05B35) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Polytopes and polyhedra (52Bxx)

Related Items

Adjacency of vertices of the complete pre-order polytope, Faces of diameter two on the Hamiltonian cycle polytope, Interchange graphs and the Hamiltonian cycle polytope, Ideal polytopes and face structures of some combinatorial optimization problems, Characterizations of adjacency on the branching polyhedron, Adjacent vertices on the b-matching polyhedron, The median procedure in cluster analysis and social choice theory, Connectedness of efficient solutions in multiple objective combinatorial optimization, Unnamed Item, A criterion for the adjacency of vertices of polytopes generated by subsets of symmetric groups, Adjacency of the 0-1 knapsack problem, Paths on polymatroids, Faces with large diameter on the symmetric traveling salesman polytope, The skeleton of acyclic Birkhoff polytopes, On affine reducibility of combinatorial polytopes, The common face of some 0/1-polytopes with NP-complete nonadjacency relation, Adjacency on polymatroids, Combinatorial structure and adjacency of vertices of polytope of \(b\)-factors, The skeleton of the symmetric Traveling Salesman Polytope, Partial monotonizations of Hamiltonian cycle polytopes: Dimensions and diameters, Adjacency on combinatorial polyhedra, Hamiltonicity in (0-1)-polyhedra, Computing the degree of a vertex in the skeleton of acyclic Birkhoff polytopes

Uses Software

• PL/I