A constraint programming approach to the Chinese postman problem with time windows (Q2496043): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q5519709 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Matching, Euler tours and the Chinese postman / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4510100 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Exact Constraint Logic Programming Algorithm for the Traveling Salesman Problem with Time Windows / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Transforming arc routing into node routing problems / rank | |||
Normal rank | |||
Latest revision as of 16:48, 24 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A constraint programming approach to the Chinese postman problem with time windows |
scientific article |
Statements
A constraint programming approach to the Chinese postman problem with time windows (English)
0 references
30 June 2006
0 references
arc routing problems
0 references
Chinese postman problems
0 references
vehicle routing problems
0 references
time windows
0 references
constraint programming
0 references
0 references
