Pages that link to "Item:Q5689145"

The following pages link to Heuristic Bounds and Test Problem Generation for the Time-Dependent Traveling Salesman Problem (Q5689145):

Displaying 10 items.

• A new formulation for the traveling deliveryman problem (Q1003469) (← links)
• A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem (Q1266514) (← links)
• A comparison of algorithms for finding an efficient theme park tour (Q1741683) (← links)
• Hybrid optimization methods for time-dependent sequencing problems (Q1751901) (← links)
• The time dependent traveling salesman problem: polyhedra and algorithm (Q1947199) (← links)
• Models and algorithms for the traveling salesman problem with time-dependent service times (Q2294625) (← links)
• An enhanced lower bound for the time-dependent travelling salesman problem (Q2333147) (← links)
• Facets and valid inequalities for the time-dependent travelling salesman problem (Q2514741) (← links)
• An efficient two-phase metaheuristic algorithm for the time dependent traveling Salesman problem (Q5242274) (← links)
• The traveling salesman problem with cumulative costs (Q5287441) (← links)