Experiments on the minimum linear arrangement problem
From MaRDI portal
Recommendations
- Lower bounds for the minimum linear arrangement of a graph
- Decorous lower bounds for minimum linear arrangement
- A New Lower Bound for the Minimum Linear Arrangement of a Graph
- An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem
- Contributions to the minimum linear arrangement problem.
Cites work
- A Minimum Linear Arrangement Algorithm for Undirected Trees
- A Spectral Algorithm for Seriation and the Consecutive Ones Problem
- Applications of the crossing number
- Approximating layout problems on random geometric graphs
- Approximating layout problems on random graphs
- Convergence theorems for some layout measures on random lattice and random geometric graphs
- Equation of state calculations by fast computing machines
- Generating lower bounds for the linear arrangement problem
- scientific article; zbMATH DE number 437546 (Why is no real title available?)
- scientific article; zbMATH DE number 4048925 (Why is no real title available?)
- scientific article; zbMATH DE number 4070955 (Why is no real title available?)
- scientific article; zbMATH DE number 3700882 (Why is no real title available?)
- scientific article; zbMATH DE number 176780 (Why is no real title available?)
- scientific article; zbMATH DE number 177832 (Why is no real title available?)
- scientific article; zbMATH DE number 3526692 (Why is no real title available?)
- scientific article; zbMATH DE number 3532756 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1261808 (Why is no real title available?)
- scientific article; zbMATH DE number 1303559 (Why is no real title available?)
- scientific article; zbMATH DE number 1330033 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- scientific article; zbMATH DE number 866628 (Why is no real title available?)
- On Estimating the Largest Eigenvalue with the Lanczos Algorithm
- Optimal Assignments of Numbers to Vertices
- Optimal linear labelings and eigenvalues of graphs
- Optimal Linear Ordering
- Optimal Numberings of an N \times N Array
- Optimization by simulated annealing
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
- Path optimization for graph partitioning problems
- QAPLIB - a quadratic assignment problem library
- Single Machine Job Sequencing with Precedence Constraints
- Some simplified NP-complete graph problems
- TSPLIB—A Traveling Salesman Problem Library
Cited in
(33)- Parameterized algorithmics for linear arrangement problems
- New relationships for multi-neighborhood search for the minimum linear arrangement problem
- Linear nearest neighbor optimization in quantum circuits: a multiobjective perspective
- Optimal linear arrangements using betweenness variables
- Generating lower bounds for the 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
- Minimizing profile of graphs using a hybrid simulating annealing algorithm
- An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem
- Minimum linear arrangement of chord graphs
- Lower bounds for the minimum linear arrangement of a graph
- Decorous lower bounds for minimum linear arrangement
- Branch and bound for the cutwidth minimization problem
- Minimum Linear Arrangement of Series-Parallel Graphs
- A New Lower Bound for the Minimum Linear Arrangement of a Graph
- scientific article; zbMATH DE number 4043771 (Why is no real title available?)
- scientific article; zbMATH DE number 1953102 (Why is no real title available?)
- On a binary distance model for the minimum linear arrangement problem
- Lower and upper bounds for the linear arrangement problem on interval graphs
- An optimal time algorithm for minimum linear arrangement of chord graphs
- Heuristics for the data arrangement problem on regular trees
- A genetic hillclimbing algorithm for the optimal linear arrangement problem
- Graph minimum linear arrangement by multilevel weighted edge contractions
- Multiscale approach for the network compression-friendly ordering
- Bounds of the sum of edge lengths in linear arrangements of trees
- On linear layout of bicube and construction of optimal incomplete bicube
- Multi-armed bandit for the cyclic minimum sitting arrangement problem
- The sum of edge lengths in random linear arrangements
- A probabilistic algorithm for optimal linear arrangements
- A mixed 0-1 linear programming formulation for the exact solution of the minimum linear arrangement problem
- Maximum linear arrangement: exact algorithms for specific classes of graphs and approximation algorithms for wide classes of graphs
- Mathematical formulation and heuristic methods for the min-max sitting arrangement problem in the cycle
- A new hybrid evolutionary algorithm for the MinLA problem
This page was built for publication: Experiments on the minimum linear arrangement problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5463444)
