Efficient neighborhood search for the Probabilistic Pickup and Delivery Travelling Salesman Problem (Q5463668): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/net.20063 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4245527820 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Introduction to Stochastic Programming / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 15:06, 10 June 2024
scientific article; zbMATH DE number 2193283
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient neighborhood search for the Probabilistic Pickup and Delivery Travelling Salesman Problem |
scientific article; zbMATH DE number 2193283 |
Statements
Efficient neighborhood search for the Probabilistic Pickup and Delivery Travelling Salesman Problem (English)
0 references
5 August 2005
0 references
pick up and delivery
0 references
probabilistic Traveling Salesman Problem neighborhood search
0 references
