A new optimization algorithm for the vehicle routing problem with time windows
Operations Research
A descent method with linear programming subproblems for nondifferentiable convex optimization
Mathematical Programming: Series A and B
Discrete Mathematics
A Framework for Constraint Programming Based Column Generation
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
Branch-And-Price: Column Generation for Solving Huge Integer Programs
Operations Research
On the choice of explicit stabilizing terms in column generation
Discrete Applied Mathematics
A new geometric shape-based genetic clustering algorithm for the multi-depot vehicle routing problem
Expert Systems with Applications: An International Journal
Stabilized branch-and-price for the rooted delay-constrained steiner tree problem
INOC'11 Proceedings of the 5th international conference on Network optimization
Chebyshev center based column generation
Discrete Applied Mathematics
New Lower Bounds and Exact Method for the m-PVRP
Transportation Science
An Exact Algorithm for the Integrated Planning of Berth Allocation and Quay Crane Assignment
Transportation Science
Network interdiction via a Critical Disruption Path: Branch-and-Price algorithms
Computers and Operations Research
Hi-index | 0.00 |
Interior point stabilization is an acceleration method for column generation algorithms. It addresses degeneracy and convergence difficulties by selecting a dual solution inside the optimal space rather than retrieving an extreme point. The method is applied to the case of the vehicle routing problem with time windows.