On a binary distance model for the minimum linear arrangement problem

DOI10.1007/S11750-012-0263-7zbMATH Open1304.90176OpenAlexW2066368324MaRDI QIDQ458974FDOQ458974

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

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Optimal Assignments of Numbers to Vertices
• The linear arrangement problem parameterized above guaranteed value
• Mapping the genome
• Decorous lower bounds for minimum linear arrangement
• Experiments on the minimum linear arrangement problem
• Approximating layout problems on random geometric graphs
• Optimal linear arrangements using betweenness variables
• Generating lower bounds for the linear arrangement problem
• Divide-and-conquer approximation algorithms via spreading metrics
• Graph minimum linear arrangement by multilevel weighted edge contractions
• SOFSEM 2005: Theory and Practice of Computer Science
• Parameterized algorithmics for linear arrangement problems
• Introduction to ABACUS -- a branch-and-cut system
• Single Machine Job Sequencing with Precedence Constraints
• Optimal Numberings of an $N \times N$ Array
• A Review of the Placement and Quadratic Assignment Problems

Cited In (1)

• Title not available (Why is that?)

Uses Software

• ABACUS
• CPLEX
• Harwell-Boeing sparse matrix collection

Recommendations

• Title not available (Why is that?) 👍 👎
• A mixed 0-1 linear programming formulation for the exact solution of the minimum linear arrangement problem 👍 👎
• On minimum cuts and the linear arrangement problem 👍 👎
• Approximation algorithms for maximum linear arrangement 👍 👎
• A branch-and-bound algorithm for the minimum cut linear arrangement problem 👍 👎
• A compact quadratic model and linearizations for the minimum linear arrangement problem 👍 👎
• Tractable Parameterizations for the Minimum Linear Arrangement Problem 👍 👎
• The rectilinear distance minisum problem with minimum distance constraints: 👍 👎
• Tractable Parameterizations for the Minimum Linear Arrangement Problem 👍 👎
• An improved approximation ratio for the minimum linear arrangement problem 👍 👎

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

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