PathWyse: a flexible, open-source library for the resource constrained shortest path problem
From MaRDI portal
(Redirected from Publication:6586912)
Software, source code, etc. for problems pertaining to combinatorics (05-04) Computational methods for problems pertaining to combinatorics (05-08) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04) Programming involving graphs or networks (90C35) Dynamic programming (90C39)
Recommendations
- Solving resource constrained shortest path problems with LP-based methods
- A computational study of solution approaches for the resource constrained elementary shortest path problem
- scientific article; zbMATH DE number 1670670
- An algorithm for the resource constrained shortest path problem
- A penalty function heuristic for the resource constrained shortest path problem
Cites work
- A branch-and-price algorithm for the minimum latency problem
- A Column Generation Approach for Large-Scale Aircrew Rostering Problems
- A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows
- A generic exact solver for vehicle routing and related problems
- A Survey of Methods for Automated Algorithm Configuration
- A survey of resource constrained shortest path problems: exact solution approaches
- A two-phase hybrid metaheuristic for the vehicle routing problem with time windows
- An algorithm for the resource constrained shortest path problem
- An exact bidirectional A^ approach for solving resource-constrained shortest path problems
- An exact bidirectional pulse algorithm for the constrained shortest path
- Approximation algorithms for the arc orienteering problem
- Asymmetry matters: dynamic half-way points in bidirectional labeling for solving shortest path problems with resource constraints faster
- Column Generation
- Cooperative control and optimization
- Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming
- Efficient elementary and restricted non-elementary route pricing
- scientific article; zbMATH DE number 1670670 (Why is no real title available?)
- scientific article; zbMATH DE number 1452994 (Why is no real title available?)
- Improved branch-cut-and-price for capacitated vehicle routing
- Improved preprocessing, labeling and scaling algorithms for the Weight-Constrained Shortest Path Problem
- Lagrangian relaxation and enumeration for solving constrained shortest-path problems
- New dynamic programming algorithms for the resource constrained elementary shortest path problem
- New route relaxation and pricing strategies for the vehicle routing problem
- On an exact method for the constrained shortest path problem
- Orienteering problem: a survey of recent variants, solution approaches and applications
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- Selective arc‐ng pricing for vehicle routing
- Shortest Path Problems with Resource Constraints
- Shortest path with time constraints on movement and parking
- Simultaneous Vehicle and Crew Scheduling in Urban Mass Transit Systems
- Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
- Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
- The network design problem with relays
- The orienteering problem
- The prize collecting traveling salesman problem
- The selective travelling salesman problem
- The shortest-path problem with resource constraints and k-cycle elimination for k 3
This page was built for publication: PathWyse: a flexible, open-source library for the resource constrained shortest path problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6586912)
