Pages that link to "Item:Q3503534"
From MaRDI portal
The following pages link to A New Lower Bound for the Minimum Linear Arrangement of a Graph (Q3503534):
Displaying 14 items.
- A mixed 0-1 linear programming formulation for the exact solution of the minimum linear arrangement problem (Q732777) (← links)
- New relationships for multi-neighborhood search for the minimum linear arrangement problem (Q1679609) (← links)
- Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions (Q1753550) (← links)
- Optimal linear arrangements using betweenness variables (Q1762457) (← links)
- Generating lower bounds for the linear arrangement problem (Q1891924) (← links)
- A compact quadratic model and linearizations for the minimum linear arrangement problem (Q2091791) (← links)
- Decorous combinatorial lower bounds for row layout problems (Q2189888) (← links)
- Minimum linear arrangements (Q2413151) (← links)
- A linear formulation with \(O(n^2)\) variables for quadratic assignment problems with Manhattan distance matrices (Q2516354) (← links)
- Minimum linear arrangement of chord graphs (Q2518728) (← links)
- Lower bounds for the minimum linear arrangement of a graph (Q2861498) (← links)
- Decorous lower bounds for minimum linear arrangement (Q2899100) (← links)
- (Q4393287) (← links)
- A note on minimum linear arrangement for BC graphs (Q4634526) (← links)
