On a binary distance model for the minimum linear arrangement problem

DOI10.1007/s11750-012-0263-7zbMath1304.90176OpenAlexW2066368324MaRDI QIDQ458974

Gerhard Reinelt, Hanna Seitz

Publication date: 8 October 2014

Published in: Top (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11750-012-0263-7

zbMATH Keywords

integer programminggraph layoutlinear arrangement problem

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Uses Software

• ABACUS
• CPLEX
• Harwell-Boeing sparse matrix collection

Cites Work

• Parameterized algorithmics for linear arrangement problems
• Introduction to ABACUS -- a branch-and-cut system
• Optimal linear arrangements using betweenness variables
• Generating lower bounds for the linear arrangement problem
• The linear arrangement problem parameterized above guaranteed value
• Approximating Layout Problems on Random Geometric Graphs
• Decorous Lower Bounds for Minimum Linear Arrangement
• Divide-and-conquer approximation algorithms via spreading metrics
• Single Machine Job Sequencing with Precedence Constraints
• Optimal Numberings of an $N \times N$ Array
• Mapping the genome
• Experiments on the minimum linear arrangement problem
• Graph minimum linear arrangement by multilevel weighted edge contractions
• Optimal Assignments of Numbers to Vertices
• A Review of the Placement and Quadratic Assignment Problems
• SOFSEM 2005: Theory and Practice of Computer Science
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On a binary distance model for the minimum linear arrangement problem