Combinatorial Optimization : Packing and Covering

@inproceedings{Cornujols2000CombinatorialO,
  title={Combinatorial Optimization : Packing and Covering},
  author={G{\'e}rard Cornu{\'e}jols},
  year={2000}
}
1 Preface The integer programming models known as set packing and set covering have a wide range of applications, such as pattern recognition, plant location and airline crew scheduling. Sometimes, due to the special structure of the constraint matrix, the natural linear programming relaxation yields an optimal solution that is integer, thus solving the problem. Sometimes, both the linear programming relaxation and its dual have integer optimal solutions. Under which conditions do such… CONTINUE READING
Highly Influential
This paper has highly influenced 22 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 100 extracted citations

Similar Papers

Loading similar papers…