An SDP Approach to Multi-level Crossing Minimization

DOI10.1137/1.9781611972917.12zbMath1430.90457OpenAlexW4214490924MaRDI 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

Mathematics Subject Classification ID

Semidefinite programming (90C22) Integer programming (90C10) Linear programming (90C05) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (3)

A computational study and survey of methods for the single-row facility layout problem ⋮ Semidefinite relaxations of ordering problems ⋮ Semidefinite relaxations for partitioning, assignment and ordering problems

This page was built for publication: An SDP Approach to Multi-level Crossing Minimization