Pages that link to "Item:Q5491457"
From MaRDI portal
The following pages link to Approximations for minimum and min-max vehicle routing problems (Q5491457):
Displaying 50 items.
- Improved approximation algorithms for some min-max and minimum cycle cover problems (Q344767) (← links)
- A min-max vehicle routing problem with split delivery and heterogeneous demand (Q376008) (← links)
- Improved approximation algorithms for the MIN-MAX tree cover and bounded tree cover problems (Q517802) (← links)
- Covering directed graphs by in-trees (Q626455) (← links)
- An analysis of the extended Christofides heuristic for the \(k\)-depot TSP (Q635520) (← links)
- Min-max tree covers of graphs. (Q703232) (← links)
- Approximation results for a min-max location-routing problem (Q765374) (← links)
- An active set smoothing method for solving unconstrained minimax problems (Q779576) (← links)
- Set covering in fuel-considered vehicle routing problems (Q896127) (← links)
- Approximation results for the weighted \(P_4\) partition problem (Q935845) (← links)
- Approximation hardness of min-max tree covers (Q974986) (← links)
- An effective memetic algorithm for the cumulative capacitated vehicle routing problem (Q975996) (← links)
- A truncated aggregate smoothing Newton method for minimax problems (Q979271) (← links)
- Scheduling cleaning activities on trains by minimizing idle times (Q1707827) (← links)
- Min-max cover of a graph with a small number of parts (Q1751107) (← links)
- Vehicle routing with subtours (Q2010917) (← links)
- Minimum makespan vehicle routing problem with compatibility constraints (Q2011596) (← links)
- The \(m\)-Steiner traveling salesman problem with online edge blockages (Q2045027) (← links)
- Approximation algorithms for some extensions of the maximum profit routing problem (Q2105889) (← links)
- An overview of graph covering and partitioning (Q2142633) (← links)
- Distance constrained vehicle routing problem to minimize the total cost: algorithms and complexity (Q2156303) (← links)
- Approximation algorithms for some min-max postmen cover problems (Q2241210) (← links)
- Gossip algorithms for heterogeneous multi-vehicle routing problems (Q2252974) (← links)
- New LP relaxations for minimum cycle/path/tree cover problems (Q2283007) (← links)
- An approximation algorithm for vehicle routing with compatibility constraints (Q2294242) (← links)
- Continuous graph partitioning for camera network surveillance (Q2342775) (← links)
- Better approximability results for min-max tree/cycle/path cover problems (Q2420656) (← links)
- Approximation algorithms for distance constraint sweep coverage with base stations (Q2424716) (← links)
- Min-Max vs. Min-Sum vehicle routing: a worst-case analysis (Q2629640) (← links)
- An efficient inexact Newton-CG algorithm for the smallest enclosing ball problem of large dimensions (Q2630834) (← links)
- Approximation algorithms for the min-max clustered \(k\)-traveling salesmen problems (Q2676463) (← links)
- Polynomial-time data reduction for weighted problems beyond additive goal functions (Q2685700) (← links)
- Approximation algorithms for multi-vehicle stacker crane problems (Q2687683) (← links)
- Improved approximation algorithms for some min-max postmen cover problems with applications to the min-max subtree cover (Q2699031) (← links)
- Capacitated vehicle routing with nonuniform speeds (Q2800377) (← links)
- A 3/2-approximation algorithm for the multiple TSP with a fixed number of depots (Q2802244) (← links)
- Approximation Algorithms for Generalized Bounded Tree Cover (Q2803829) (← links)
- Approximation algorithms for distance constrained vehicle routing problems (Q2892157) (← links)
- Capacitated Vehicle Routing with Non-uniform Speeds (Q3009766) (← links)
- Approximation results for min-max path cover problems in vehicle routing (Q3065634) (← links)
- Improved Approximation Algorithms for the Min-Max Tree Cover and Bounded Tree Cover Problems (Q3088103) (← links)
- Approximation Algorithms for Conflict-Free Vehicle Routing (Q3092267) (← links)
- Improved Approximation Algorithms for Min-Max and Minimum Vehicle Routing Problems (Q3196380) (← links)
- Approximation Algorithms for Multi-Robot Patrol-Scheduling with Min-Max Latency (Q3381954) (← links)
- Covering Directed Graphs by In-Trees (Q3511356) (← links)
- Approximation algorithm for distance constraint sweep coverage without predetermined base stations (Q4554549) (← links)
- Computational Science – ICCS 2005 (Q5709516) (← links)
- Heuristic solution approaches for the cumulative capacitated vehicle routing problem (Q5746676) (← links)
- Approximation algorithms for some min-max and minimum stacker crane cover problems (Q5918581) (← links)
- New approximation algorithms for the rooted budgeted cycle cover problem (Q5918725) (← links)
