Pages that link to "Item:Q4285163"

The following pages link to The Delivery Man Problem and Cumulative Matroids (Q4285163):

Displaying 50 items.

• Network construction problems with due dates (Q319443) (← links)
• Maintenance scheduling of geographically distributed assets with prognostics information (Q319618) (← links)
• Mathematical formulations and exact algorithm for the multitrip cumulative capacitated single-vehicle routing problem (Q320880) (← links)
• 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)
• The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times (Q955327) (← links)
• An effective memetic algorithm for the cumulative capacitated vehicle routing problem (Q975996) (← links)
• A new formulation for the traveling deliveryman problem (Q1003469) (← links)
• An improved approximation ratio for the minimum latency problem (Q1290636) (← links)
• Solving the continuous flow-shop scheduling problem by metaheuristics. (Q1410624) (← 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 customers' waiting time in a vehicle routing problem with unit demands (Q1742415) (← links)
• Hybrid optimization methods for time-dependent sequencing problems (Q1751901) (← links)
• The demand weighted vehicle routing problem (Q1754023) (← links)
• An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem (Q1762031) (← links)
• Routing problems: A bibliography (Q1908308) (← 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)
• Tree optimization based heuristics and metaheuristics in network construction problems (Q2027081) (← links)
• A metaheuristic for the delivery man problem with time windows (Q2045024) (← links)
• The multi-depot \(k\)-traveling repairman problem (Q2091220) (← links)
• Solving the traveling delivery person problem with limited computational time (Q2103948) (← links)
• A constant-factor approximation for directed latency in quasi-polynomial time (Q2119400) (← links)
• Network construction/restoration problems: cycles and complexity (Q2168711) (← links)
• A POPMUSIC approach for the multi-depot cumulative capacitated vehicle routing problem (Q2174909) (← 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)
• A hybrid reactive GRASP heuristic for the risk-averse \(k\)-traveling repairman problem with profits (Q2289922) (← links)
• The risk-averse traveling repairman problem with profits (Q2317622) (← links)
• A multistart iterated local search for the multitrip cumulative capacitated vehicle routing problem (Q2340494) (← links)
• Approximating the \(k\)-traveling repairman problem with repair times (Q2457300) (← links)
• The routing open-shop problem on a network: complexity and approximation (Q2496075) (← links)
• A bicriteria scheduling with sequence-dependent setup times (Q2506355) (← links)
• On combining machine learning with decision making (Q2512894) (← links)
• Facets and valid inequalities for the time-dependent travelling salesman problem (Q2514741) (← links)
• Approximation algorithms for the a priori traveling repairman (Q2661528) (← links)
• An online optimization approach for post-disaster relief distribution with online blocked edges (Q2669638) (← links)
• (Q2861531) (← links)
• The Surgical Patient Routing Problem: A Central Planner Approach (Q2960361) (← links)
• Exact and Approximation Algorithms for the Expanding Search Problem (Q5084651) (← links)
• Heuristic solution approaches for the cumulative capacitated vehicle routing problem (Q5746676) (← links)
• A Constant-Factor Approximation for Directed Latency in Quasi-Polynomial Time (Q5874522) (← links)
• Skewed general variable neighborhood search for the cumulative capacitated vehicle routing problem (Q6066728) (← links)