Corinne Lucet

Orcid: 0000-0002-8634-7237

According to our database1, Corinne Lucet authored at least 21 papers between 1996 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
SimU-TACS: Ant Colony System for a planning problem in health simulation training.
Appl. Soft Comput., November, 2023

Adaptative Local Search for a Pickup and Delivery Problem Applied to Large Parcel Distribution.
Proceedings of the Optimization and Learning - 6th International Conference, 2023

2022
Variable neighborhood search for a planning problem with resource constraints in a health simulation center.
Appl. Intell., 2022

2021
An Adaptive Large Neighborhood Search Method to Plan Patient's Journey in Healthcare.
Proceedings of the Advances in Production Management Systems. Artificial Intelligence for Sustainable and Resilient Production Systems, 2021

An ACO Algorithm for a Scheduling Problem in Health Simulation Center.
Proceedings of the Advances in Production Management Systems. Artificial Intelligence for Sustainable and Resilient Production Systems, 2021

2019
An Effective Variable Neighborhood Search with Perturbation for Location-Routing Problem.
Int. J. Artif. Intell. Tools, 2019

A Planning Problem with Resource Constraints in Health Simulation Center.
Proceedings of the Optimization of Complex Systems: Theory, 2019

Problèmes Combinatoires de graphes : de la Fiabilité des réseaux à la coloration de graphes.
, 2019

2017
Minimum sum coloring problem: Upper bounds for the chromatic strength.
Discret. Appl. Math., 2017

New Lower Bound for the Minimum Sum Coloring Problem.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
Sum Coloring : New upper bounds for the chromatic strength.
CoRR, 2016

2013
A Memetic Algorithm for staff scheduling problem in airport security service.
Expert Syst. Appl., 2013

2010
Lower Bounds for the Minimal Sum Coloring Problem.
Electron. Notes Discret. Math., 2010

2007
K-Terminal Network Reliability Measures With Binary Decision Diagrams.
IEEE Trans. Reliab., 2007

2006
Probability of connection in regular stochastic networks.
SIGMETRICS Perform. Evaluation Rev., 2006

An exact method for graph coloring.
Comput. Oper. Res., 2006

A BDD-Based Heuristic Algorithm for Design of Reliable Networks with Minimal Cost.
Proceedings of the Mobile Ad-hoc and Sensor Networks, Second International Conference, 2006

2004
Pre-processing and Linear-Decomposition Algorithm to Solve the k-Colorability Problem.
Proceedings of the Experimental and Efficient Algorithms, Third International Workshop, 2004

2000
Evaluating Network Reliability and 2-Edge-Connected Reliability in Linear Time for Bounded Pathwidth Graphs.
Algorithmica, 2000

1997
Resolving the Network Reliability Problem with a Tree Decomposition of the Graph.
Proceedings of the On Principles Of Distributed Systems, 1997

1996
A Decomposition Algorithm for Network Reliability Evaluation.
Discret. Appl. Math., 1996


  Loading...