The following pages link to On the Set-Covering Problem (Q5668245):
Displaying 35 items.
- Irregular polyomino tiling via integer programming with application in phased array antenna design (Q288219) (← links)
- All-integer column generation for set partitioning: basic principles and extensions (Q296975) (← links)
- On discrete optimization with ordering (Q367635) (← links)
- An SCP-based heuristic approach for scheduling distributed data-intensive applications on global grids (Q436744) (← links)
- Pseudo-Boolean optimization (Q697569) (← links)
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
- Column generation in the integral simplex method (Q948677) (← links)
- Maximization of submodular functions: theory and enumeration algorithms (Q1027590) (← links)
- The Boolean quadratic polytope: Some characteristics, facets and relatives (Q1122479) (← links)
- A network relaxation based enumeration algorithm for set partitioning (Q1123128) (← links)
- Implicit enumeration algorithms for the set-partitioning problem (Q1143941) (← links)
- An algorithm to evaluate public transportation stops for minimizing passenger walking distance (Q1173527) (← links)
- A characterization of the uncapacitated network design polytope (Q1200785) (← links)
- Application of optimization methods to the hematological support of patients with disseminated malignancies (Q1220440) (← links)
- Methods for task allocation via agent coalition formation (Q1274277) (← links)
- The column subtraction algorithm: An exact method for solving weighted set covering, packing and partitioning problems (Q1333026) (← links)
- Negotiation and cooperation in multi-agent environments (Q1391348) (← links)
- Improved integral simplex using decomposition for the set partitioning problem (Q1616829) (← links)
- Ordered weighted average optimization in multiobjective spanning tree problem (Q1753508) (← links)
- The simple plant location problem: Survey and synthesis (Q1837098) (← links)
- Adjacency on combinatorial polyhedra (Q1842660) (← links)
- Improving set partitioning problem solutions by zooming around an improving direction (Q2288990) (← links)
- A dual simplex algorithm for the canonical representation of the uncapacitated facility location problem (Q2314413) (← links)
- A Boolean theory of signatures for tonal scales (Q2448914) (← links)
- Integral Simplex Using Decomposition for the Set Partitioning Problem (Q2875612) (← links)
- Fuzzy-probabilistic aggregations in the discrete covering problem (Q3086377) (← links)
- Adjacency on polymatroids (Q3335528) (← links)
- Some recognition problems related to graph isomorphism (Q3470503) (← links)
- Simplex pivots on the set packing polytope (Q3701197) (← links)
- The travelling salesman problem and a class of polyhedra of diameter two (Q4081007) (← links)
- Lineare Charakterisierungen von Travelling Salesman Problemen (Q4119037) (← links)
- Perfect zero–one matrices (Q4770779) (← links)
- Integral Column Generation for Set Partitioning Problems with Side Constraints (Q5106424) (← links)
- On the facial structure of set packing polyhedra (Q5181532) (← links)
- A fundamental problem in linear inequalities with applications to the travelling salesman problem (Q5663633) (← links)
