Pages that link to "Item:Q3818145"

The following pages link to A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited (Q3818145):

Displayed 24 items.

• The integer \(L\)-shaped method for stochastic integer programs with complete recourse (Q688927) ‎ (← links)
• Probabilistic graph-coloring in bipartite and split graphs (Q732320) ‎ (← links)
• Heuristic and lower bound for a stochastic location-routing problem (Q864014) ‎ (← links)
• Solving a generalized traveling salesperson problem with stochastic customers (Q868135) ‎ (← links)
• A hybrid scatter search for the probabilistic traveling salesman problem (Q878568) ‎ (← links)
• Algorithms for the universal and a priori TSP (Q924875) ‎ (← links)
• Dynamic VRP in pharmaceutical distribution -- a case study (Q926346) ‎ (← links)
• Route stability in vehicle routing decisions: a bi-objective approach using metaheuristics (Q926347) ‎ (← links)
• Diversified local search strategy under scatter search framework for the probabilistic traveling salesman problem (Q933505) ‎ (← links)
• Expanding neighborhood search-GRASP for the probabilistic traveling salesman problem (Q941025) ‎ (← links)
• Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines (Q958456) ‎ (← links)
• On the one-commodity pickup-and-delivery traveling salesman problem with stochastic demands (Q1013973) ‎ (← links)
• A hybrid multi-swarm particle swarm optimization algorithm for the probabilistic traveling salesman problem (Q1038278) ‎ (← links)
• Stochastic vehicle routing (Q1266554) ‎ (← links)
• A genetic algorithm for service level based vehicle scheduling (Q1268204) ‎ (← links)
• A stochastic and dynamic routing policy using branching processes with state dependent immigration (Q1278373) ‎ (← links)
• Probabilistic combinatorial optimization problems on graphs: A new domain in operational research (Q1390342) ‎ (← links)
• Routing problems: A bibliography (Q1908308) ‎ (← links)
• Extension of the 2-p-opt and 1-shift algorithms to the heterogeneous probabilistic traveling salesman problem (Q2432887) ‎ (← links)
• Aggregation for the probabilistic traveling salesman problem (Q2489311) ‎ (← links)
• On the probabilistic minimum coloring and minimum \(k\)-coloring (Q2489951) ‎ (← links)
• Hybrid metaheuristics for the vehicle routing problem with stochastic demands (Q2506217) ‎ (← links)
• New policies for the dynamic traveling salesman problem (Q5426977) ‎ (← links)
• Vertex-Uncertainty in Graph-Problems (Q5505652) ‎ (← links)