The constrained crossing minimization problem -- a first approach

MaRDI QIDQ4494408zbMATH OpenFDO

Authors Petra Mutzel, Thomas Ziegler

Publication date 5 August 2001

zbMATH Keywords

branch-and-cut algorithmsconstrained crossing minimization probleminteger linear programming

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• scientific article; zbMATH DE number 1500682
• A New Approach to Exact Crossing Minimization
• A branch-and-cut approach to the crossing number problem
• Graph Drawing

Cited in

(9)

• Crossing minimization for symmetries
• scientific article; zbMATH DE number 1974113 (Why is no real title available?)
• scientific article; zbMATH DE number 1500682 (Why is no real title available?)
• scientific article; zbMATH DE number 1796980 (Why is no real title available?)
• An ILP-based Proof System for the Crossing Number Problem
• scientific article; zbMATH DE number 7525513 (Why is no real title available?)
• scientific article; zbMATH DE number 7236457 (Why is no real title available?)
• An SDP approach to multi-level crossing minimization
• On k-plane insertion into plane drawings

Describes a project that uses

Uses Software

• ABACUS

This page was built for publication: The constrained crossing minimization problem -- a first approach

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