Pages that link to "Item:Q4712107"

The following pages link to Time‐dependent traveling salesman problem–the deliveryman case (Q4712107):

Displaying 37 items.

• Mathematical formulations and exact algorithm for the multitrip cumulative capacitated single-vehicle routing problem (Q320880) (← links)
• Heuristics for the traveling repairman problem with profits (Q336352) (← links)
• The delivery man problem with time windows (Q429673) (← links)
• Natural and extended formulations for the time-dependent traveling salesman problem (Q496646) (← links)
• The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times (Q955327) (← links)
• A new formulation for the traveling deliveryman problem (Q1003469) (← links)
• Scheduling examinations to reduce second-order conflicts (Q1200827) (← links)
• A classification of formulations for the (time-dependent) traveling salesman problem (Q1388929) (← 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 branch-and-price algorithm for the minimum latency problem (Q1652580) (← links)
• A comparison of algorithms for finding an efficient theme park tour (Q1741683) (← links)
• Hybrid optimization methods for time-dependent sequencing problems (Q1751901) (← links)
• An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem (Q1762031) (← links)
• A dynamic vehicle routing problem with time-dependent travel times (Q1781571) (← 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)
• The time dependent traveling salesman problem: polyhedra and algorithm (Q1947199) (← links)
• The multi-depot \(k\)-traveling repairman problem (Q2091220) (← links)
• Solving the traveling delivery person problem with limited computational time (Q2103948) (← links)
• The arc-item-load and related formulations for the cumulative vehicle routing problem (Q2172084) (← 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)
• Facets and valid inequalities for the time-dependent travelling salesman problem (Q2514741) (← links)
• Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery (Q2672110) (← links)
• A branch-cut-and-price algorithm for the cumulative capacitated vehicle routing problem (Q2688881) (← links)
• The Surgical Patient Routing Problem: A Central Planner Approach (Q2960361) (← links)
• An efficient two-phase metaheuristic algorithm for the time dependent traveling Salesman problem (Q5242274) (← links)
• Heuristic solution approaches for the cumulative capacitated vehicle routing problem (Q5746676) (← links)
• Skewed general variable neighborhood search for the cumulative capacitated vehicle routing problem (Q6066728) (← links)
• Improving a state‐of‐the‐art heuristic for the minimum latency problem with data mining (Q6070880) (← links)
• A branch-and-bound approach for a vehicle routing problem with customer costs (Q6114901) (← links)
• A hybrid and adaptive evolutionary approach for multitask optimization of post-disaster traveling salesman and repairman problems (Q6568437) (← links)
• Arc-dependent networks: theoretical insights and a computational study (Q6588520) (← links)
• The multiobjective traveling salesman-repairman problem with profits: design and implementation of a variable neighborhood descent algorithm for a real scenario (Q6609709) (← links)