Bi-criteria path problem with minimum length and maximum survival probability
From MaRDI portal
Publication:2284640
Recommendations
Cites work
- ``Product partition and related problems of scheduling and systems reliability: computational complexity and approximation
- A comparison of solution strategies for biobjective shortest path problems
- A fully polynomial-time approximation scheme for single-item stochastic inventory control with discrete demand
- A general approximation method for bicriteria minimization problems
- A note on two problems in connexion with graphs
- A simple efficient approximation scheme for the restricted shortest path problem
- A survey on multi-constrained optimal path computation: exact and approximate algorithms
- A Theorem on Boolean Matrices
- Accelerated label setting algorithms for the elementary resource constrained shortest path problem
- An improved FPTAS for Restricted Shortest Path.
- Analysis of FPTASes for the multi-objective shortest path problem
- Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
- Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints
- Approximation Schemes for the Restricted Shortest Path Problem
- Automata, Languages and Programming
- Bicriterion Single Machine Scheduling with Resource Dependent Processing Times
- Fibonacci heaps and their uses in improved network optimization algorithms
- Fully polynomial time approximation schemes for stochastic dynamic programs
- scientific article; zbMATH DE number 3150488 (Why is no real title available?)
- scientific article; zbMATH DE number 3850828 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1783874 (Why is no real title available?)
- Introduction to algorithms.
- Letter to the Editor—A Comment on the Shortest-Route Problem
- Multicriteria Optimization
- Multiobjective optimization: Improved FPTAS for shortest paths and nonlinear objectives with applications
- Multiobjective transportation network design and routing problems: Taxonomy and annotation
- Multiple criteria optimization: State of the art annotated bibliographic surveys
- On a routing problem
- On different approximation criteria for subset product problems
- Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms
- Shortest chain subject to side constraints
- Shortest Path Problems with Resource Constraints
- Shortest-path queries in static networks
- Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
- The constrained shortest path problem
- The multiobjective shortest path problem is NP-hard, or is it?
- The shortest route problem with constraints
Cited in
(12)- Minimum cost-reliability ratio path problem
- Strongly polynomial FPTASes for monotone dynamic programs
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems
- A technical note: fully polynomial time approximation schemes for minimizing the makespan of deteriorating jobs with nonlinear processing times
- Approximating the product knapsack problem
- Maximum probabilistic all-or-nothing paths
- A fully polynomial time approximation scheme for the probability maximizing shortest path problem
- On a random walk survivability problem with arc failures and memory
- Automatic Generation of FPTASes for Stochastic Monotone Dynamic Programs Made Easier
- scientific article; zbMATH DE number 6260127 (Why is no real title available?)
- Approximating single- and multi-objective nonlinear sum and product knapsack problems
- Parameterized analysis of bribery in \textit{Challenge the champ} tournaments
This page was built for publication: Bi-criteria path problem with minimum length and maximum survival probability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2284640)
