Pages that link to "Item:Q4661094"
From MaRDI portal
The following pages link to Exact solution of the generalized routing problem through graph transformations (Q4661094):
Displaying 14 items.
- Two-phase branch-and-cut for the mixed capacitated general routing problem (Q319006) (← links)
- Solving the equality generalized traveling salesman problem using the Lin-Kernighan-Helsgaun algorithm (Q499157) (← links)
- Solving a generalized traveling salesperson problem with stochastic customers (Q868135) (← links)
- Transformation of the generalized traveling-salesman problem into the standard traveling-salesman problem (Q1310959) (← links)
- Classification of de Bruijn-based labeled digraphs (Q1686053) (← links)
- Branch-price-and-cut for the mixed capacitated general routing problem with time windows (Q1754228) (← links)
- Improved lower bounds and exact algorithm for the capacitated arc routing problem (Q1942278) (← links)
- An efficient transformation of the generalized vehicle routing problem (Q1971986) (← links)
- An asymmetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation (Q2482754) (← links)
- Arc routing in a node routing environment (Q2571193) (← links)
- The mixed capacitated general routing problem under uncertainty (Q2629641) (← links)
- Recent results on Arc Routing Problems: An annotated bibliography (Q3057167) (← links)
- Graphical-structure-based models for routing problems (Q3799805) (← links)
- A transformation for the mixed general routing problem with turn penalties (Q5387391) (← links)
