Bend Minimization in Planar Orthogonal Drawings Using Integer Programming

DOI10.1137/040614086MaRDI QIDQ5757344zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Petra Mutzel, René Weiskircher

Publication date 6 September 2007

Published in SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/8309349d9ad05553fccf56c5a2875161f09fb428

zbMATH Keywords

applications of mathematical programmingbend minimizationbranch-and-boundbranch-and-cutcombinatorial optimizationgraph drawinggraph theory applicationsmixed integer programmingorthogonal drawingplanar drawingpolyhedral combinatorics

Mathematics Subject Classification ID

Applications of graph theory (05C90) Combinatorics in computer science (68R05) Mixed integer programming (90C11) Combinatorial optimization (90C27) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Applications of mathematical programming (90C90)

Recommendations

• scientific article; zbMATH DE number 2090004
• Computing orthogonal drawings with the minimum number of bends
• Accelerated bend minimization
• Accelerated bend minimization
• scientific article; zbMATH DE number 1953108

Cited in

(6)

• HV-planarity: algorithms and complexity
• scientific article; zbMATH DE number 2090004 (Why is no real title available?)
• An Integer-Linear Program for Bend-Minimization in Ortho-Radial Drawings
• Computing orthogonal drawings with the minimum number of bends
• Accelerated bend minimization
• Accelerated bend minimization

This page was built for publication: Bend Minimization in Planar Orthogonal Drawings Using Integer Programming

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