Pages that link to "Item:Q2899100"
From MaRDI portal
The following pages link to Decorous Lower Bounds for Minimum Linear Arrangement (Q2899100):
Displaying 15 items.
- Branch and bound for the cutwidth minimization problem (Q339558) (← links)
- Semidefinite relaxations of ordering problems (Q359627) (← links)
- A polyhedral approach to the single row facility layout problem (Q378107) (← links)
- On a binary distance model for the minimum linear arrangement problem (Q458974) (← links)
- On a class of metrics related to graph layout problems (Q603106) (← links)
- Improved exact approaches for row layout problems with departments of equal length (Q1651703) (← links)
- Optimal linear arrangements using betweenness variables (Q1762457) (← links)
- Exact solution of the 2-dimensional grid arrangement problem (Q1926499) (← links)
- A note on computational approaches for the antibandwidth problem (Q2051212) (← 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)
- A linear formulation with \(O(n^2)\) variables for quadratic assignment problems with Manhattan distance matrices (Q2516354) (← links)
- Discrete Optimization with Decision Diagrams (Q2806864) (← links)
- Lower and upper bounds for the linear arrangement problem on interval graphs (Q4634312) (← links)
- Optimization Bounds from the Branching Dual (Q5139843) (← links)
