Knapsack problems: algorithms and computer implementations
Knapsack problems: algorithms and computer implementations
A new optimization algorithm for the vehicle routing problem with time windows
Operations Research
Solving nonlinear multicommodity flow problems by the analytic center cutting plane method
Mathematical Programming: Series A and B - Special issue: interior point methods in theory and practice
Discrete Mathematics
Branch-And-Price: Column Generation for Solving Huge Integer Programs
Operations Research
Convex Optimization
The integration of an interior-point cutting plane method within a branch-and-price algorithm
Mathematical Programming: Series A and B
An accelerated central cutting plane algorithm for linear semi-infinite programming
Mathematical Programming: Series A and B
Vehicle routing problem with elementary shortest path based column generation
Computers and Operations Research
Acceleration of cutting-plane and column generation algorithms: Applications to network design
Networks - Special Issue on Multicommodity Flows and Network Design
A stabilized column generation scheme for the traveling salesman subtour problem
Discrete Applied Mathematics - Special issue: International symposium on combinatorial optimization CO'02
Selected Topics in Column Generation
Operations Research
Dual-Optimal Inequalities for Stabilized Column Generation
Operations Research
Comparison of bundle and classical column generation
Mathematical Programming: Series A and B
A proximal cutting plane method using Chebychev center for nonsmooth convex optimization
Mathematical Programming: Series A and B
A proximal trust-region algorithm for column generation stabilization
Computers and Operations Research
Interior point stabilization for column generation
Operations Research Letters
| Hi-index | 0.04 |
The classical column generation approach often shows a very slow convergence. Many different acceleration techniques have been proposed recently to improve the convergence. Here, we briefly survey these methods and propose a novel algorithm based on the Chebyshev center of the dual polyhedron. The Chebyshev center can be obtained by solving a linear program; consequently, the proposed method can be applied with small modifications on the classical column generation procedure. We also show that the performance of our algorithm can be enhanced by introducing proximity parameters which enable the position of the Chebyshev center to be adjusted. Numerical experiments are conducted on the binpacking, vehicle routing problem with time windows, and the generalized assignment problem. The computational results of these experiments demonstrate the effectiveness of our proposed method.