Pages that link to "Item:Q1891924"

The following pages link to Generating lower bounds for the linear arrangement problem (Q1891924):

Displaying 17 items.

• 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)
• An optimal time algorithm for minimum linear arrangement of chord graphs (Q497140) (← links)
• On a class of metrics related to graph layout problems (Q603106) (← links)
• On minimum cuts and the linear arrangement problem (Q1570828) (← 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)
• Exact solution of the 2-dimensional grid arrangement problem (Q1926499) (← links)
• Single-machine scheduling with an external resource (Q2030286) (← 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)
• Minimum linear arrangement of chord graphs (Q2518728) (← links)
• A semidefinite optimization approach for the single-row layout problem with unequal dimensions (Q2568330) (← links)
• Global Approaches for Facility Layout and VLSI Floorplanning (Q2802548) (← links)
• (Q2861498) (← links)
• Lower and upper bounds for the linear arrangement problem on interval graphs (Q4634312) (← links)
• Experiments on the minimum linear arrangement problem (Q5463444) (← links)