Pages that link to "Item:Q4147830"
From MaRDI portal
The following pages link to The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling (Q4147830):
Displaying 50 items.
- An integrated approach for earthwork allocation, sequencing and routing (Q296873) (← links)
- The traveling salesman problem with time-dependent service times (Q320683) (← links)
- Mathematical formulations and exact algorithm for the multitrip cumulative capacitated single-vehicle routing problem (Q320880) (← links)
- Multiple asymmetric traveling salesmen problem with and without precedence constraints: performance comparison of alternative formulations (Q337114) (← links)
- Load-dependent and precedence-based models for pickup and delivery problems (Q342036) (← links)
- Time-dependent routing problems: a review (Q342083) (← links)
- Integrated ant colony and tabu search approach for time dependent vehicle routing problems with simultaneous pickup and delivery (Q405689) (← links)
- The delivery man problem with time windows (Q429673) (← links)
- Natural and extended formulations for the time-dependent traveling salesman problem (Q496646) (← links)
- Fitness landscape analysis for the no-wait flow-shop scheduling problem (Q519086) (← links)
- Models for a traveling purchaser problem with additional side-constraints (Q709202) (← links)
- A minmax regret version of the time-dependent shortest path problem (Q724002) (← links)
- Looking ahead with the pilot method (Q816423) (← links)
- A tabu search heuristic for a sequence-dependent and time-dependent scheduling problem on a single machine (Q835634) (← links)
- A controlled search simulated annealing method for the single machine weighted tardiness problem (Q918386) (← links)
- An iterated local search algorithm for the time-dependent vehicle routing problem with time windows (Q951117) (← 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)
- Dynamic programming and decomposition approaches for the single machine total tardiness problem (Q1092805) (← links)
- Real-time scheduling of an automated manufacturing center (Q1116883) (← links)
- Convergent duality for the traveling salesman problem (Q1178716) (← links)
- An analytical comparison of different formulations of the travelling salesman problem (Q1181739) (← links)
- A time indexed formulation of non-preemptive single machine scheduling problems (Q1196724) (← links)
- A tool-change scheduling model for machining centres (Q1258683) (← links)
- A survey of algorithms for the single machine total weighted tardiness scheduling problem (Q1262207) (← links)
- One machine scheduling to minimize expected mean tardiness. II (Q1332812) (← links)
- Scheduling in a sequence dependent setup environment with genetic search (Q1342322) (← 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)
- Layered graph approaches for combinatorial optimization problems (Q1628112) (← links)
- An integer programming approach for the time-dependent traveling salesman problem with time windows (Q1651554) (← links)
- The traveling purchaser problem with time-dependent quantities (Q1652259) (← links)
- A branch-and-price algorithm for the minimum latency problem (Q1652580) (← links)
- Extended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem (Q1683126) (← links)
- Scheduling with time-dependent discrepancy times (Q1702735) (← links)
- Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem (Q1703462) (← links)
- Minimizing latency in post-disaster road clearance operations (Q1740563) (← 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)
- Some concepts of stability analysis in combinatorial optimization (Q1805456) (← links)
- Using short-term memory to minimize the weighted number of late jobs on a single machine. (Q1812007) (← links)
- A decomposition algorithm for the single machine total tardiness problem (Q1838424) (← links)
- Vehicle dispatching with time-dependent travel times (Q1869392) (← links)
- Improving the performance of enumerative search methods. I: Exploiting structure and intelligence (Q1892667) (← links)
- A simple and effective metaheuristic for the minimum latency problem (Q1926884) (← links)
- The time dependent traveling salesman problem: polyhedra and algorithm (Q1947199) (← links)
- Perspectives on integer programming for time-dependent models (Q2001858) (← links)
- A branch and cut algorithm for the time-dependent profitable tour problem with resource constraints (Q2029262) (← links)
