Pages that link to "Item:Q375984"
From MaRDI portal
The following pages link to Modeling and solving the mixed capacitated general routing problem (Q375984):
Displaying 16 items.
- Two-phase branch-and-cut for the mixed capacitated general routing problem (Q319006) (← links)
- The bi-objective mixed capacitated general routing problem with different route balance criteria (Q322701) (← links)
- An efficiency-based path-scanning heuristic for the capacitated arc routing problem (Q1634089) (← links)
- Optimally solving the joint order batching and picker routing problem (Q1683118) (← links)
- The periodic rural postman problem with irregular services on mixed graphs (Q1734335) (← links)
- The undirected capacitated general routing problem with profits (Q1752868) (← links)
- Branch-price-and-cut for the mixed capacitated general routing problem with time windows (Q1754228) (← links)
- Ten years of feasibility pump, and counting (Q2329705) (← links)
- The mixed capacitated general routing problem under uncertainty (Q2629641) (← links)
- A dynamic multi-period general routing problem arising in postal service and parcel delivery systems (Q2668612) (← links)
- Asymmetric Multidepot Vehicle Routing Problems: Valid Inequalities and a Branch-and-Cut Algorithm (Q4994165) (← links)
- Arc routing problems: A review of the past, present, and future (Q6087068) (← links)
- Secure and efficient routing on nodes, edges, and arcs of simple‐graphs and of multi‐graphs (Q6092634) (← links)
- The mixed capacitated general routing problem with <scp>time‐dependent</scp> demands (Q6092639) (← links)
- A parameterized lower bounding method for the open capacitated arc routing problem (Q6491347) (← links)
- An updated annotated bibliography on arc routing problems (Q6496350) (← links)