Pages that link to "Item:Q2861498"
From MaRDI portal
The following pages link to Lower bounds for the minimum linear arrangement of a graph (Q2861498):
Displaying 13 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)
- Optimal linear arrangements using betweenness variables (Q1762457) (← links)
- Generating lower bounds for the linear arrangement problem (Q1891924) (← links)
- An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem (Q2482382) (← links)
- Minimum linear arrangement of chord graphs (Q2518728) (← links)
- Laying out sparse graphs with provably minimum bandwidth (Q2890478) (← links)
- Decorous lower bounds for minimum linear arrangement (Q2899100) (← links)
- Approximation Guarantees for the Minimum Linear Arrangement Problem by Higher Eigenvalues (Q3167406) (← 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)
- A note on minimum linear arrangement for BC graphs (Q4634526) (← links)
- (Q5396750) (← links)