E. Balas and S.M. Ng. On the set covering polytype: I. all the facets with coefficients in f0,1,2g. Mathematical Programming, 43:57--69, 1989.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....and 10,000 columns. Sen [27] investigated the performances of a simulated annealing algorithm and a simple genetic algorithm on the minimal cost set covering problem, but few computational results were given. Earlier work, both optimal and heuristic solution algorithms for the SCP, can be found in [4, 5, 14, 17, 26]. This paper introduces a genetic algorithm based heuristic for solving non unicost SCP s. The paper is organised as follows. In Section 2 the basic steps of a simple genetic algorithm are described. In Section 3 our modified genetic algorithm is presented. In Section 4 some parameters in the ....

E. Balas and S.M. Ng. On the set covering polytype: I. all the facets with coefficients in f0,1,2g. Mathematical Programming, 43:57--69, 1989.

....set covering polytopes. 4. 2 Known Properties of the General Set Covering Polytope Within this section, we will discuss the general set covering polytope defined as: GSCP (D) convfx 2 B n j Dx 1g Among the basic facts known about the polyhedron GSCP (D) are the following theorems (see [4] for example) Theorem 4.4 (GSCP Dimensionality [4] The polyhedron GSCP (D) is full dimensional if and only if D is a clutter and each row of D has 2 or more nonzero values. As we have seen from Theorem 4.3, the MWIC polyhedron meets the conditions for full dimensionality. The remaining ....

....of the General Set Covering Polytope Within this section, we will discuss the general set covering polytope defined as: GSCP (D) convfx 2 B n j Dx 1g Among the basic facts known about the polyhedron GSCP (D) are the following theorems (see [4] for example) Theorem 4. 4 (GSCP Dimensionality [4]) The polyhedron GSCP (D) is full dimensional if and only if D is a clutter and each row of D has 2 or more nonzero values. As we have seen from Theorem 4.3, the MWIC polyhedron meets the conditions for full dimensionality. The remaining results in this section depend upon the dimensionality of ....

[Article contains additional citation context not shown here]

Balas E., and Ng S., On the Set Covering Polytope: I. All the Facets with Coefficients in f0, 1, 2g, Mathematical Programming, Vol. 43 (1989).

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