E. BALAS AND S. M. NG, On the set covering polytope: All the facets with coefficients in {0,1,2}, Math. Programming 43 (1989), pp. 57--69. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
On the Maximum Feasible Subsystem Problem, IISs and.. - Amaldi, Pfetsch.. (2002) (Correct)
....separated in polynomial time, unless P = NP. Interesting open questions include: What is the computational complexity of separating inequalities arising from generalized antiwebs Do other PFS specific rank facets exist Does the polytope PFS admit higher order facets besides the ones studied in [9] with 0, 1, 2 coefficients Acknowledgements. The authors would like to thank Michael Joswig, Volker Kaibel and Gunter M. Ziegler for helpful discussions. We are also grateful to the anonymous referees for useful comments that improved the paper. Appendix To prove Lemma 3 of Section 3.1, we ....
E. BALAS AND S. M. NG, On the set covering polytope: All the facets with coefficients in {0,1,2}, Math. Programming 43 (1989), pp. 57--69.
Polyhedral Techniques in Combinatorial Optimization II.. - Aardal, van Hoesel (1995) (1 citation) (Correct)
.... (1993a) Clique problems: Grotschel and Wakabayashi (1989, 1990) Coloring: Lee and Leung (1993b) Nemhauser and Park (1991) Covering, packing and partition: Balas and Padberg (1972) Padberg (1973,1977,1980) Nemhauser and Trotter (1974) Trotter (1975) Wolsey (1976b) Balas and Zemel (1977) Balas and Ho (1980), Balas and Ng (1989a,b) Cornu ejols and Sassano (1989) Laurent (1989) Nobili and Sassano (1989) Sassano (1989) Chopra and Rao (1993) Ferreira et al. 1996,1998) Muller and Schulz (1996) Cheng and Cunningham (1997) Cut polytopes: Barahona and Mahjoub (1986) Barahona et al. 1988) ....
E. Balas and S.M. Ng (1989a) "On the set covering polytope: I. All the facets with coefficients in f0; 1; 2g", Mathematical Programming 43 57--69.
Polyhedral Techniques in Combinatorial Optimization II.. - Aardal, van Hoesel (1995) (1 citation) (Correct)
.... (1993a) Clique problems: Grotschel and Wakabayashi (1989, 1990) Coloring: Lee and Leung (1993b) Nemhauser and Park (1991) Covering, packing and partition: Balas and Padberg (1972) Padberg (1973,1977,1980) Nemhauser and Trotter (1974) Trotter (1975) Wolsey (1976b) Balas and Zemel (1977) Balas and Ho (1980), Balas and Ng (1989a,b) Cornu ejols and Sassano (1989) Laurent (1989) Nobili and Sassano (1989) Sassano (1989) Chopra and Rao (1993) Cut polytopes: Barahona and Mahjoub (1986) Barahona et al. 1988) Conforti et al. 1990 91a,b) De Sousa and Laurent (1991) Deza et al. 1992) Deza and ....
E. Balas and S.M. Ng (1989a) "On the set covering polytope: I. All the facets with coefficients in f0; 1; 2g", Mathematical Programming 43 57--69.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC