scientific article; zbMATH DE number 1397185

MaRDI QIDQ4936766zbMATH OpenFDO

Authors R. Yu. Simanchev

Publication date 1 February 2000

zbMATH Keywords

combinatorial optimizationgraph factorpolytoperesidual connectedness

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph algorithms (graph-theoretic aspects) (05C85) Applications of graph theory (05C90)

Recommendations

• Combinatorial structure and adjacency of vertices of polytope of \(b\)-factors
• A necessary condition for facetness of comb inequalities for a polytope of connected 2k-factors
• Adjacency of the best and second best valued solutions in combinatorial optimization problems
• scientific article; zbMATH DE number 1285729
• On the facets of combinatorial polytopes

Cited in

(5)

• Adjacency of the best and second best valued solutions in combinatorial optimization problems
• Combinatorial structure and adjacency of vertices of polytope of \(b\)-factors
• A necessary condition for facetness of comb inequalities for a polytope of connected 2k-factors
• Determining adjacent vertices on assignment polytopes
• scientific article; zbMATH DE number 1285729 (Why is no real title available?)

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 Q4936766)