An SDP Approach to Multi-level Crossing Minimization
From MaRDI portal
Publication:5233706
DOI10.1137/1.9781611972917.12zbMath1430.90457MaRDI QIDQ5233706
Philipp Hungerländer, Markus Chimani, Michael Jünger, Petra Mutzel
Publication date: 12 September 2019
Published in: 2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)
Full work available at URL: http://e-archive.informatik.uni-koeln.de/616/2/zaik2011-616.pdf
90C22: Semidefinite programming
90C10: Integer programming
90C05: Linear programming
68R10: Graph theory (including graph drawing) in computer science
90C27: Combinatorial optimization
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
Semidefinite relaxations for partitioning, assignment and ordering problems, A computational study and survey of methods for the single-row facility layout problem, Semidefinite relaxations of ordering problems