On the Set-Covering Problem

Cited in

(39)

Maximization of submodular functions: theory and enumeration algorithms
The Boolean quadratic polytope: Some characteristics, facets and relatives
A network relaxation based enumeration algorithm for set partitioning
Implicit enumeration algorithms for the set-partitioning problem
An algorithm to evaluate public transportation stops for minimizing passenger walking distance
A characterization of the uncapacitated network design polytope
Application of optimization methods to the hematological support of patients with disseminated malignancies
Methods for task allocation via agent coalition formation
The column subtraction algorithm: An exact method for solving weighted set covering, packing and partitioning problems
Negotiation and cooperation in multi-agent environments
Improved integral simplex using decomposition for the set partitioning problem
Ordered weighted average optimization in multiobjective spanning tree problem
The simple plant location problem: Survey and synthesis
Adjacency on combinatorial polyhedra
Improving set partitioning problem solutions by zooming around an improving direction
A dual simplex algorithm for the canonical representation of the uncapacitated facility location problem
A Boolean theory of signatures for tonal scales
Integral simplex using decomposition for the set partitioning problem
Irregular polyomino tiling via integer programming with application in phased array antenna design
All-integer column generation for set partitioning: basic principles and extensions
Fuzzy-probabilistic aggregations in the discrete covering problem
Adjacency on polymatroids
Some recognition problems related to graph isomorphism
On discrete optimization with ordering
Simplex pivots on the set packing polytope
The travelling salesman problem and a class of polyhedra of diameter two
Lineare Charakterisierungen von Travelling Salesman Problemen
An SCP-based heuristic approach for scheduling distributed data-intensive applications on global grids
Perfect zero–one matrices
Integral Column Generation for Set Partitioning Problems with Side Constraints
On the facial structure of set packing polyhedra
A fundamental problem in linear inequalities with applications to the travelling salesman problem
A three-phase methodology for developing or evaluating bank networks
A bisection method for solving distance-based clustering problems globally
Pseudo-Boolean optimization
A parallel branch-and-bound-and-check algorithm for nesting
Efficient mathematical programming formulation and algorithmic framework for optimal camera placement
Bibliography on domination in graphs and some basic definitions of domination parameters
Column generation in the integral simplex method

This page was built for publication: On the Set-Covering Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5668245)