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