Generating lower bounds for the linear arrangement problem
From MaRDI portal
Recommendations
Cites work
- A Minimum Linear Arrangement Algorithm for Undirected Trees
- An r-Dimensional Quadratic Placement Algorithm
- Multi-Terminal Network Flows
- On optimal linear arrangements of trees
- One-dimensional logic gate assignment and interval graphs
- Optimal Assignments of Numbers to Vertices
- Optimal Linear Ordering
- Some simplified NP-complete graph problems
Cited in
(17)- Exact solution of the 2-dimensional grid arrangement problem
- Optimal linear arrangements using betweenness variables
- Lower and upper bounds for the linear arrangement problem on interval graphs
- Decorous combinatorial lower bounds for row layout problems
- Minimum linear arrangement of chord graphs
- Single-machine scheduling with an external resource
- On a class of metrics related to graph layout problems
- A polyhedral approach to the single row facility layout problem
- On a binary distance model for the minimum linear arrangement problem
- An optimal time algorithm for minimum linear arrangement of chord graphs
- Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions
- Experiments on the minimum linear arrangement problem
- On minimum cuts and the linear arrangement problem
- A linear formulation with \(O(n^2)\) variables for quadratic assignment problems with Manhattan distance matrices
- Global approaches for facility layout and VLSI floorplanning
- Lower bounds for the minimum linear arrangement of a graph
- A semidefinite optimization approach for the single-row layout problem with unequal dimensions
This page was built for publication: Generating lower bounds for the linear arrangement problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1891924)
