Pages that link to "Item:Q2465940"

The following pages link to Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints (Q2465940):

Displaying 50 items.

• The shortest-path problem with resource constraints with \((k, 2)\)-loop elimination and its application to the capacitated arc-routing problem (Q296774) (← links)
• Efficient elementary and restricted non-elementary route pricing (Q297071) (← links)
• Integer programming formulations for the elementary shortest path problem (Q322844) (← links)
• The electric fleet size and mix vehicle routing problem with time windows and recharging stations (Q323018) (← links)
• A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands (Q337090) (← links)
• A branch-price-and-cut algorithm for the workover rig routing problem (Q339692) (← links)
• Efficient techniques for the multi-period vehicle routing problem with time windows within a branch and price framework (Q363544) (← links)
• Modeling and solving profitable location and distribution problems (Q375987) (← links)
• A set-covering based heuristic algorithm for the periodic vehicle routing problem (Q406496) (← links)
• Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints (Q439444) (← links)
• Exact methods for solving the elementary shortest and longest path problems (Q512936) (← links)
• A column generation algorithm for the vehicle routing problem with soft time windows (Q538287) (← links)
• An efficient column-generation-based algorithm for solving a pickup-and-delivery problem (Q547107) (← links)
• Heuristic and exact algorithms for the multi-pile vehicle routing problem (Q657060) (← links)
• Nested branch-and-price-and-cut for vehicle routing problems with multiple resource interdependencies (Q666967) (← links)
• Stabilized branch-and-price algorithms for vector packing problems (Q724108) (← links)
• The manpower allocation problem with time windows and job-teaming constraints: A branch-and-price approach (Q958447) (← links)
• Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming (Q958452) (← links)
• Real-time vehicle rerouting problems with time windows (Q958553) (← links)
• A branch-and-price algorithm for the vehicle routing problem with deliveries, selective pickups and time windows (Q976316) (← links)
• An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles (Q1040998) (← links)
• A branch-and-price algorithm for the minimum latency problem (Q1652580) (← links)
• A shortest-path-based approach for the stochastic knapsack problem with non-decreasing expected overfilling costs (Q1652714) (← links)
• A profit-maximization location-routing-pricing problem: a branch-and-price algorithm (Q1653368) (← links)
• The time-dependent capacitated profitable tour problem with time windows and precedence constraints (Q1681438) (← links)
• Route relaxations on GPU for vehicle routing problems (Q1751660) (← links)
• Branch-and-price-and-cut for a service network design and hub location problem (Q1752143) (← links)
• Asymmetry matters: dynamic half-way points in bidirectional labeling for solving shortest path problems with resource constraints faster (Q1753599) (← links)
• Bidirectional labeling in column-generation algorithms for pickup-and-delivery problems (Q1754114) (← links)
• A computational study of solution approaches for the resource constrained elementary shortest path problem (Q1945074) (← links)
• Finding the nucleolus of the vehicle routing game with time windows (Q1988954) (← links)
• A route decomposition approach for the single commodity split pickup and split delivery vehicle routing problem (Q2029263) (← links)
• Optimizing logistics routings in a network perspective of supply and demand nodes (Q2033331) (← links)
• A dynamic programming algorithm for solving the \(k\)-color shortest path problem (Q2047192) (← links)
• Robust drone selective routing in humanitarian transportation network assessment (Q2083969) (← links)
• Robust vehicle routing under uncertainty via branch-price-and-cut (Q2101653) (← links)
• Hybrid dynamic programming with bounding algorithm for the multi-profit orienteering problem (Q2158007) (← links)
• Exact and heuristic dynamic programming algorithms for the traveling salesman problem with flexible time windows (Q2174903) (← links)
• A generic exact solver for vehicle routing and related problems (Q2196312) (← links)
• Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network (Q2197321) (← links)
• On the exact solution of a large class of parallel machine scheduling problems (Q2197322) (← links)
• A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand (Q2208355) (← links)
• Branch-and-price for a multi-attribute technician routing and scheduling problem (Q2226497) (← links)
• The time-dependent vehicle routing problem with time windows and road-network information (Q2226499) (← links)
• A robust optimization approach with probe-able uncertainty (Q2239954) (← links)
• Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints (Q2256169) (← links)
• Exact solution of the soft-clustered vehicle-routing problem (Q2272311) (← links)
• Branch and price for the vehicle routing problem with discrete Split deliveries and time windows (Q2275800) (← links)
• Bi-criteria path problem with minimum length and maximum survival probability (Q2284640) (← links)
• Bidirectional labeling for solving vehicle routing and truck driver scheduling problems (Q2286924) (← links)