Checking the Feasibility of Dial-a-Ride Instances Using Constraint Programming
Year of publication: |
2011
|
---|---|
Authors: | Berbeglia, Gerardo ; Pesant, Gilles ; Rousseau, Louis-Martin |
Published in: |
Transportation science : the publication of the Transportation Science Section, Operation Research Society of America. - Hanover, Md : INFORMS, ISSN 0041-1655, ZDB-ID 1609580. - Vol. 45.2011, 3, p. 399-413
|
Saved in:
Saved in favorites
Similar items by person
-
Feasibility of the Pickup and Delivery Problem with Fixed Partial Routes: A Complexity Analysis
Berbeglia, Gerardo, (2012)
-
Checking the feasibility of dial-a-ride instances using constraint programming
Berbeglia, Gerardo, (2011)
-
Feasibility of the pickup and delivery problem with fixed partial routes : a complexity analysis
Berbeglia, Gerardo, (2012)
- More ...