Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Large Neighborhood Search for Dial-a-Ride Problems

Large Neighborhood Search for Dial-a-Ride Problems http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Principles and Practice of Constraint Programming – CP 2011, Lecture Notes in Computer Science CrossRef

Large Neighborhood Search for Dial-a-Ride Problems

Principles and Practice of Constraint Programming – CP 2011, Lecture Notes in Computer Science : 400-413 – Jan 1, 2011

Large Neighborhood Search for Dial-a-Ride Problems

Principles and Practice of Constraint Programming – CP 2011, Lecture Notes in Computer Science : 400-413 – Jan 1, 2011

Loading next page...
 
/lp/crossref/large-neighborhood-search-for-dial-a-ride-problems-T9om8jBTH0

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
CrossRef
ISSN
0302-9743
DOI
10.1007/978-3-642-23786-7_31
Publisher site
See Article on Publisher Site

Abstract

Journal

Principles and Practice of Constraint Programming – CP 2011, Lecture Notes in Computer ScienceCrossRef

Published: Jan 1, 2011

There are no references for this article.