Decorous lower bounds for minimum linear arrangement
DOI10.1287/IJOC.1100.0390zbMATH Open1243.90185DBLPjournals/informs/CapraraLG11OpenAlexW2172284060WikidataQ57702178 ScholiaQ57702178MaRDI QIDQ2899100FDOQ2899100
Authors: Alberto Caprara, Adam N. Letchford, Juan-José Salazar-González 
Publication date: 28 July 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://eprints.lancs.ac.uk/id/eprint/45449/1/10.pdf
Recommendations
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial optimization (90C27) Graph representations (geometric and intersection representations, etc.) (05C62)
Cited In (23)
- Exact solution of the 2-dimensional grid arrangement problem
- Optimal linear arrangements using betweenness variables
- Minimizing setups in ordered sets of fixed width
- Lower and upper bounds for the linear arrangement problem on interval graphs
- Decorous combinatorial lower bounds for row layout problems
- Generating lower bounds for the linear arrangement problem
- A note on minimum linear arrangement for BC graphs
- Dynamic programming and lower-bound approaches to the minimum binding problem
- Optimization Bounds from the Branching Dual
- On a class of metrics related to graph layout problems
- Semidefinite relaxations of ordering problems
- A polyhedral approach to the single row facility layout problem
- Improved exact approaches for row layout problems with departments of equal length
- On a binary distance model for the minimum linear arrangement problem
- Branch and bound for the cutwidth minimization problem
- Experiments on the minimum linear arrangement problem
- A note on computational approaches for the antibandwidth problem
- Discrete optimization with decision diagrams
- A New Lower Bound for the Minimum Linear Arrangement of a Graph
- Approximation Guarantees for the Minimum Linear Arrangement Problem by Higher Eigenvalues
- A linear formulation with \(O(n^2)\) variables for quadratic assignment problems with Manhattan distance matrices
- A compact quadratic model and linearizations for the minimum linear arrangement problem
- Lower bounds for the minimum linear arrangement of a graph
This page was built for publication: Decorous lower bounds for minimum linear arrangement
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2899100)
