Approximation algorithms for integer covering problems via greedy column generation

Y. Crama; J. Van De Klundert

Displaying similar documents to “Approximation algorithms for integer covering problems via greedy column generation”

Solving a family of permutation problems on 0-1 matrices

Gilbert Laporte (1987)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

Some remarks on two degrees of asymmetry in the traveling salesman problem

Bernd Jeromin, Frank Körner (1988)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

Parametric integer programming

Paul Feautrier (1988)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

Effects of ordering and updating techniques on the performance of the Karmarkar algorithm

Abdellah Salhi, George R. Lindfield (1991)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

Improved approximation of the general soft-capacitated facility location problem

Laurent Alfandari (2007)

RAIRO - Operations Research

Similarity:

The soft-capacitated facility location problem, where each facility is composed of a variable number of fixed-capacity production units, has been recently studied in several papers, especially in the metric case. In this paper, we only consider the general problem where connection costs do not systematically satisfy the triangle inequality property. We show that an adaptation of the set covering greedy heuristic, where the subproblem is approximately solved by a fully polynomial-time...