Facets in the crossing number polytope

DOI10.1137/09076965XMaRDI QIDQ3094902zbMATH OpenFDO

Authors Markus Chimani

Publication date 27 October 2011

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

facetspolyhedral studycrossing numberinteger linear programKuratowski constraints

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Integer programming (90C10) Planar graphs; geometric and topological aspects of graph theory (05C10)

Recommendations

• A New Approach to Exact Crossing Minimization
• A branch-and-cut approach to the crossing number problem
• Graph Drawing
• Recent advances in exact crossing minimization (extended abstract)
• An ILP-based Proof System for the Crossing Number Problem

Cited in

(2)

• Simple realizability of complete abstract topological graphs simplified
• scientific article; zbMATH DE number 2114110 (Why is no real title available?)

This page was built for publication: Facets in the crossing number polytope

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