Solution techniques for the Large Set Covering Problem
Copyright policy )Solution techniques for the Large Set Covering Problem
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
- École Polytechnique France
- Polytechnique Montréal Canada
Applied Mathematics, constraint satisfaction, Extremal set theory, set covering, Constraint satisfaction, Irreducible infeasible sets, k-colouring, Approximation methods and heuristics in mathematical programming, irreducible infeasible sets, \(k\)-colouring, Set covering, Discrete Mathematics and Combinatorics, Nonnumerical algorithms, Combinatorial aspects of packing and covering
Applied Mathematics, constraint satisfaction, Extremal set theory, set covering, Constraint satisfaction, Irreducible infeasible sets, k-colouring, Approximation methods and heuristics in mathematical programming, irreducible infeasible sets, \(k\)-colouring, Set covering, Discrete Mathematics and Combinatorics, Nonnumerical algorithms, Combinatorial aspects of packing and covering
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).17 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Top 10%
Citations provided by BIP!Popularity provided by BIP!