Pages that link to "Item:Q1941380"
From MaRDI portal
The following pages link to Optimal solutions for routing problems with profits (Q1941380):
Displayed 21 items.
- An adaptive large neighborhood search algorithm for a selective and periodic inventory routing problem (Q297272) (← links)
- Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests (Q322826) (← links)
- Orienteering problem: a survey of recent variants, solution approaches and applications (Q323527) (← links)
- The dynamic multiperiod vehicle routing problem with probabilistic information (Q337038) (← links)
- Optimal interval scheduling with a resource constraint (Q337149) (← links)
- Solving the orienteering problem with time windows via the pulse framework (Q337360) (← links)
- The capacitated team orienteering problem with incomplete service (Q375974) (← links)
- A profit-maximization location-routing-pricing problem: a branch-and-price algorithm (Q1653368) (← links)
- The bi-objective insular traveling salesman problem with maritime and ground transportation costs (Q1653384) (← links)
- The vehicle routing problem with service level constraints (Q1681277) (← links)
- Formulations for the orienteering problem with additional constraints (Q1686508) (← links)
- A generic exact solver for vehicle routing and related problems (Q2196312) (← links)
- Directed weighted improper coloring for cellular channel allocation (Q2255043) (← links)
- The distance constrained multiple vehicle traveling purchaser problem (Q2256245) (← links)
- The multi-vehicle profitable pickup and delivery problem (Q2362250) (← links)
- Optimal duty rostering for toll enforcement inspectors (Q2398431) (← links)
- A survey on matheuristics for routing problems (Q2513752) (← links)
- A hybrid metaheuristic for smart waste collection problems with workload concerns (Q2669623) (← links)
- Trip planning for visitors in a service system with capacity constraints (Q2676374) (← links)
- Constant-factor approximation algorithms for a series of combinatorial routing problems based on the reduction to the asymmetric traveling salesman problem (Q2689288) (← links)
- The split delivery capacitated team orienteering problem (Q2811321) (← links)