Pages that link to "Item:Q2465940"
From MaRDI portal
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.
- A branch-and-cut-and-price algorithm for the multi-trip separate pickup and delivery problem with time windows at customers and facilities (Q2315637) (← links)
- A branch-and-cut algorithm for the capacitated profitable tour problem (Q2339836) (← links)
- Branch-and-price for staff rostering: an efficient implementation using generic programming and nested column generation (Q2355925) (← links)
- Improved branch-cut-and-price for capacitated vehicle routing (Q2398107) (← links)
- Upper and lower bounds for the vehicle-routing problem with private fleet and common carrier (Q2422737) (← links)
- Stabilized branch-price-and-cut for the commodity-constrained split delivery vehicle routing problem (Q2424767) (← links)
- Solving elementary shortest-path problems as mixed-integer programs (Q2454365) (← links)
- Formulations and exact algorithms for the vehicle routing problem with time windows (Q2468488) (← links)
- Vehicle routing problem with elementary shortest path based column generation (Q2489135) (← links)
- Constraint-specific recovery network for solving airline recovery problems (Q2654390) (← links)
- A new branch-and-price algorithm for the traveling tournament problem (Q2655609) (← links)
- A symmetry-free polynomial formulation of the capacitated vehicle routing problem (Q2664007) (← links)
- A branch-cut-and-price algorithm for the traveling salesperson problem with hotel selection (Q2664333) (← links)
- The rainbow Steiner tree problem (Q2669791) (← links)
- Exact Algorithms for the Vehicle Routing Problem with Soft Time Windows (Q2806989) (← links)
- A survey of resource constrained shortest path problems: exact solution approaches (Q2811308) (← links)
- The split delivery capacitated team orienteering problem (Q2811321) (← links)
- A branch-price-and-cut algorithm for the min-max \(k\)-vehicle windy rural postman problem (Q2811322) (← links)
- New state-space relaxations for solving the traveling salesman problem with time windows (Q2815450) (← links)
- Path-reduced costs for eliminating arcs in routing and scheduling (Q2899063) (← links)
- Exact Algorithms for Electric Vehicle-Routing Problems with Time Windows (Q2957464) (← links)
- Optimal routing with failure-independent path protection (Q3057139) (← links)
- Modeling and solving a multimodal transportation problem with flexible-time and scheduled services (Q3076017) (← links)
- Cutting planes for branch-and-price algorithms (Q3113514) (← links)
- An exact bidirectional<i>A</i><sup>⋆</sup>approach for solving resource-constrained shortest path problems (Q3120784) (← links)
- Dynamic programming algorithms for the elementary shortest path problem with resource constraints (Q3439161) (← links)
- New dynamic programming algorithms for the resource constrained elementary shortest path problem (Q3507646) (← links)
- Chvátal-Gomory Rank-1 Cuts Used in a Dantzig-Wolfe Decomposition of the Vehicle Routing Problem with Time Windows (Q3564367) (← links)
- Simple paths with exact and forbidden lengths (Q4562938) (← links)
- New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows (Q4599317) (← links)
- A Branch-and-Price-and-Cut Algorithm for the Cable-Routing Problem in Solar Power Plants (Q4995082) (← links)
- Branch-Cut-and-Price for the Robust Capacitated Vehicle Routing Problem with Knapsack Uncertainty (Q5003707) (← links)
- Improving Column Generation for Vehicle Routing Problems via Random Coloring and Parallelization (Q5086000) (← links)
- Stabilized Column Generation Via the Dynamic Separation of Aggregated Rows (Q5086013) (← links)
- Exact Branch-Price-and-Cut for a Hospital Therapist Scheduling Problem with Flexible Service Locations and Time-Dependent Location Capacity (Q5086014) (← links)
- Branch-and-Price Approaches for Real-Time Vehicle Routing with Picking, Loading, and Soft Time Windows (Q5106417) (← links)
- A rollout algorithm for the resource constrained elementary shortest path problem (Q5198052) (← links)
- A Pricing Algorithm for the Vehicle Routing Problem with Soft Time Windows (Q5850940) (← links)
- A column generation approach for the split delivery vehicle routing problem (Q5894493) (← links)
- Primal column generation framework for vehicle and crew scheduling problems (Q6087400) (← links)
- Selective arc‐ng pricing for vehicle routing (Q6092607) (← links)
- Linear edge costs and labeling algorithms: The case of the time‐dependent vehicle routing problem with time windows (Q6092647) (← links)
- A branch-and-price-and-cut algorithm for the truck-based drone delivery routing problem with time windows (Q6112842) (← links)
- Clique Inequalities Applied to the Vehicle Routing Problem with Time Windows (Q6160235) (← links)
- New Refinements for the Solution of Vehicle Routing Problems with Branch and Price (Q6160335) (← links)
- The complexity of branch-and-price algorithms for the capacitated vehicle routing problem with stochastic demands (Q6161273) (← links)
- Joint optimisation of drone routing and battery wear for sustainable supply chain development: a mixed-integer programming model based on blockchain-enabled fleet sharing (Q6167919) (← links)
- A branch‐and‐price‐based heuristic for the vehicle routing problem with two‐dimensional loading constraints and time windows (Q6187233) (← links)
- Nested column generation for split pickup vehicle routing problem with time windows and time-dependent demand (Q6551134) (← links)
- A multiphase dynamic programming algorithm for the shortest path problem with resource constraints (Q6554642) (← links)
