Pages that link to "Item:Q359627"

The following pages link to Semidefinite relaxations of ordering problems (Q359627):

Displaying 16 items.

• Single row layout models (Q319651) (← links)
• A computational study and survey of methods for the single-row facility layout problem (Q354626) (← links)
• New semidefinite programming relaxations for the linear ordering and the traveling salesman problem (Q729796) (← links)
• A semidefinite optimization approach to the target visitation problem (Q895779) (← links)
• The single row facility layout problem: state of the art (Q1947218) (← links)
• Exact approaches for the combined cell layout problem (Q2098024) (← links)
• Decorous combinatorial lower bounds for row layout problems (Q2189888) (← links)
• A mixed-integer linear programming approach for the t-row and the multi-bay facility layout problem (Q2239887) (← links)
• Block-insertion-based algorithms for the linear ordering problem (Q2289935) (← links)
• Using a factored dual in augmented Lagrangian methods for semidefinite programming (Q2294228) (← links)
• New exact approaches to row layout problems (Q2295979) (← links)
• Computational Approaches to Max-Cut (Q2802547) (← links)
• Global Approaches for Facility Layout and VLSI Floorplanning (Q2802548) (← links)
• An Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial Programming (Q3009764) (← links)
• Strong SDP based bounds on the cutwidth of a graph (Q6065655) (← links)
• A linear ordering problem with weighted rank (Q6117320) (← links)