Pages that link to "Item:Q3993633"
From MaRDI portal
The following pages link to Special cases of traveling salesman and repairman problems with time windows (Q3993633):
Displaying 50 items.
- Solving the traveling repairman problem on a line with general processing times and deadlines (Q319440) (← links)
- Mathematical formulations and exact algorithm for the multitrip cumulative capacitated single-vehicle routing problem (Q320880) (← links)
- Cyclic inventory routing in a line-shaped network (Q322426) (← links)
- Improved algorithms for joint optimization of facility locations and network connections (Q322548) (← links)
- Finding optimal tour schedules on transportation paths under extended time window constraints (Q341462) (← links)
- A reclaimer scheduling problem arising in coal stockyard management (Q341465) (← links)
- Minimizing sequence-dependent setup costs in feeding batch processes under due date restrictions (Q398878) (← links)
- Routing open shop and flow shop scheduling problems (Q421573) (← links)
- Approximation algorithms for single vehicle scheduling problems with release and service times on a tree or cycle (Q428867) (← links)
- The delivery man problem with time windows (Q429673) (← links)
- Emergency path restoration problems (Q435733) (← links)
- Algorithms for the on-line quota traveling salesman problem (Q834904) (← links)
- A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem (Q857330) (← links)
- How to collect balls moving in the Euclidean plane (Q860383) (← links)
- A \(\frac{5}{3}\)-approximation algorithm for scheduling vehicles on a path with release and handling times (Q1007578) (← links)
- Vehicle routing problems on a line-shaped network with release time constraints (Q1015302) (← links)
- Vehicle scheduling with combinable delivery and pickup operations (Q1043247) (← links)
- An improved approximation ratio for the minimum latency problem (Q1290636) (← links)
- 2-approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times. (Q1406038) (← links)
- Scheduling electric vehicles and locating charging stations on a path (Q1617297) (← links)
- The Steiner traveling salesman problem with online advanced edge blockages (Q1651622) (← links)
- A branch-and-price algorithm for the minimum latency problem (Q1652580) (← links)
- A performance study on multi improvement neighborhood search strategy (Q1687681) (← links)
- Minimizing customers' waiting time in a vehicle routing problem with unit demands (Q1742415) (← links)
- Patrolling security games: definition and algorithms for solving large instances with single patroller and single intruder (Q1761280) (← links)
- A faster 2-approximation algorithm for the minmax \(p\)-traveling salesmen problem on a tree (Q1827840) (← links)
- An approximability result of the multi-vehicle scheduling problem on a path with release and handling times (Q1884949) (← links)
- Linear time approximation schemes for vehicle scheduling problems (Q1887080) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- A comparison of three metaheuristics for the workover rig routing problem (Q1926698) (← links)
- A simple and effective metaheuristic for the minimum latency problem (Q1926884) (← links)
- Spider covers and their applications (Q1935978) (← links)
- A truck and drones model for last-mile delivery: a mathematical model and heuristic approach (Q1988950) (← links)
- Tree optimization based heuristics and metaheuristics in network construction problems (Q2027081) (← links)
- A metaheuristic for the delivery man problem with time windows (Q2045024) (← links)
- Improved algorithms for single vehicle scheduling on tree/cycle networks (Q2051909) (← links)
- Vehicle scheduling problems with two agents on a line (Q2099389) (← links)
- A logic-based Benders decomposition method for the multi-trip traveling repairman problem with drones (Q2147137) (← links)
- Routing and scheduling problems with two agents on a line-shaped network (Q2149871) (← links)
- The single line moving target traveling salesman problem with release times (Q2158632) (← links)
- Network construction/restoration problems: cycles and complexity (Q2168711) (← links)
- Modeling emergency response operations: a theory building survey (Q2177817) (← links)
- Data mule scheduling on a path with handling time and time span constraints (Q2228361) (← links)
- Optimally solving a versatile traveling salesman problem on tree networks with soft due dates and multiple congestion scenarios (Q2294628) (← links)
- Combining traveling salesman and traveling repairman problems: a multi-objective approach based on multiple scenarios (Q2329723) (← links)
- A multistart iterated local search for the multitrip cumulative capacitated vehicle routing problem (Q2340494) (← links)
- Approximation algorithms for the traveling repairman and speeding deliveryman problems (Q2428683) (← links)
- New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP (Q2466786) (← links)
- Approximating a vehicle scheduling problem with time windows and handling times (Q2481960) (← links)
- How to whack moles (Q2503357) (← links)
