Pages that link to "Item:Q2783791"
From MaRDI portal
The following pages link to An Exact Constraint Logic Programming Algorithm for the Traveling Salesman Problem with Time Windows (Q2783791):
Displayed 7 items.
- On the flexibility of constraint programming models: From single to multiple time windows for the traveling salesman problem (Q1847167) (← links)
- Integrated production and material handling scheduling using mathematical programming and constraint programming (Q2433554) (← links)
- An asymmetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation (Q2482754) (← links)
- A constraint programming approach to the Chinese postman problem with time windows (Q2496043) (← links)
- A Column Generation Model for a Scheduling Problem with Maintenance Constraints (Q2741258) (← links)
- An ant colony system approach for variants of the traveling salesman problem with time windows (Q3429053) (← links)
- Combining Two Structured Domains for Modeling Various Graph Matching Problems (Q5302726) (← links)