Samuel Deleplanque

Orcid: 0000-0003-4119-6006

According to our database1, Samuel Deleplanque authored at least 15 papers between 2012 and 2023.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Solving 3SAT and MIS Problems with Analog Quantum Machines.
Proceedings of the Computational Science and Its Applications - ICCSA 2023 Workshops, 2023

A Quantum Annealing Solution to the Job Shop Scheduling Problem.
Proceedings of the Computational Science and Its Applications - ICCSA 2023 Workshops, 2023

2020
A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem.
INFORMS J. Comput., 2020

2018
Maintenance on the Railway Network: Disruptions and re-scheduling.
Electron. Notes Discret. Math., 2018

2014
Modélisation et résolution de problèmes difficiles de transport à la demande et de Lot-Sizing. (Modeling and solving difficult DARP and Lot-Sizing problems).
PhD thesis, 2014

Routing on Dynamic Networks: GRASP versus Genetic.
Proceedings of the 2014 Federated Conference on Computer Science and Information Systems, 2014

Branch and Price for a reliability oriented DARP model.
Proceedings of the International Conference on Control, 2014

2013
Constraint Propagation for the Dial-a-Ride Problem with Split Loads.
Proceedings of the Recent Advances in Computational Optimization, 2013

Lagrangean Heuristic for a Multi-Plant Lot-Sizing Problem with Transfer and Storage Capacities.
RAIRO Oper. Res., 2013

A Multi-Machine Scheduling Problem with Global Non Idling Constraint.
Proceedings of the 7th IFAC Conference on Manufacturing Modelling, Management, and Control, 2013

Dial-A-Ride Problem with Time Windows, Transshipments, and Dynamic Transfer Points.
Proceedings of the 7th IFAC Conference on Manufacturing Modelling, Management, and Control, 2013

Robustness Tools in Dynamic Dial-a-Ride Problems.
Proceedings of the Recent Advances in Computational Optimization, 2013

Anticipation in the Dial-a-Ride Problem: an introduction to the robustness.
Proceedings of the 2013 Federated Conference on Computer Science and Information Systems, 2013

2012
Insertion techniques and constraint propagation for the DARP.
Proceedings of the Federated Conference on Computer Science and Information Systems, 2012

Lagrangean decomposition of a lot-sizing problem into facility location and multicommodity flow..
Proceedings of the Federated Conference on Computer Science and Information Systems, 2012


  Loading...