Efficient feasibility testing for dial-a-ride problems (Q1866982)

From MaRDI portal

Revision as of 10:27, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Efficient feasibility testing for dial-a-ride problems	scientific article

Statements

scholarly article

0 references

Efficient feasibility testing for dial-a-ride problems (English)

0 references

0 references

Savelsbergh, Martin W. P.

0 references

Operations Research Letters

0 references

publication date

2 April 2003

0 references

MaRDI profile type

MaRDI publication profile

0 references

A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows

0 references

k-interchange procedures for local search in a precedence-constrained routing problem

0 references

Scheduling Large-Scale Advance-Request Dial-A-Ride Systems

0 references

Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: I. Scheduling

0 references

Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: II. Routing

0 references

full work available at URL

https://doi.org/10.1016/s0167-6377(02)00120-7

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/S0167-6377(02)00120-7

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1866982

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1866982&oldid=37279991"