A proximal trust-region algorithm for column generation stabilization

DOI10.1016/J.COR.2004.08.003MaRDI QIDQ2571184zbMATH OpenOpenAlexFDO

Authors Jacques Desrosiers, Hatem M. T. Ben Amor

Publication date 1 November 2005

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2004.08.003

zbMATH Keywords

column generationproximal methodsbundle methodscutting planenondifferentiable convex optimizationmultiple depot vehicle scheduling problem

Mathematics Subject Classification ID

Convex programming (90C25) Traffic problems in operations research (90B20) Derivative-free methods and methods using generalized derivatives (90C56)

Recommendations

• Stabilized column generation
• Interior point stabilization for column generation
• On the choice of explicit stabilizing terms in column generation
• Analytic centre stabilization of column generation algorithm for the capacitated vehicle routing problem
• A generalization of column generation to accelerate convergence

Cites work

• scientific article; zbMATH DE number 3466447 (Why is no real title available?)
• scientific article; zbMATH DE number 3550468 (Why is no real title available?)
• scientific article; zbMATH DE number 3577030 (Why is no real title available?)
• A Branch-and-Cut Algorithm for the Multiple Depot Vehicle Scheduling Problem
• A Column Generation Approach to the Multiple-Depot Vehicle Scheduling Problem
• A Linear Programming Approach to the Cutting-Stock Problem
• A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
• A branch and bound algorithm for the multiple depot vehicle scheduling problem
• A bundle Bregman proximal method for convex nondifferentiable minimization
• A descent method with linear programming subproblems for nondifferentiable convex optimization
• A note on two problems in connexion with graphs
• Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
• Convergence Rate Analysis of Nonquadratic Proximal Methods for Convex and Linear Programming
• Decomposition Principle for Linear Programs
• Dual-Optimal Inequalities for Stabilized Column Generation
• Generalized Bundle Methods
• Monotone Operators and the Proximal Point Algorithm
• Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
• On the Convergence of the Proximal Point Algorithm for Convex Minimization
• Proximal Minimization Methods with Generalized Bregman Functions
• Proximité et dualité dans un espace hilbertien
• Stabilized column generation
• The B<scp>oxstep</scp> Method for Large-Scale Optimization
• The Cutting-Plane Method for Solving Convex Programs

Cited in

(14)

• Stabilized column generation for highly degenerate multiple-depot vehicle scheduling problems
• Using the primal-dual interior point algorithm within the branch-price-and-cut method
• Stabilizing branch-and-price for constrained tree problems
• Managing large fixed costs in vehicle routing and crew scheduling problems solved by column generation
• Searching for optimal integer solutions to set partitioning problems using column generation
• Accelerating the branch-and-price algorithm using machine learning
• A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times
• Comparison of bundle and classical column generation
• Chebyshev center based column generation
• BoxStep methods for crew pairing problems
• 0-1 reformulations of the multicommodity capacitated network design problem
• On the choice of explicit stabilizing terms in column generation
• Interior point stabilization for column generation
• School bus routing -- a column generation approach

Describes a project that uses

Uses Software

• CPLEX

This page was built for publication: A proximal trust-region algorithm for column generation stabilization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2571184)