Pages that link to "Item:Q4305756"

The following pages link to A Priori Optimization of the Probabilistic Traveling Salesman Problem (Q4305756):

Displaying 41 items.

• Solving a multi-objective dynamic stochastic districting and routing problem with a co-evolutionary algorithm (Q342250) (← links)
• Exact algorithms on reliable routing problems under uncertain topology using aggregation techniques for exponentially many scenarios (Q513625) (← links)
• An integer \(L\)-shaped algorithm for the dial-a-ride problem with stochastic customer delays (Q540153) (← links)
• Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports (Q547122) (← links)
• The traveling purchaser problem with stochastic prices: exact and approximate algorithms (Q621973) (← links)
• Local search heuristics for the probabilistic dial-a-ride problem (Q657055) (← links)
• Local search for the probabilistic traveling salesman problem: correction to the 2-p-opt and 1-shift algorithms (Q707147) (← links)
• The dynamic dispatch waves problem for same-day delivery (Q724132) (← 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)
• 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)
• Estimation-based metaheuristics for the probabilistic traveling salesman problem (Q976010) (← links)
• On the one-commodity pickup-and-delivery traveling salesman problem with stochastic demands (Q1013973) (← links)
• A survey on metaheuristics for stochastic combinatorial optimization (Q1024034) (← links)
• A hybrid multi-swarm particle swarm optimization algorithm for the probabilistic traveling salesman problem (Q1038278) (← links)
• Stochastic vehicle routing (Q1266554) (← links)
• The probabilistic orienteering problem (Q1652250) (← links)
• The Benders decomposition algorithm: a literature review (Q1751891) (← links)
• Solving the probabilistic TSP with ant colony optimization (Q1774631) (← links)
• Routing problems: A bibliography (Q1908308) (← links)
• The probabilistic travelling salesman problem with crowdsourcing (Q2146980) (← links)
• Stochastic hub location problems with Bernoulli demands (Q2147142) (← links)
• A cutting plane method for risk-constrained traveling salesman problem with random arc costs (Q2274859) (← links)
• Extension of the 2-p-opt and 1-shift algorithms to the heterogeneous probabilistic traveling salesman problem (Q2432887) (← links)
• Solving the vehicle routing problem with stochastic demands using the cross-entropy method (Q2485932) (← links)
• Aggregation for the probabilistic traveling salesman problem (Q2489311) (← links)
• Improving the Integer L-Shaped Method (Q2830952) (← links)
• Challenges and Advances in A Priori Routing (Q3564352) (← links)
• EFFICIENT NEIGHBORHOOD SEARCH FOR THE PROBABILISTIC MULTI-VEHICLE PICKUP AND DELIVERY PROBLEM (Q3580197) (← links)
• Robust Multiperiod Vehicle Routing Under Customer Order Uncertainty (Q4994141) (← links)
• The double exponential runtime is tight for 2-stage stochastic ILPs (Q5918430) (← links)
• The double exponential runtime is tight for 2-stage stochastic ILPs (Q5925653) (← links)
• A multiple-depot, multiple-vehicle, location-routing problem with stochastically processed demands (Q5953168) (← links)
• A vehicle routing problem with multiple service agreements (Q6066197) (← links)
• Solving the multidepot vehicle routing problem with limited depot capacity and stochastic demands (Q6070975) (← links)
• Stochastic crowd shipping last-mile delivery with correlated marginals and probabilistic constraints (Q6106980) (← links)
• Asymmetric probabilistic minimum-cost Hamiltonian cycle problem considering arc and vertex failures (Q6109290) (← links)
• Routing Courier Delivery Services with Urgent Demand (Q6160118) (← links)