Precedence-constrained shortest path
From MaRDI portal
Cites work
- A Dynamic Programming Approach to Sequencing Problems
- A hybrid algorithm for the vehicle routing problem with AND/OR precedence constraints and time windows
- A survey on how the structure of precedence constraints may change the complexity class of scheduling problems
- Application of a technique for research and development program evaluation
- Complexity of Scheduling under Precedence Constraints
- Dynamic Programming Solution of Sequencing Problems with Precedence Constraints
- Euler is standing in line dial-a-ride problems with precedence-constraints
- scientific article; zbMATH DE number 1306896 (Why is no real title available?)
- Improved approximations for TSP with simple precedence constraints
- On a routing problem
- On the complexity of dynamic programming for sequencing problems with precedence constraints
- On the complexity of scheduling unit-time jobs with or-precedence constraints
- On the complexity of the Eulerian closed walk with precedence path constraints problem
- Precedence constrained generalized traveling salesman problem: polyhedral study, formulations, and branch-and-cut algorithm
- Project Scheduling in AND–OR Graphs: A Generalization of Dijkstra's Algorithm
- Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization
- Scheduling with AND/OR Precedence Constraints
- Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems
This page was built for publication: Precedence-constrained shortest path
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6889217)
