A proximal trust-region algorithm for column generation stabilization

DOI10.1016/j.cor.2004.08.003zbMath1079.90097OpenAlexW2069617674MaRDI QIDQ2571184

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 generationcutting planebundle methodsproximal methodsnondifferentiable convex optimizationmultiple depot vehicle scheduling problem

Mathematics Subject Classification ID

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

Related Items

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

Uses Software

• CPLEX

Cites Work

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