Solution techniques for the large set covering problem
type: Item
instance of: scholarly article
title: Solution techniques for the large set covering problem
zbMATH Open document ID: 1147.68091
author: P. Galinier
author: Alain Hertz
published in: Discrete Applied Mathematics
publication date: 2007-03-02T00:00:00Z
Mathematics Subject Classification ID: 68W05
Mathematics Subject Classification ID: 05B40
Mathematics Subject Classification ID: 05D05
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5130471
zbMATH Keywords: set covering
zbMATH Keywords: constraint satisfaction
zbMATH Keywords: irreducible infeasible sets
zbMATH Keywords: \(k\)-colouring
describes a project that uses: DIMACS
MaRDI profile type: Publication
full work available at URL: j.dam.2006.04.043
OpenAlex ID: W2130863730
cites work: Consistency restoration and explanations in dynamic CSPs---Application to configuration
cites work: An effective polynomial-time heuristic for the minimum-cardinality IIS set-covering problem
cites work: Finding a Useful Subset of Constraints for Analysis in an Infeasible Linear Program
cites work: Q4395423
cites work: Fast heuristics for the maximum feasible subsystem problem
cites work: Locating Minimal Infeasible Constraint Sets in Linear Programs
cites work: Efficient algorithms for finding critical subgraphs
cites work: Q4198056
cites work: Analyzing Infeasible Mixed-Integer and Integer Linear Programs
cites work: Finding the chromatic number by means of critical graphs
cites work: Using tabu search techniques for graph coloring
cites work: Q3993187
cites work: Boosting complete techniques thanks to local search methods
cites work: Q5687262
cites work: Finding the minimum weight IIS cover of an infeasible system of linear inequalities
cites work: Detecting IIS in infeasible linear programmes using techniques from goal programming
cites work: Irreducibly inconsistent systems of linear inequalities
DOI: 10.1016/J.DAM.2006.04.043
Recommended article: Q3105856
Recommended article: Algorithms for large scale set covering problems
Recommended article: An efficient heuristic for large set covering problems
Recommended article: An approach to the solution of the set-covering problem
Recommended article: Q3831014
Recommended article: Solving large set covering problems on a personal computer
Recommended article: Algorithms for the set covering problem
Recommended article: Note: A local-search heuristic for large set-covering problems
Recommended article: Solving hard set covering problems
Recommended article: A Heuristic Method for the Set Covering Problem
description: scientific article; zbMATH DE number 5130471