Solving Segment Routing Problems with Hybrid Constraint Programming Techniques
- 13 August 2015
- book chapter
- Published by Springer Nature
- p. 592-608
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- The Segment Routing Architecture2014
- Introduction2012
- A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windowsComputers & Operations Research, 2006
- CP(Graph): Introducing a Graph Computation Domain in Constraint ProgrammingLecture Notes in Computer Science, 2005
- A minimum interference routing algorithm2004
- Overview and Principles of Internet Traffic Engineering2002
- Using Branch-and-Price-and-Cut to Solve Origin-Destination Integer Multicommodity Flow ProblemsOperations Research, 2000
- An efficient representation for sparse setsACM Letters on Programming Languages and Systems, 1993
- An algorithm for the resource constrained shortest path problemNetworks, 1989
- A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time WindowsINFOR: Information Systems and Operational Research, 1988