Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows (Q5295484): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/net.20177 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3122956505 / rank | |||
Normal rank | |||
Revision as of 18:21, 19 March 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
