scientific article
From MaRDI portal
Publication:3858023
zbMath0423.90051MaRDI QIDQ3858023
Publication date: 1978
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
partitioningpolyhedramatchingset packingmatching problemdiscrete optimizationassignmentcolouring algorithmadjacencyvertex coveringadjacency relationlinear orderingprime implicantsincidence vectorsvertex packing0-1-polyhedra0-1-optimization problems
Integer programming (90C10) Inequalities and extremum problems involving convexity in convex geometry (52A40) Boolean programming (90C09) Combinatorial aspects of matroids and geometric lattices (05B35) Combinatorial aspects of packing and covering (05B40) Polytopes and polyhedra (52Bxx)
Related Items
Ideal polytopes and face structures of some combinatorial optimization problems, Characterizations of adjacency on the branching polyhedron, Hamiltonicity and combinatorial polyhedra, Adjacent vertices on the b-matching polyhedron, Some Problems on Approximate Counting in Graphs and Matroids, On separation and adjacency problems for perfectly matchable subgraph polytopes of a graph, The median procedure in cluster analysis and social choice theory, Paths on polymatroids, Adjacency on polymatroids, Vertex adjacencies in the set covering polyhedron, Adjacency on the constrained assignment problem, Adjacency of the best and second best valued solutions in combinatorial optimization problems
