Pages that link to "Item:Q3818145"
From MaRDI portal
The following pages link to A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited (Q3818145):
Displaying 50 items.
- A branch-and-price approach for a multi-period vehicle routing problem (Q337422) (← links)
- Solving a multi-objective dynamic stochastic districting and routing problem with a co-evolutionary algorithm (Q342250) (← links)
- Partial-route inequalities for the multi-vehicle routing problem with stochastic demands (Q406333) (← links)
- Risky traveling salesman problem (Q418099) (← 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)
- 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)
- The integer \(L\)-shaped method for stochastic integer programs with complete recourse (Q688927) (← links)
- The indefinite period traveling salesman problem (Q724039) (← links)
- The dynamic dispatch waves problem for same-day delivery (Q724132) (← links)
- A new bi-objective periodic vehicle routing problem with maximization market share in an uncertain competitive environment (Q725797) (← links)
- Probabilistic graph-coloring in bipartite and split graphs (Q732320) (← links)
- A constant approximation algorithm for the uniform a priori capacitated vehicle routing problem with unit demands (Q783689) (← 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)
- Different initial solution generators in genetic algorithms for solving the probabilistic traveling salesman problem (Q961563) (← 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 hybrid multi-swarm particle swarm optimization algorithm for the probabilistic traveling salesman problem (Q1038278) (← links)
- Heuristics for the stochastic Eulerian tour problem (Q1043339) (← 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)
- The probabilistic orienteering problem (Q1652250) (← links)
- The probabilistic minimum dominating set problem (Q1686054) (← links)
- Minimizing worst-case and average-case makespan over scenarios (Q1702655) (← links)
- The dynamic bowser routing problem (Q1711454) (← links)
- A general framework for assessing the value of social data for disaster response logistics planning (Q1750460) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- On the probabilistic min spanning tree problem (Q1935723) (← links)
- Routing problem for unmanned aerial vehicle patrolling missions -- a progressive hedging algorithm (Q2146967) (← links)
- The probabilistic travelling salesman problem with crowdsourcing (Q2146980) (← links)
- Stochastic hub location problems with Bernoulli demands (Q2147142) (← links)
- Technical note: the expected length of an orderly path (Q2158636) (← links)
- A concise guide to existing and emerging vehicle routing problem variants (Q2184128) (← links)
- A customized genetic algorithm for bi-objective routing in a dynamic network (Q2242262) (← links)
- A cutting plane method for risk-constrained traveling salesman problem with random arc costs (Q2274859) (← links)
- Hybrid metaheuristics for stochastic constraint programming (Q2342607) (← links)
- Estimation-based metaheuristics for the single vehicle routing problem with stochastic demands and customers (Q2350870) (← 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)