Approximation Schemes for the Restricted Shortest Path Problem
From MaRDI portal
Recommendations
- A simple efficient approximation scheme for the restricted shortest path problem
- A heuristic approach to hard constrained shortest path problems
- An improved FPTAS for Restricted Shortest Path.
- Multi-criteria approximation schemes for the resource constrained shortest path problem
- Near linear time \((1 + \epsilon)\)-approximation for restricted shortest paths in undirected graphs
Cited in
(only showing first 100 items - show all)- A new model for path planning with interval data
- Approximating buy-at-bulk and shallow-light \(k\)-Steiner trees
- A polynomial solvable minimum risk spanning tree problem with interval data
- Modifying edges of a network to obtain short subgraphs
- Approximating the weight of shallow Steiner trees
- A PTAS for weight constrained Steiner trees in series--parallel graphs.
- A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem.
- Approximation algorithms for multi-parameter graph optimization problems
- A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs
- An enhanced K-SP algorithm with pruning strategies to solve the constrained shortest path problem
- Multi-criteria approximation schemes for the resource constrained shortest path problem
- Two-agent parallel machine scheduling with a restricted number of overlapped reserved tasks
- A three-stage approach for the resource-constrained shortest path as a sub-problem in column generation
- An improved FPTAS for Restricted Shortest Path.
- A computer-aided process planning model based on genetic algorithms
- Errata and comments on ``Approximation algorithms for the capacitated plant allocation problem
- Trajectory planning for unmanned aerial vehicles: a network optimization approach
- Improved algorithms for finding length-bounded two vertex-disjoint paths in a planar graph and minmax \(k\) vertex-disjoint paths in a directed acyclic graph
- Approximation algorithms for constructing required subgraphs using stock pieces of fixed length
- Scheduling two projects with controllable processing times in a single-machine environment
- A just-in-time scheduling problem with two competing agents
- Two-agent single-machine scheduling problem with just-in-time jobs
- Approximation algorithms for constructing some required structures in digraphs
- Bi-criteria path problem with minimum length and maximum survival probability
- Maximum probabilistic all-or-nothing paths
- Improved approximation algorithms for the combination problem of parallel machine scheduling and path
- A heuristic for cumulative vehicle routing using column generation
- Knapsack problem with objective value gaps
- Three-stage approaches for optimizing some variations of the resource constrained shortest-path sub-problem in a column generation context
- Approximation schemes for a class of subset selection problems
- On fault-tolerant path optimization under QoS constraint in multi-channel wireless networks
- Approximating the restricted 1-center in graphs
- Approximation algorithms and hardness results for labeled connectivity problems
- Minimum diameter cost-constrained Steiner trees
- The subdivision-constrained routing requests problem
- Bounded-hops power assignment in ad hoc wireless networks
- The constrained minimum weighted sum of job completion times problem
- Bulk-robust combinatorial optimization
- When diameter matters: parameterized approximation algorithms for bounded diameter minimum Steiner tree problem
- Efficiently computing succinct trade-off curves
- On budget-constrained flow improvement.
- PGAS: privacy-preserving graph encryption for accurate constrained shortest distance queries
- Finding cheapest deadline paths
- Diameter-constrained Steiner trees
- Approximating corridors and tours via restriction and relaxation techniques
- The cross-entropy method for solving bi-criteria network flow problems in discrete-time dynamic networks
- Improving the solution complexity of the scheduling problem with deadlines: a general technique
- Complexity results for the linear time-cost tradeoff problem with multiple milestones and completely ordered jobs
- Complexity of most vital nodes for independent set in graphs related to tree structures
- Single machine scheduling with two competing agents and equal job processing times
- A note on the constrained shortest-path problem
- Minimum cost paths over dynamic networks
- Implementation of a three-stage approach for the dynamic resource-constrained shortest-path sub-problem in branch-and-price
- Approximating the Restricted 1-Center in Graphs
- Effective algorithms for a class of discrete valued optimal control problems
- The capacity expansion path problem in networks
- scientific article; zbMATH DE number 4035602 (Why is no real title available?)
- Multi-postpath-based lookahead multiconstraint QoS routing
- An improved FPTAS for maximizing the weighted number of just-in-time jobs in a two-machine flow shop problem
- New approaches to multi-objective optimization
- The most vital nodes with respect to independent set and vertex cover
- Improved approximation algorithms for directed Steiner forest
- General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems
- Polynomial time approximation schemes for the constrained minimum spanning tree problem
- Constrained Steiner trees in Halin graphs
- scientific article; zbMATH DE number 1543043 (Why is no real title available?)
- Simple paths with exact and forbidden lengths
- -approximation schemes for the constrained shortest path problem
- Supply chain scheduling to minimize holding costs with outsourcing
- Fast approximation algorithms for routing problems with hop-wise constraints
- Approximation scheme for restricted discrete gate sizing targeting delay minimization
- Maximum probability shortest path problem
- Constrained shortest path with uncertain transit times
- The edge-recoloring cost of monochromatic and properly edge-colored paths and cycles
- Brief announcement: Characterizing demand graphs for (fixed-parameter) shallow-light Steiner network
- Facility location with dynamic distance functions
- Formal language constrained path problems
- Approximation Methods for Multiobjective Optimization Problems: A Survey
- On polynomial-time combinatorial algorithms for maximum \(L\)-bounded flow
- Bi-objective matchings with the triangle inequality
- Routing of electric vehicles: constrained shortest path problems with resource recovering nodes
- Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms
- Near linear time \((1 + \epsilon)\)-approximation for restricted shortest paths in undirected graphs
- On Accuracy of Approximation for the Resource Constrained Shortest Path Problem
- A simple efficient approximation scheme for the restricted shortest path problem
- Improved approximations for buy-at-bulk and shallow-light \(k\)-Steiner trees and \((k,2)\)-subgraph
- Compact location problems with budget and communication constraints
- Polynomial-time approximation schemes for a class of integrated network design and scheduling problems with parallel identical machines
- Single-machine scheduling of multiple projects with controllable processing times
- An FPTAS for minimizing the product of two non-negative linear cost functions
- Approximating some network design problems with node costs
- Modifying networks to obtain low cost trees
- Online learning for route planning with on-time arrival reliability
- A note on approximating the min-max vertex disjoint paths on directed acyclic graphs
- Recoverable robust shortest path problem under interval budgeted uncertainty representations
- A generalized approximation framework for fractional network flow and packing problems
- An optimal absolute approximation algorithm for computing k disjoint restricted shortest paths
- Minimizing total completion time in single-machine scheduling with convex resource consumption and job rejection
- A generalized combination of parallel machine scheduling and path
- An optimal absolute approximation algorithm for computing k restricted shortest paths
This page was built for publication: Approximation Schemes for the Restricted Shortest Path Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4016708)
