Pages that link to "Item:Q4147830"

The following pages link to The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling (Q4147830):

Displaying 40 items.

• Cable tree wiring -- benchmarking solvers on a real-world scheduling problem with a variety of precedence constraints (Q2074672) (← links)
• Dealing with time in the multiple traveling salespersons problem with moving targets (Q2155136) (← links)
• The arc-item-load and related formulations for the cumulative vehicle routing problem (Q2172084) (← links)
• Weighted online minimum latency problem with edge uncertainty (Q2239843) (← links)
• Arc flow formulations based on dynamic programming: theoretical foundations and applications (Q2239929) (← links)
• Models and algorithms for the traveling salesman problem with time-dependent service times (Q2294625) (← links)
• A review of four decades of time-dependent scheduling: main results, new topics, and open problems (Q2305016) (← links)
• An enhanced lower bound for the time-dependent travelling salesman problem (Q2333147) (← links)
• A multistart iterated local search for the multitrip cumulative capacitated vehicle routing problem (Q2340494) (← links)
• A multi-objective tabu search for a single-machine scheduling problem with sequence-dependent setup times (Q2432854) (← links)
• Heuristics for minimizing maximum lateness on a single machine with family-dependent set-up times (Q2462548) (← links)
• Reformulation by discretization: application to economic lot sizing (Q2465954) (← links)
• Minimizing total tardiness in a scheduling problem with a learning effect (Q2466609) (← links)
• Formulations and exact algorithms for the vehicle routing problem with time windows (Q2468488) (← links)
• A branch-and-cut algorithm for a production scheduling problem with sequence-dependent and time-dependent setup times (Q2471235) (← links)
• A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem (Q2475842) (← links)
• Time-dependent travelling salesman problem. (Q2476429) (← links)
• On the capacitated concentrator location problem: a reformulation by discretization (Q2496022) (← links)
• Facets and valid inequalities for the time-dependent travelling salesman problem (Q2514741) (← links)
• Approximation algorithms for the a priori traveling repairman (Q2661528) (← links)
• On path ranking in time-dependent graphs (Q2669544) (← links)
• An online optimization approach for post-disaster relief distribution with online blocked edges (Q2669638) (← links)
• Routing multiple work teams to minimize latency in post-disaster road network restoration (Q2670582) (← 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)
• An integer programming approach for the time-dependent TSP (Q2883581) (← links)
• The Surgical Patient Routing Problem: A Central Planner Approach (Q2960361) (← links)
• A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem (Q3057116) (← links)
• Almost sure asymptotic optimality for online routing and machine scheduling problems (Q3057128) (← links)
• Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems (Q3564362) (← links)
• Optimierung des Schülerverkehrs durch gemischt ganzzahlige Programmierung (Q4190405) (← links)
• Two-machine flowshop scheduling to minimize total tardiness (Q4352599) (← links)
• Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times (Q4394265) (← links)
• An efficient two-phase metaheuristic algorithm for the time dependent traveling Salesman problem (Q5242274) (← links)
• Skewed general variable neighborhood search for the cumulative capacitated vehicle routing problem (Q6066728) (← links)
• Minimizing total weighted latency in home healthcare routing and scheduling with patient prioritization (Q6073272) (← links)
• Tight lower bounds for the traveling salesman problem with draft limits (Q6109566) (← links)
• The travelling salesman problem with positional consistency constraints: an application to healthcare services (Q6167660) (← links)
• A bi-criteria moving-target travelling salesman problem under uncertainty (Q6167752) (← links)
• Optimization of interception plan for rectilinearly moving targets (Q6200426) (← links)