scientific article; zbMATH DE number 3659288

MaRDI QIDQ3858023zbMATH OpenFDO

Authors Dirk Hausmann, Bernhard Korte

Publication date 1978

zbMATH Keywords

0-1-optimization problems0-1-polyhedraadjacencyadjacency relationassignmentcolouring algorithmdiscrete optimizationincidence vectorslinear orderingmatchingmatching problempartitioningpolyhedraprime implicantsset packingvertex coveringvertex packing

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Combinatorial aspects of packing and covering (05B40) Inequalities and extremum problems involving convexity in convex geometry (52A40) Polytopes and polyhedra (52Bxx) Boolean programming (90C09) Integer programming (90C10)

Cited in

(14)

• Characterizations of adjacency on the branching polyhedron
• Hamiltonicity and combinatorial polyhedra
• Adjacent vertices on the b-matching polyhedron
• The median procedure in cluster analysis and social choice theory
• Paths on polymatroids
• Adjacency on the constrained assignment problem
• Adjacency of the best and second best valued solutions in combinatorial optimization problems
• Ideal polytopes and face structures of some combinatorial optimization problems
• Some problems on approximate counting in graphs and matroids
• Adjacency on polymatroids
• Traversing combinatorial 0/1-polytopes via optimization
• Finding a second Hamiltonian decomposition of a 4-regular multigraph by integer linear programming
• Vertex adjacencies in the set covering polyhedron
• On separation and adjacency problems for perfectly matchable subgraph polytopes of a graph

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3858023)