Accelerated label setting algorithms for the elementary resource constrained shortest path problem

From MaRDI portal
Revision as of 07:55, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2583711

DOI10.1016/J.ORL.2004.11.011zbMath1080.90077OpenAlexW2054151210MaRDI QIDQ2583711

Irina Dumitrescu, Natashia Boland, John C. Dethridge

Publication date: 18 January 2006

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2004.11.011




Related Items (60)

Column generation algorithms for bi-objective combinatorial optimization problems with a min-max objectiveThree-stage approaches for optimizing some variations of the resource constrained shortest-path sub-problem in a column generation contextThe shortest-path problem with resource constraints with \((k, 2)\)-loop elimination and its application to the capacitated arc-routing problemEfficient elementary and restricted non-elementary route pricingFreight railway operator timetabling and engine schedulingA column generation approach for a multi-attribute vehicle routing problemTwo exact algorithms for the traveling umpire problemA priori optimization with recourse for the vehicle routing problem with hard time windows and stochastic service timesInteger programming formulations for the elementary shortest path problemThe constrained shortest path problem with stochastic correlated link travel timesA branch-and-price approach for a multi-period vehicle routing problemReformulations and branch-and-price algorithm for the minimum cost hop-and-root constrained forest problemA combined column generation and heuristics for railway short-term rolling stock planning with regular inspection constraintsA branch-price-and-cut algorithm for the workover rig routing problemA branch-and-price algorithm for scheduling of deteriorating jobs and flexible periodic maintenance on a single machineSimple paths with exact and forbidden lengthsImproved branch-cut-and-price for capacitated vehicle routingStabilized Column Generation Via the Dynamic Separation of Aggregated RowsExact Branch-Price-and-Cut for a Hospital Therapist Scheduling Problem with Flexible Service Locations and Time-Dependent Location CapacityAn exact algorithm for Agile Earth Observation Satellite scheduling with time-dependent profitsAn exact solution approach for the inventory routing problem with time windowsThe rainbow Steiner tree problemAn exact algorithm for two-dimensional vector packing problem with volumetric weight and general costsExact Approach for Integrated Delivery Optimization of E-Commerce and Online-to-Offline ParcelsA branch-and-price algorithm for the multi-depot heterogeneous-fleet pickup and delivery problem with soft time windowsSelective arc‐ng pricing for vehicle routingExact and heuristic methods for a workload allocation problem with chain precedence constraintsClique Inequalities Applied to the Vehicle Routing Problem with Time WindowsNew Refinements for the Solution of Vehicle Routing Problems with Branch and PriceCyclic transfers in school timetablingA branch‐and‐price‐based heuristic for the vehicle routing problem with two‐dimensional loading constraints and time windowsA computational study of solution approaches for the resource constrained elementary shortest path problemA tutorial on column generation and branch-and-price for vehicle routing problemsAn Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing ProblemSolving elementary shortest-path problems as mixed-integer programsSymmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraintsChvátal-Gomory Rank-1 Cuts Used in a Dantzig-Wolfe Decomposition of the Vehicle Routing Problem with Time WindowsExact methods for solving the elementary shortest and longest path problemsA branch-and-price algorithm for a vehicle routing with demand allocation problemAsymmetry matters: dynamic half-way points in bidirectional labeling for solving shortest path problems with resource constraints fasterDecremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programmingBranch-and-price-and-cut for the multiple traveling repairman problem with distance constraintsSolving shortest path problems with a weight constraint and replenishment arcsA column generation algorithm for the vehicle routing problem with soft time windowsA branch-and-price algorithm for the vehicle routing problem with deliveries, selective pickups and time windowsOptimal routing with failure-independent path protectionA rollout algorithm for the resource constrained elementary shortest path problemBi-criteria path problem with minimum length and maximum survival probabilityA branch and price algorithm to solve the quickest multicommodity \(k\)-splittable flow problemOn the shortest path problem with negative cost cyclesVehicle routing with soft time windows and stochastic travel times: a column generation and branch-and-price solution approachThe conditional \(p\)-dispersion problemA survey of resource constrained shortest path problems: Exact solution approachesA branch-price-and-cut algorithm for the min-maxk-vehicle windy rural postman problemStronger column generation bounds for the Minimum Cost Hop-and-root Constrained Forest ProblemA Branch-and-Price-and-Cut Algorithm for the Cable-Routing Problem in Solar Power PlantsUsing column generation to compute lower bound sets for bi-objective combinatorial optimization problemsA Pricing Algorithm for the Vehicle Routing Problem with Soft Time WindowsA new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraintsA branch-and-cut algorithm for the capacitated profitable tour problem


Uses Software



Cites Work




This page was built for publication: Accelerated label setting algorithms for the elementary resource constrained shortest path problem