#### Filter Results:

- Full text PDF available (8)

#### Publication Year

1996

2017

- This year (2)
- Last 5 years (5)
- Last 10 years (8)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Gary Hardy, Corinne Lucet, Nikolaos Limnios
- IEEE Trans. Reliability
- 2007

In this paper we present our study of greedy algorithms for solving the minimum sum coloring problem (MSCP). We propose two families of greedy algorithms for solving MSCP, and suggest improvements to the two greedy algorithms most often referred to in the literature for solving the graph coloring problem (GCP): DSATUR [1] and RLF [2].

- Corinne Lucet
- 1997

In this paper, we present and compare some exact methods to resolve the network reliability problems. These problems concern all kinds of networks, such as computer, communication or power networks. When components of the network are subject to random failures, the network may or may not continue functioning after the failures of some components. The… (More)

In this paper, we propose an algorithm based on Binary Decision Diagram (BDD) for computing all-terminal reliability. It is defined as the probability that the nodes in the network can communicate to each other, taking into account the possible failures of network links. The effectiveness of this approach is demonstrated by performing experiments on several… (More)

- Aziz Moukrim, K. Sghiouer, Corinne Lucet, Y. Li
- Electronic Notes in Discrete Mathematics
- 2010

- Jacques Carlier, Corinne Lucet
- Discrete Applied Mathematics
- 1996

This paper presents an algorithm for computing the K-terminal reliability of undirected networks, i.e. the probability that a given set of vertices in the network are connected. when edges and nodes fail independently with known probabilities. This algorithm is based on a decomposition method introduced by Rosenthal. It consists in numbering the vertices of… (More)

- Corinne Lucet, Florence Mendes, Aziz Moukrim
- Computers & OR
- 2006

We are interested in the graph coloring problem.We propose an exact method based on a linear-decomposition of the graph. The complexity of this method is exponential according to the linearwidth of the entry graph, but linear according to its number of vertices. We present some experiments performed on literature instances, among which COLOR02 library… (More)

- Corinne Lucet, Jean-Francois Manouvrier, Jacques Carlier
- Algorithmica
- 2000

This paper presents a decomposition method for computing the 2-edge-connected reliability of undirected networks. This reliability is defined as the probability that all the vertices of a given graph G are 2-edge-connected, when edges fail independently with known probabilities. The principle of this method was introduced by Rosenthal in 1977 [1]. For the… (More)

- Gary Hardy, Corinne Lucet, Nikolaos Limnios
- MSN
- 2006

We have studied a realistic case of scheduling problem in a customer contact center, dealing with multiskill agents. Our model combines the last two steps of the standard approach by determining shifts and by assigning them to agents at the same time (scheduling and rostering). Moreover, we have considered realistic vacations, according to legal constraints… (More)