Pages that link to "Item:Q1915914"

The following pages link to Solving real-world linear ordering problems using a primal-dual interior point cutting plane method (Q1915914):

Displaying 15 items.

• Large-scale optimization with the primal-dual column generation method (Q266408) (← links)
• Using the primal-dual interior point algorithm within the branch-price-and-cut method (Q336429) (← links)
• A new warmstarting strategy for the primal-dual column generation method (Q494315) (← links)
• A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method (Q526844) (← links)
• An updated survey on the linear ordering problem for weighted or unweighted tournaments (Q970187) (← links)
• Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension (Q1029621) (← links)
• Fixing variables and generating classical cutting planes when using an interior point branch and cut method to solve integer programming problems (Q1278590) (← links)
• Workload balancing and loop layout in the design of a flexible manufacturing system (Q1840856) (← links)
• Block-insertion-based algorithms for the linear ordering problem (Q2289935) (← links)
• Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem (Q2391873) (← links)
• The linear ordering problem revisited (Q2629715) (← links)
• A survey on the linear ordering problem for weighted or unweighted tournaments (Q2644372) (← links)
• Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts (Q2802535) (← links)
• On handling cutting planes in interior-point methods for solving semi-definite relaxations of binary quadratic optimization problems (Q2885494) (← links)
• Robust Learning of Consumer Preferences (Q5080653) (← links)