Comparison of bundle and classical column generation
From MaRDI portal
Publication:2476993
DOI10.1007/S10107-006-0079-ZzbMATH Open1152.90005OpenAlexW1984804966MaRDI QIDQ2476993FDOQ2476993
Authors: Yanyan Li 
Publication date: 12 March 2008
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-006-0079-z
Recommendations
Dantzig-Wolfe decompositionLagrangian dualityVolume algorithmNonsmooth convex optimizationBundle algorithmCutting-plane algorithmsStabilized column generation
Numerical mathematical programming methods (65K05) Convex programming (90C25) Combinatorial optimization (90C27)
Cites Work
- CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Convex Analysis
- Ergodic, primal convergence in dual subgradient schemes for convex programming
- Methods of descent for nondifferentiable optimization
- Title not available (Why is that?)
- An aggregate subgradient method for nonsmooth convex minimization
- An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
- Generalized Bundle Methods
- Stabilized column generation
- Variable metric bundle methods: From conceptual to implementable forms
- New variants of bundle methods
- The Cutting-Plane Method for Solving Convex Programs
- Decomposition and Nondifferentiable Optimization with the Projective Algorithm
- The B<scp>oxstep</scp> Method for Large-Scale Optimization
- Title not available (Why is that?)
- On constrained optimization by adjoint based quasi-Newton methods
- Title not available (Why is that?)
- Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems
- A Proximal Bundle Method with Approximate Subgradient Linearizations
- The Traveling-Salesman Problem and Minimum Spanning Trees
- The omnipresence of Lagrange
- The traveling-salesman problem and minimum spanning trees: Part II
- A dual approach to solving nonlinear programming problems by unconstrained optimization
- Newton's method for convex programming and Tschebyscheff approximation
- The volume algorithm: Producing primal solutions with a subgradient method
- A Column Generation Approach for Graph Coloring
- A descent method with linear programming subproblems for nondifferentiable convex optimization
- Optimal integer solutions to industrial cutting-stock problems. II: Benchmark results
- An inexact bundle approach to cutting-stock problems
- A proximal trust-region algorithm for column generation stabilization
- An inexact bundle variant suited to column generation
- A Cholesky dual method for proximal piecewise linear programming
- The volume algorithm revisited: relation with bundle methods
- Title not available (Why is that?)
- Title not available (Why is that?)
- Complexity estimates of some cutting plane methods based on the analytic barrier
- A Dual Method for Certain Positive Semidefinite Quadratic Programming Problems
- Extending Dantzig's bound to the bounded multiple-class binary knapsack problem
- An adapted step size algorithm for a 0-1 biknapsack Lagrangean dual
- Homogeneous Analytic Center Cutting Plane Methods for Convex Problems and Variational Inequalities
Cited In (39)
- Stabilizing branch-and-price for constrained tree problems
- Large-scale optimization with the primal-dual column generation method
- Computation of approximate \(\alpha \)-points for large scale single machine scheduling problem
- Using the primal-dual interior point algorithm within the branch-price-and-cut method
- Large-scale unit commitment under uncertainty: an updated literature survey
- A stabilised scenario decomposition algorithm applied to stochastic unit commitment problems
- Regularized decomposition of large scale block-structured robust optimization problems
- A new warmstarting strategy for the primal-dual column generation method
- Decomposition approaches for block-structured chance-constrained programs with application to hydro-thermal unit commitment
- Incremental bundle methods using upper models
- Analytic centre stabilization of column generation algorithm for the capacitated vehicle routing problem
- Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation
- The omnipresence of Lagrange
- On the computational efficiency of subgradient methods: a case study with Lagrangian bounds
- A note on the primal-dual column generation method for combinatorial optimization
- Robust ranking and portfolio optimization
- Branching in branch-and-price: A generic scheme
- Consensus-based Dantzig-Wolfe decomposition
- Newton acceleration on manifolds identified by proximal gradient methods
- Ray projection for optimizing polytopes with prohibitively many constraints in set-covering column generation
- Searching for optimal integer solutions to set partitioning problems using column generation
- Exact and heuristic algorithms for order acceptance and scheduling with sequence-dependent setup times
- Bundle methods for sum-functions with ``easy components: applications to multicommodity network design
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- Large-scale unit commitment under uncertainty
- A tutorial on column generation and branch-and-price for vehicle routing problems
- Chebyshev center based column generation
- On the choice of explicit stabilizing terms in column generation
- A branch-price-and-cut algorithm for the vehicle routing problem with time windows and multiple deliverymen
- On parallelizing dual decomposition in stochastic integer programming
- Polyhedral results and stronger Lagrangean bounds for stable spanning trees
- Computational aspects of column generation for nonlinear and conic optimization: classical and linearized schemes
- A class of Dantzig-Wolfe type decomposition methods for variational inequality problems
- Lagrangian bounds for large‐scale multicommodity network design: a comparison between Volume and Bundle methods
- \(\varepsilon\)-Constraint method for bi-objective competitive facility location problem with uncertain demand scenario
- An inexact bundle variant suited to column generation
- An efficient and general approach for the joint order batching and picker routing problem
- Asynchronous level bundle methods
- School bus routing -- a column generation approach
Uses Software
This page was built for publication: Comparison of bundle and classical column generation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2476993)
