Pages that link to "Item:Q4268861"
From MaRDI portal
The following pages link to Approximating Capacitated Routing and Delivery Problems (Q4268861):
Displaying 37 items.
- A hybrid heuristic approach for the multi-commodity pickup-and-delivery traveling salesman problem (Q322620) (← links)
- An experimental study of a hybrid genetic algorithm for the maximum traveling salesman problem (Q387104) (← links)
- Polynomial time approximation schemes for the constrained minimum spanning tree problem (Q442910) (← links)
- Heuristics for the mixed swapping problem (Q733528) (← links)
- Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems (Q833572) (← links)
- A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem (Q959510) (← links)
- On the one-commodity pickup-and-delivery traveling salesman problem with stochastic demands (Q1013973) (← links)
- Approximation algorithms for maximum latency and partial cycle cover (Q1015324) (← links)
- Better approximations for max TSP (Q1607064) (← links)
- Approximating the maximum quadratic assignment problem (Q1607075) (← links)
- An unpaired pickup and delivery problem with time dependent assignment costs: application in air cargo transportation (Q1695028) (← links)
- Polynomially solvable cases of the bipartite traveling salesman problem (Q1752819) (← links)
- Solving the shortest route cut and fill problem using simulated annealing (Q1869428) (← links)
- A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem (Q1926735) (← links)
- Cable tree wiring -- benchmarking solvers on a real-world scheduling problem with a variety of precedence constraints (Q2074672) (← links)
- The single line moving target traveling salesman problem with release times (Q2158632) (← links)
- The pyramidal capacitated vehicle routing problem (Q2270294) (← links)
- An approximation algorithm for vehicle routing with compatibility constraints (Q2294242) (← links)
- A truck scheduling problem arising in intermodal container transportation (Q2356036) (← links)
- An algorithm for the one commodity pickup and delivery traveling salesman problem with restricted depot (Q2357926) (← links)
- An improved randomized approximation algorithm for Max TSP (Q2576776) (← links)
- Mathematical formulations for a 1-full-truckload pickup-and-delivery problem (Q2630253) (← links)
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder) (Q2644426) (← links)
- Algorithms for capacitated vehicle routing (Q2784475) (← links)
- The multi-commodity pickup-and-delivery traveling salesman problem (Q2811323) (← links)
- Vehicle Routing Algorithms for Radially Escaping Targets (Q2949981) (← links)
- \(k\)-delivery traveling salesman problem on tree networks (Q2957510) (← links)
- Deliver or Hold: Approximation Algorithms for the Periodic Inventory Routing Problem (Q2969619) (← links)
- Balancing the stations of a self service “bike hire” system (Q3016180) (← links)
- Solving capacitated part-routing problems with setup times and costs: a Dantzig-Wolfe decomposition-based solution approach (Q3087842) (← links)
- The preemptive swapping problem on a tree (Q3100688) (← links)
- Bounds and Heuristics for Capacitated Routing Problems (Q3705193) (← links)
- Restricted delivery problems on a network (Q4347274) (← links)
- A branch‐and‐cut algorithm for the nonpreemptive swapping problem (Q5187945) (← links)
- Improving the approximation ratio for capacitated vehicle routing (Q5925635) (← links)
- The vehicle routing problem with pickups and deliveries on some special graphs (Q5957355) (← links)
- Bike rebalancing: how to find a balanced matching in the k center problem? (Q6565428) (← links)