Maximum probabilistic all-or-nothing paths

DOI10.1016/J.EJOR.2019.11.011MaRDI QIDQ2286936zbMATH OpenOpenAlexFDO

Authors Noam Goldberg, Michael Poss

Publication date 23 January 2020

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2019.11.011

zbMATH Keywords

dynamic programmingFPTASinteger nonlinear programmingnetworks

Mathematics Subject Classification ID

Integer programming (90C10) Programming involving graphs or networks (90C35) Dynamic programming (90C39)

Recommendations

• Maximum probability shortest path problem
• A fully polynomial time approximation scheme for the probability maximizing shortest path problem
• On the complexity and approximation of the maximum expected value all-or-nothing subset
• The probabilistic longest path problem
• Bi-criteria path problem with minimum length and maximum survival probability

Cites work

• A fully polynomial time approximation scheme for minimum cost-reliability ratio problems
• A Minimal Algorithm for the 0-1 Knapsack Problem
• A simple efficient approximation scheme for the restricted shortest path problem
• An improved FPTAS for Restricted Shortest Path.
• Approximation algorithms for sequential batch-testing of series systems
• Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
• Approximation Schemes for the Restricted Shortest Path Problem
• Efficient Interactive Methods for a Class of Multiattribute Shortest Path Problems
• Ensuring quality in resource constrained project scheduling
• scientific article; zbMATH DE number 3694968 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Introduction to algorithms.
• JuMP: a modeling language for mathematical optimization
• Minimizing a stochastic maximum-reliability path
• Minimum cost-reliability ratio path problem
• Non‐zero‐sum nonlinear network path interdiction with an application to inspection in terror networks
• Optimal Testing Procedures for Special Structures of Coherent Systems
• Scheduling modular projects on a bottleneck resource
• The most critical path in a PERT network: A heuristic approach

Cited in

(7)

• Linearized formulations for failure aware barter exchange
• On the complexity and approximation of the maximum expected value all-or-nothing subset
• A fully polynomial time approximation scheme for the probability maximizing shortest path problem
• The most likely path on series-parallel networks
• Maximum Reliability throught a Newtork with Resource Contraints
• The probabilistic longest path problem
• Maximum probability shortest path problem

Describes a project that uses

Uses Software

• JuMP
• Knapsack

This page was built for publication: Maximum probabilistic all-or-nothing paths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2286936)