Fixed-parameter algorithms for rectilinear Steiner tree and rectilinear traveling salesman problem in the plane

von Cambazard, Hadrien
Veröffentlicht in European journal of operational research (162018)

New Randomized Strategies for the Color Coding Algorithm

von Pansart, Lucie
Veröffentlicht in European Conference on Artificial Intelligence (24. : 2020 : Online) ECAI 2020 ; Part 1 (2020)

Exact algorithms for the order picking problem

von Pansart, Lucie
Veröffentlicht in Computers & operations research (2018)

Analysis of Reduced Costs Filtering for Alldifferent and Minimum Weight Alldifferent Global Constraints

von Claus, Guillaume
Veröffentlicht in European Conference on Artificial Intelligence (24. : 2020 : Online) ECAI 2020 ; Part 1 (2020)

Local search and constraint programming for the post enrolment-based course timetabling problem

Veröffentlicht in Annals of operations research (2012)

Domino portrait generation : a fast and scalable approach

Veröffentlicht in Annals of operations research (2011)

An optimal constraint programming approach to the open-shop problem

Veröffentlicht in Institute for Operations Research and the Management Sciences INFORMS journal on computing (2012)

Tree Search for the Sequential Ordering Problem

von Libralesso, Luc
Veröffentlicht in European Conference on Artificial Intelligence (24. : 2020 : Online) ECAI 2020 ; Part 1 (2020)

Lagrangian Decomposition for Optimal Cost Partitioning

von Pommerening, Florian
Veröffentlicht in International Conference on Automated Planning and Scheduling (29. : 2019 : Berkeley, Calif.) Proceedings of the Twenty-ninth International Conference on Automated Planning and Scheduling (2019)

An efficient and general approach for the joint order batching and picker routing problem

von Briant, Olivier
Veröffentlicht in European journal of operational research (2020)