Pages that link to "Item:Q5463444"
From MaRDI portal
The following pages link to Experiments on the minimum linear arrangement problem (Q5463444):
Displayed 19 items.
- Branch and bound for the cutwidth minimization problem (Q339558) (← links)
- On a binary distance model for the minimum linear arrangement problem (Q458974) (← links)
- An optimal time algorithm for minimum linear arrangement of chord graphs (Q497140) (← links)
- Heuristics for the data arrangement problem on regular trees (Q498454) (← links)
- A mixed 0-1 linear programming formulation for the exact solution of the minimum linear arrangement problem (Q732777) (← links)
- Parameterized algorithmics for linear arrangement problems (Q1003461) (← links)
- New relationships for multi-neighborhood search for the minimum linear arrangement problem (Q1679609) (← links)
- Linear nearest neighbor optimization in quantum circuits: a multiobjective perspective (Q1700361) (← links)
- Optimal linear arrangements using betweenness variables (Q1762457) (← links)
- The single row facility layout problem: state of the art (Q1947218) (← links)
- A compact quadratic model and linearizations for the minimum linear arrangement problem (Q2091791) (← links)
- An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem (Q2482382) (← links)
- Minimum linear arrangement of chord graphs (Q2518728) (← links)
- (Q2861498) (← links)
- Minimum Linear Arrangement of Series-Parallel Graphs (Q3453293) (← links)
- A New Lower Bound for the Minimum Linear Arrangement of a Graph (Q3503534) (← links)
- Lower and upper bounds for the linear arrangement problem on interval graphs (Q4634312) (← links)
- Bounds of the sum of edge lengths in linear arrangements of trees (Q5857519) (← links)
- On linear layout of bicube and construction of optimal incomplete bicube (Q6130207) (← links)