Linear ordering based MIP formulations for the vertex separation or pathwidth problem

DOI10.1007/978-3-319-78825-8_27zbMath1504.68178OpenAlexW2798480755MaRDI QIDQ5915650

Sven Mallach

Publication date: 15 June 2018

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-78825-8_27

zbMATH Keywords

mixed integer programmingpathwidthvertex separation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Graph theory (including graph drawing) in computer science (68R10)

Related Items (3)

Parameterized algorithms for book embedding problems ⋮ Parameterized Algorithms for Book Embedding Problems ⋮ Linear ordering based MIP formulations for the vertex separation or pathwidth problem

This page was built for publication: Linear ordering based MIP formulations for the vertex separation or pathwidth problem