Pages that link to "Item:Q2476993"

The following pages link to Comparison of bundle and classical column generation (Q2476993):

Displaying 39 items.

• Large-scale optimization with the primal-dual column generation method (Q266408) (← links)
• Bin packing and cutting stock problems: mathematical models and exact algorithms (Q323473) (← links)
• Using the primal-dual interior point algorithm within the branch-price-and-cut method (Q336429) (← links)
• Decomposition approaches for block-structured chance-constrained programs with application to hydro-thermal unit commitment (Q486936) (← links)
• A new warmstarting strategy for the primal-dual column generation method (Q494315) (← links)
• A tutorial on column generation and branch-and-price for vehicle routing problems (Q633483) (← links)
• Branching in branch-and-price: A generic scheme (Q652288) (← links)
• Chebyshev center based column generation (Q765323) (← links)
• An inexact bundle variant suited to column generation (Q1016116) (← links)
• On the choice of explicit stabilizing terms in column generation (Q1025985) (← links)
• A branch-price-and-cut algorithm for the vehicle routing problem with time windows and multiple deliverymen (Q1617109) (← links)
• Exact and heuristic algorithms for order acceptance and scheduling with sequence-dependent setup times (Q1652516) (← links)
• On the computational efficiency of subgradient methods: a case study with Lagrangian bounds (Q1697974) (← links)
• Large-scale unit commitment under uncertainty: an updated literature survey (Q1730531) (← links)
• A stabilised scenario decomposition algorithm applied to stochastic unit commitment problems (Q1753575) (← links)
• Regularized decomposition of large scale block-structured robust optimization problems (Q1789623) (← links)
• Robust ranking and portfolio optimization (Q1926870) (← links)
• An efficient and general approach for the joint order batching and picker routing problem (Q2183853) (← links)
• Asynchronous level bundle methods (Q2205980) (← links)
• Bundle methods for sum-functions with ``easy'' components: applications to multicommodity network design (Q2248747) (← links)
• \(\varepsilon\)-Constraint method for bi-objective competitive facility location problem with uncertain demand scenario (Q2308185) (← links)
• Large-scale unit commitment under uncertainty (Q2351161) (← links)
• A class of Dantzig-Wolfe type decomposition methods for variational inequality problems (Q2436644) (← links)
• On parallelizing dual decomposition in stochastic integer programming (Q2450615) (← links)
• Computation of approximate \(\alpha \)-points for large scale single machine scheduling problem (Q2482376) (← links)
• Computational aspects of column generation for nonlinear and conic optimization: classical and linearized schemes (Q2696926) (← links)
• A note on the primal-dual column generation method for combinatorial optimization (Q2840728) (← links)
• Analytic centre stabilization of column generation algorithm for the capacitated vehicle routing problem (Q3458834) (← links)
• Incremental Bundle Methods using Upper Models (Q4603045) (← links)
• School bus routing—a column generation approach (Q4980002) (← links)
• Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation (Q5131729) (← links)
• Stabilizing branch‐and‐price for constrained tree problems (Q5326785) (← links)
• Searching for optimal integer solutions to set partitioning problems using column generation (Q5416769) (← links)
• The omnipresence of Lagrange (Q5920487) (← links)
• Ray projection for optimizing polytopes with prohibitively many constraints in set-covering column generation (Q5962716) (← links)
• Newton acceleration on manifolds identified by proximal gradient methods (Q6044974) (← links)
• Lagrangian bounds for large‐scale multicommodity network design: a comparison between Volume and Bundle methods (Q6070422) (← links)
• Polyhedral results and stronger Lagrangean bounds for stable spanning trees (Q6110626) (← links)
• Consensus-based Dantzig-Wolfe decomposition (Q6167387) (← links)