Renaud Hartert

12 papers A* 3A 5B 1Journal 2
YearRankTypeTitle / Venue / Authors
2018 — —
Fast and scalable optimization for segment routing.
Renaud Hartert
2017 A* conf
Expect the unexpected: Sub-second optimization for segment routing.
INFOCOM
Steven Gay, Renaud Hartert, Stefano Vissicchio
2017 J jnl
Kiwi - A Minimalist CP Solver.
CoRR
Renaud Hartert
2016 A conf
Compact-Table: Efficiently Filtering Table Constraints with Reversible Sparse Bit-Sets.
CP
Jordan Demeulenaere, Renaud Hartert, Christophe Lecoutre, Guillaume Perez, Laurent Perron, Jean-Charles Régin, Pierre Schaus
2016 J jnl
Compact-Table: Efficiently Filtering Table Constraints with Reversible Sparse Bit-Sets.
CoRR
Jordan Demeulenaere, Renaud Hartert, Christophe Lecoutre, Guillaume Perez, Laurent Perron, Jean-Charles Régin, Pierre Schaus
2015 A* conf
A Declarative and Expressive Approach to Control Forwarding Paths in Carrier-Grade Networks.
SIGCOMM
Renaud Hartert, Stefano Vissicchio, Pierre Schaus, Olivier Bonaventure, Clarence Filsfils, Thomas Telkamp, Pierre François
2015 A conf
Conflict Ordering Search for Scheduling Problems.
CP
Steven Gay, Renaud Hartert, Christophe Lecoutre, Pierre Schaus
2015 A conf
Simple and Scalable Time-Table Filtering for the Cumulative Constraint.
CP
Steven Gay, Renaud Hartert, Pierre Schaus
2015 A conf
Solving Segment Routing Problems with Hybrid Constraint Programming Techniques.
CP
Renaud Hartert, Pierre Schaus, Stefano Vissicchio, Olivier Bonaventure
2015 B conf
Time-Table Disjunctive Reasoning for the Cumulative Constraint.
CPAIOR
Steven Gay, Renaud Hartert, Pierre Schaus
2014 A* conf
A Support-Based Algorithm for the Bi-Objective Pareto Constraint.
AAAI
Renaud Hartert, Pierre Schaus
2013 A conf
Multi-Objective Large Neighborhood Search.
CP
Pierre Schaus, Renaud Hartert