The following pages link to A Priori Optimization (Q5753749):
Displaying 50 items.
- A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem (Q296861) (← links)
- On-time delivery probabilistic models for the vehicle routing problem with stochastic demands and time windows (Q320889) (← links)
- A branch-and-price approach for a multi-period vehicle routing problem (Q337422) (← links)
- Partial-route inequalities for the multi-vehicle routing problem with stochastic demands (Q406333) (← links)
- Scheduling with uncertainties on new computing platforms (Q535305) (← links)
- Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports (Q547122) (← links)
- The capacitated vehicle routing problem with stochastic demands and time windows (Q547129) (← 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)
- Optimal search path for service in the presence of disruptions (Q716349) (← links)
- Probabilistic graph-coloring in bipartite and split graphs (Q732320) (← links)
- Solving multiobjective vehicle routing problem with stochastic demand via evolutionary computation (Q856275) (← 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)
- 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)
- 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)
- Adaptive sample size and importance sampling in estimation-based local search for the probabilistic traveling salesman problem (Q1042104) (← links)
- Stochastic vehicle routing (Q1266554) (← links)
- A stochastic and dynamic routing policy using branching processes with state dependent immigration (Q1278373) (← links)
- Planning models for freight transportation (Q1278638) (← links)
- Probabilistic combinatorial optimization problems on graphs: A new domain in operational research (Q1390342) (← links)
- Faster rollout search for the vehicle routing problem with stochastic demands and restocking (Q1651700) (← links)
- The probabilistic orienteering problem (Q1652250) (← links)
- The probabilistic minimum dominating set problem (Q1686054) (← links)
- Solving the probabilistic TSP with ant colony optimization (Q1774631) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- On the probabilistic min spanning tree problem (Q1935723) (← links)
- An exact algorithm to solve the vehicle routing problem with stochastic demands under an optimal restocking policy (Q1991276) (← links)
- A concise guide to existing and emerging vehicle routing problem variants (Q2184128) (← links)
- Dynamic journeying under uncertainty (Q2253524) (← links)
- Estimation-based metaheuristics for the single vehicle routing problem with stochastic demands and customers (Q2350870) (← links)
- On the longest path of a randomly weighted tournament (Q2399297) (← links)
- Hybrid adaptive predictive control for the multi-vehicle dynamic pick-up and delivery problem based on genetic algorithms and fuzzy clustering (Q2483486) (← links)
- Aggregation for the probabilistic traveling salesman problem (Q2489311) (← links)
- On the probabilistic minimum coloring and minimum \(k\)-coloring (Q2489951) (← links)
- Approximation algorithms for the a priori traveling repairman (Q2661528) (← links)
- Arc routing under uncertainty: introduction and literature review (Q2669541) (← links)
- A taxonomical analysis, current methods and objectives on location-routing problems (Q2865162) (← links)
- A survey on combinatorial optimization in dynamic environments (Q2907959) (← links)
- Challenges and Advances in A Priori Routing (Q3564352) (← links)
- Recent Developments in Dynamic Vehicle Routing Systems (Q3564357) (← links)
- Exactly Solvable Hierarchical Optimization Problem Related to Percolation (Q4492384) (← links)
- A New Approach for Vehicle Routing with Stochastic Demand: Combining Route Assignment with Process Flexibility (Q5058032) (← links)
- Technical Note—Worst-Case Benefit of Restocking for the Vehicle Routing Problem with Stochastic Demands (Q5130499) (← links)
- Designing Networks with Good Equilibria under Uncertainty (Q5232329) (← links)
