Pages that link to "Item:Q2253404"

The following pages link to New developments in the primal-dual column generation technique (Q2253404):

Displaying 30 items.

• Large-scale optimization with the primal-dual column generation method (Q266408) (← links)
• A branch-cut-and-price algorithm for the piecewise linear transportation problem (Q319653) (← links)
• Improved branching disjunctions for branch-and-bound: an analytic center approach (Q319920) (← links)
• Using the primal-dual interior point algorithm within the branch-price-and-cut method (Q336429) (← links)
• Determining the \(K\)-best solutions of knapsack problems (Q342015) (← links)
• Hybrid methods for lot sizing on parallel machines (Q342050) (← 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)
• Inverse max+sum spanning tree problem under weighted \(l_1\) norm by modifying the sum-cost vector (Q723499) (← links)
• A branch-price-and-cut algorithm for the vehicle routing problem with time windows and multiple deliverymen (Q1617109) (← links)
• Algorithmic innovations and software for the dual decomposition method applied to stochastic mixed-integer programs (Q1621689) (← links)
• An exact hybrid method for the vehicle routing problem with time windows and multiple deliverymen (Q1652283) (← links)
• Dynamic constraint and variable aggregation in column generation (Q1683120) (← links)
• An interior-point implementation developed and tuned for radiation therapy treatment planning (Q1687310) (← links)
• On the computational efficiency of subgradient methods: a case study with Lagrangian bounds (Q1697974) (← links)
• A branch and price algorithm for EOS constellation imaging and downloading integrated scheduling problem (Q1725600) (← links)
• Design and implementation of a modular interior-point solver for linear optimization (Q2062319) (← links)
• The vehicle allocation problem: alternative formulation and branch-and-price method (Q2147070) (← links)
• A column generation-based heuristic for the split delivery vehicle routing problem with time windows (Q2226483) (← links)
• Bundle methods for sum-functions with ``easy'' components: applications to multicommodity network design (Q2248747) (← links)
• Stabilized dynamic constraint aggregation for solving set partitioning problems (Q2253353) (← links)
• A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs (Q2301138) (← links)
• Exact approaches to the robust vehicle routing problem with time windows and multiple deliverymen (Q2664412) (← links)
• A branch-and-price algorithm for nanosatellite task scheduling to improve mission quality-of-service (Q2673569) (← links)
• A note on the primal-dual column generation method for combinatorial optimization (Q2840728) (← links)
• Solving Large Scale Optimization Problems in the Transportation Industry and Beyond Through Column Generation (Q3299243) (← links)
• Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation (Q5131729) (← links)
• Ray projection for optimizing polytopes with prohibitively many constraints in set-covering column generation (Q5962716) (← links)
• Improving energy aware nanosatellite task scheduling by a branch-cut-and-price algorithm (Q6106600) (← links)
• Consensus-based Dantzig-Wolfe decomposition (Q6167387) (← links)