Pages that link to "Item:Q1762457"
From MaRDI portal
The following pages link to Optimal linear arrangements using betweenness variables (Q1762457):
Displaying 17 items.
- Semidefinite relaxations of ordering problems (Q359627) (← links)
- On a binary distance model for the minimum linear arrangement problem (Q458974) (← links)
- A mixed integer linear programming formulation of the maximum betweenness problem (Q976481) (← links)
- Improved exact approaches for row layout problems with departments of equal length (Q1651703) (← links)
- A compact quadratic model and linearizations for the minimum linear arrangement problem (Q2091791) (← links)
- A mixed-integer linear programming approach for the t-row and the multi-bay facility layout problem (Q2239887) (← links)
- New exact approaches to row layout problems (Q2295979) (← links)
- Optimal configurations of lines and a statistical application (Q2361153) (← links)
- Maximum incomplete recursive circulants in graph embeddings (Q2788730) (← links)
- Projection Methods in Conic Optimization (Q2802538) (← links)
- Global Approaches for Facility Layout and VLSI Floorplanning (Q2802548) (← links)
- Lower bounds for the minimum linear arrangement of a graph (Q2861498) (← links)
- Decorous lower bounds for minimum linear arrangement (Q2899100) (← links)
- (Q5121937) (← links)
- (Q5140734) (← links)
- Minimum Linear Arrangement of Generalized Sierpinski Graphs (Q6181951) (← links)
- Binary programs for asymmetric betweenness problems and relations to the quadratic linear ordering problem (Q6491337) (← links)