Chebyshev center based column generation
type: Item
instance of: scholarly article
title: Chebyshev center based column generation
zbMATH Open document ID: 1236.90074
author: Chungmok Lee
author: Sungsoo Park
published in: Discrete Applied Mathematics
publication date: 2012-03-19T00:00:00Z
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C20
zbMATH DE Number: 6015774
zbMATH Keywords: stabilized column generation
zbMATH Keywords: Chebyshev center
zbMATH Keywords: binpacking problem
zbMATH Keywords: vehicle routing problem
zbMATH Keywords: generalized assignment problem
describes a project that uses: OR-Library
MaRDI profile type: Publication
full work available at URL: j.dam.2011.08.009
OpenAlex ID: W2072974381
cites work: Solving Large-Scale Linear Multicommodity Flow Problems with an Active Set Strategy and Proximal-ACCPM
cites work: Branch-and-price: Column generation for solving huge integer programs
cites work: Acceleration of cutting-plane and column generation algorithms: Applications to network design
cites work: A proximal trust-region algorithm for column generation stabilization
cites work: Dual-Optimal Inequalities for Stabilized Column Generation
cites work: An accelerated central cutting plane algorithm for linear semi-infinite programming
cites work: Q4821526
cites work: Comparison of bundle and classical column generation
cites work: Vehicle routing problem with elementary shortest path based column generation
cites work: The Decomposition Algorithm for Linear Programs
cites work: A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
cites work: Benchmarking optimization software with performance profiles.
cites work: Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW
cites work: Stabilized column generation
cites work: The integration of an interior-point cutting plane method within a branch-and-price algorithm
cites work: A central cutting plane algorithm for the convex programming problem
cites work: Solving nonlinear multicommodity flow problems by the analytic center cutting plane method
cites work: On constrained optimization by adjoint based quasi-Newton methods
cites work: The Cutting-Plane Method for Solving Convex Programs
cites work: Selected Topics in Column Generation
cites work: The B<scp>oxstep</scp> Method for Large-Scale Optimization
cites work: Q3993418
cites work: Stabilized column generation for highly degenerate multiple-depot vehicle scheduling problems
cites work: Q3439711
cites work: Interior point stabilization for column generation
cites work: A Branch-and-Price Algorithm for the Generalized Assignment Problem
cites work: Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
cites work: Implementing Mixed Integer Column Generation
cites work: Q4354953
cites work: A stabilized column generation scheme for the traveling salesman subtour problem
DOI: 10.1016/J.DAM.2011.08.009
Recommended article: Q3693260
Recommended article: A column generation approach to the discrete barycenter problem
Recommended article: Column generation in the integral simplex method
Recommended article: Interior point stabilization for column generation
Recommended article: An Analytic Center Based Column Generation Algorithm for Convex Quadratic Feasibility Problems
Recommended article: A new approximate algorithm for the Chebyshev center
Recommended article: A generalization of column generation to accelerate convergence
Recommended article: A vector Chebyshev algorithm
Recommended article: A Primer in Column Generation
Recommended article: Centrogonal matrices
description: scientific article; zbMATH DE number 6015774