Pesant, G. and P. Soriano. (1998). An Optimal Strategy for the Constrained Cycle Cover Problem. Research report CRT 98-51, Centre de recherche sur les transports, Universit'e de Montr'eal. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Global Constraints as Graph Properties on Structured Network of .. - Beldiceanu (2000) (24 citations) (Correct)
....value of the vertices. USAGE : As it was reported in [RGIN 99, page 420] this constraint is useful to express matches between persons. This constraint also appears implicitly in the cycle cover problem and corresponds to the 4 conditions given in section 1 Modeling the Cycle Cover Problem of [PESANT SORIANO 98] REMARK : From a modeling point of view this constraint can be express with the cycle constraint [BELDICEANU CONTEJEAN 94, page 115] where one imposes the additional condition that each cycle has only 2 nodes. 1 3 3 1 2 4 4 2 70 ORIGIN : NEW CONSTRAINT : circuit cluster(NCIRCUIT,NODES) ....
....(shown in dark gray) and 3 trees (shown in light gray) Figure 32. A map of 2 cycles and 3 trees. COMMENT : Note that, for variable TREE, we consider a definition different from the definition of then constraint tree(NTREE,NODES) In the example we count 3 trees. 1 2 3 4 5 6 7 8 9 77 ORIGIN : PESANT SORIANO 98] CONSTRAINT : cycle cover(EDGES) ARGUMENTS : EDGES : collection(vertex int, index int, vsucc1 int, isucc1 int, vsucc2 int, isucc2 int) RESTRICTION(S) required(EDGES.vertex,EDGES.index , EDGES.vsucc1,EDGES.isucc1, EDGES.vsucc2,EDGES.isucc2) VERTEX INPUT : EDGES VERTEX GENERATOR : IDENTITY ARC ....
[Article contains additional citation context not shown here]
G. Pesant and P. Soriano. An Optimal Strategy for the Constrained Cycle Cover Problem. CRT Pub. no 98-65, (14 pages), (December 1998).
A Tabu Search Algorithm for Self-Healing Ring Network Design - Fortz, Soriano, Wynants (2000) Self-citation (Soriano) (Correct)
.... network design problem that are more related to backbone transmission network applications and which use exclusively bidirectional SHRs (see Slewinsky, Grover and MacGregor [24] Kennington, Nair and Rahman [15] Luss, Rosenwein and Wong [19] Labb e, Laporte and Soriano [17] Pesant and Soriano [21]) We refer the reader to Soriano et al. 27] for a more detailed overview. The remainder of this paper is organized as follows. In the next section, we present the specifics of the problem at hand and a mathematical model for the logical design. The solution approach is described in Section 3 ....
Pesant, G. and P. Soriano. (1998). An Optimal Strategy for the Constrained Cycle Cover Problem. Research report CRT 98-51, Centre de recherche sur les transports, Universit'e de Montr'eal.
Design and Dimensioning of Survivable SDH/SONET Networks - Soriano, Wynants, al. (1998) Self-citation (Soriano) (Correct)
....while minimizing the length (or weight) of edges that are covered more than once. This problem is closely related but different from the well known Chinese postman problem. The authors propose simple yet efficient heuristics to find feasible cycle covers by exploiting this similarity. Finally, Pesant and Soriano (1998) solve a capacitated version of this cycle cover problem using constraint programming techniques. Design and Dimensioning of Survivable SDH SONET Networks 17 6 Conclusion and Perspectives As we hope to have shown through this overview, the design problems that arise when planning ....
Pesant, G. and P. Soriano. (1998). An Optimal Strategy for the Constrained Cycle Cover Problem. Research report CRT 98-51, Centre de recherche sur les transports, Universit'e de Montr'eal.
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