Pages that link to "Item:Q1003469"
From MaRDI portal
The following pages link to A new formulation for the traveling deliveryman problem (Q1003469):
Displayed 31 items.
- The delivery man problem with time windows (Q429673) (← links)
- Exact and heuristic solutions to minimize total waiting time in the blood products distribution problem (Q447561) (← links)
- Natural and extended formulations for the time-dependent traveling salesman problem (Q496646) (← links)
- Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem (Q548680) (← links)
- An integer programming approach for the time-dependent traveling salesman problem with time windows (Q1651554) (← links)
- A meta-heuristic based goal-selection strategy for mobile robot search in an unknown environment (Q1652330) (← links)
- A branch-and-price algorithm for the minimum latency problem (Q1652580) (← links)
- Minimizing latency in post-disaster road clearance operations (Q1740563) (← links)
- Minimizing customers' waiting time in a vehicle routing problem with unit demands (Q1742415) (← links)
- Hybrid optimization methods for time-dependent sequencing problems (Q1751901) (← links)
- A comparison of three metaheuristics for the workover rig routing problem (Q1926698) (← links)
- The single vehicle routing problem with toll-by-weight scheme: a branch-and-bound approach (Q1926737) (← links)
- A simple and effective metaheuristic for the minimum latency problem (Q1926884) (← links)
- Variable neighborhood search for the travelling deliveryman problem (Q1942008) (← links)
- The time dependent traveling salesman problem: polyhedra and algorithm (Q1947199) (← links)
- The multi-depot \(k\)-traveling repairman problem (Q2091220) (← links)
- Solving the traveling delivery person problem with limited computational time (Q2103948) (← links)
- The arc-item-load and related formulations for the cumulative vehicle routing problem (Q2172084) (← links)
- Weighted online minimum latency problem with edge uncertainty (Q2239843) (← links)
- Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints (Q2256169) (← links)
- An adaptive large neighborhood search approach for multiple traveling repairman problem with profits (Q2273692) (← links)
- A hybrid reactive GRASP heuristic for the risk-averse \(k\)-traveling repairman problem with profits (Q2289922) (← links)
- On combining machine learning with decision making (Q2512894) (← links)
- Facets and valid inequalities for the time-dependent travelling salesman problem (Q2514741) (← links)
- Routing multiple work teams to minimize latency in post-disaster road network restoration (Q2670582) (← links)
- An optimization model for the vehicle routing problem with practical three-dimensional loading constraints (Q2862156) (← links)
- An integer programming approach for the time-dependent TSP (Q2883581) (← links)
- Exact and Approximation Algorithms for the Expanding Search Problem (Q5084651) (← links)
- Multirobot search for a stationary object placed in a known environment with a combination of GRASP and VND (Q6070871) (← links)
- Improving a state‐of‐the‐art heuristic for the minimum latency problem with data mining (Q6070880) (← links)
- Minimizing total weighted latency in home healthcare routing and scheduling with patient prioritization (Q6073272) (← links)