Pages that link to "Item:Q2884530"

The following pages link to Solution of a Min-Max Vehicle Routing Problem (Q2884530):

Displaying 26 items.

• Mathematical formulations and exact algorithm for the multitrip cumulative capacitated single-vehicle routing problem (Q320880) (← links)
• A min-max vehicle routing problem with split delivery and heterogeneous demand (Q376008) (← links)
• Improved load balancing and resource utilization for the skill vehicle routing problem (Q395849) (← links)
• An active set smoothing method for solving unconstrained minimax problems (Q779576) (← links)
• A truncated aggregate smoothing Newton method for minimax problems (Q979271) (← links)
• A metaheuristic for the min-max windy rural postman problem with K vehicles (Q993701) (← links)
• The effect of the asymmetry of road transportation networks on the traveling salesman problem (Q1762144) (← links)
• Minimum makespan vehicle routing problem with compatibility constraints (Q2011596) (← links)
• Efficient computation of tolerances in the sensitivity analysis of combinatorial bottleneck problems (Q2089667) (← links)
• An overview of graph covering and partitioning (Q2142633) (← links)
• Hybrid search with neighborhood reduction for the multiple traveling salesman problem (Q2146986) (← links)
• A novel feature-based approach to characterize algorithm performance for the traveling salesperson problem (Q2248551) (← links)
• Gossip algorithms for heterogeneous multi-vehicle routing problems (Q2252974) (← links)
• Toward solving the Steiner travelling salesman problem on urban road maps using the branch decomposition of graphs (Q2282284) (← links)
• An approximation algorithm for vehicle routing with compatibility constraints (Q2294242) (← links)
• A multistart iterated local search for the multitrip cumulative capacitated vehicle routing problem (Q2340494) (← links)
• A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems (Q2488912) (← links)
• Multilocus consensus genetic maps (MCGM): Formulation, algorithms, and results (Q2490509) (← links)
• A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem (Q2514732) (← links)
• Min-Max vs. Min-Sum vehicle routing: a worst-case analysis (Q2629640) (← links)
• Using \(\ell^p\)-norms for fairness in combinatorial optimisation (Q2664297) (← links)
• An active set strategy to address the ill-conditioning of smoothing methods for solving finite linear minimax problems (Q2687444) (← links)
• Improved approximation algorithms for some min-max postmen cover problems with applications to the min-max subtree cover (Q2699031) (← links)
• Memetic algorithm-based path generation for multiple Dubins vehicles performing remote tasks (Q5026663) (← links)
• A matheuristic for the MinMax capacitated open vehicle routing problem (Q6066715) (← links)
• Memetic search for the minmax multiple traveling salesman problem with single and multiple depots (Q6167324) (← links)