Computational experience with general cutting planes for the set covering problem
type: Item
instance of: scholarly article
title: Computational experience with general cutting planes for the set covering problem
zbMATH Open document ID: 1154.90603
author: Pasquale Avella
author: Maurizio Boccia
author: Igor' Leonidovich Vasilyev
published in: Operations Research Letters
publication date: 2009-02-23T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 5509871
zbMATH Keywords: set covering
zbMATH Keywords: cutting planes
zbMATH Keywords: exact separation
describes a project that uses: Concorde
MaRDI profile type: Publication
full work available at URL: j.orl.2008.09.009
OpenAlex ID: W2006346540
cites work: Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems
cites work: Exact solutions to linear programming problems
cites work: On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\)
cites work: On the set covering polytope. II: Lifting the facets with coefficients in \(\{\) 0,1,2\(\}\)
cites work: A Heuristic Method for the Set Covering Problem
cites work: Algorithms for the set covering problem
cites work: A Lagrangian-based heuristic for large-scale set covering problems
cites work: On the 0,1 facets of the set covering polytope
cites work: Optimizing over the first Chvátal closure
cites work: Algorithms to Separate ${\{0,\frac{1}{2}\}}$ -Chvátal-Gomory Cuts
cites work: Solving hard set covering problems
cites work: Facets and lifting procedures for the set covering polytope
cites work: On the facial structure of the set covering polytope
DOI: 10.1016/J.ORL.2008.09.009
description: scientific article; zbMATH DE number 5509871