Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows (Q5295484): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4532231 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4532225 / rank | |||
Normal rank | |||
Latest revision as of 11:59, 26 June 2024
scientific article; zbMATH DE number 5175455
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows |
scientific article; zbMATH DE number 5175455 |
Statements
Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows (English)
0 references
30 July 2007
0 references
pickup and delivery
0 references
time windows
0 references
valid inequalities
0 references
branch-and-cut
0 references
0 references
