A mixed 0-1 linear programming formulation for the exact solution of the minimum linear arrangement problem
From MaRDI portal
Publication:732777
DOI10.1007/S11590-009-0130-0zbMATH Open1180.90205OpenAlexW2075799742MaRDI QIDQ732777FDOQ732777
Authors: André R. S. Amaral 
Publication date: 15 October 2009
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-009-0130-0
Recommendations
Cites Work
- QAPLIB - a quadratic assignment problem library
- Title not available (Why is that?)
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- Title not available (Why is that?)
- Optimal Assignments of Numbers to Vertices
- On bipartite drawings and the linear arrangement problem
- A level-2 reformulation-linearization technique bound for the quadratic assignment problem
- On the exact solution of a facility layout problem
- A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs
- Optimal linear labelings and eigenvalues of graphs
- An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem
- Optimal Linear Ordering
- Experiments on the minimum linear arrangement problem
- Graph minimum linear arrangement by multilevel weighted edge contractions
- Optimal Numberings of an $N \times N$ Array
- Title not available (Why is that?)
- A Minimum Linear Arrangement Algorithm for Undirected Trees
- Computing Lower Bounds for the Quadratic Assignment Problem with an Interior Point Algorithm for Linear Programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- A genetic hillclimbing algorithm for the optimal linear arrangement problem
Cited In (16)
- Minimum linear arrangements
- Optimal linear arrangements using betweenness variables
- An improved mixed-integer programming model for the double row layout of facilities
- A new hybrid evolutionary algorithm for the MinLA problem
- Simulated annealing and tabu search approaches for the Corridor Allocation Problem
- New exact approaches to row layout problems
- Construction heuristics for the single row layout problem with machine-spanning clearances
- On a binary distance model for the minimum linear arrangement problem
- Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions
- An improved approximation ratio for the minimum linear arrangement problem
- A parallel ordering problem in facilities layout
- A genetic hillclimbing algorithm for the optimal linear arrangement problem
- The scaling of the minimum sum of edge lengths in uniformly random trees
- Contributions to the minimum linear arrangement problem.
- The single row facility layout problem: state of the art
- A compact quadratic model and linearizations for the minimum linear arrangement problem
Uses Software
This page was built for publication: A mixed 0-1 linear programming formulation for the exact solution of the minimum linear arrangement problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q732777)
