Renaud Hartert

According to our database1, Renaud Hartert authored at least 11 papers between 2013 and 2018.

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

2018
Fast and scalable optimization for segment routing.
PhD thesis, 2018

2017
Kiwi - A Minimalist CP Solver.
CoRR, 2017

Expect the unexpected: Sub-second optimization for segment routing.
Proceedings of the 2017 IEEE Conference on Computer Communications, 2017

2016
Compact-Table: Efficiently Filtering Table Constraints with Reversible Sparse Bit-Sets.
Proceedings of the Principles and Practice of Constraint Programming, 2016

2015
A Declarative and Expressive Approach to Control Forwarding Paths in Carrier-Grade Networks.
Proceedings of the 2015 ACM Conference on Special Interest Group on Data Communication, 2015

Time-Table Disjunctive Reasoning for the Cumulative Constraint.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2015

Solving Segment Routing Problems with Hybrid Constraint Programming Techniques.
Proceedings of the Principles and Practice of Constraint Programming, 2015

Simple and Scalable Time-Table Filtering for the Cumulative Constraint.
Proceedings of the Principles and Practice of Constraint Programming, 2015

Conflict Ordering Search for Scheduling Problems.
Proceedings of the Principles and Practice of Constraint Programming, 2015

2014
A Support-Based Algorithm for the Bi-Objective Pareto Constraint.
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

2013
Multi-Objective Large Neighborhood Search.
Proceedings of the Principles and Practice of Constraint Programming, 2013


  Loading...