Maximum probabilistic all-or-nothing paths

DOI10.1016/j.ejor.2019.11.011zbMath1431.90163OpenAlexW2985731513MaRDI QIDQ2286936

Michael Poss, Noam Goldberg

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 programmingnetworksinteger nonlinear programmingFPTAS

Mathematics Subject Classification ID

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

Related Items (2)

Linearized formulations for failure aware barter exchange ⋮ A fully polynomial time approximation scheme for the probability maximizing shortest path problem

Uses Software

• Knapsack
• JuMP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Scheduling modular projects on a bottleneck resource
• Minimum cost-reliability ratio path problem
• A fully polynomial time approximation scheme for minimum cost-reliability ratio problems
• Ensuring quality in resource constrained project scheduling
• The most critical path in a PERT network: A heuristic approach
• An improved FPTAS for Restricted Shortest Path.
• Minimizing a stochastic maximum-reliability path
• Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
• Optimal Testing Procedures for Special Structures of Coherent Systems
• Approximation Schemes for the Restricted Shortest Path Problem
• Efficient Interactive Methods for a Class of Multiattribute Shortest Path Problems
• A Minimal Algorithm for the 0-1 Knapsack Problem
• Approximation algorithms for sequential batch‐testing of series systems
• Non‐zero‐sum nonlinear network path interdiction with an application to inspection in terror networks
• JuMP: A Modeling Language for Mathematical Optimization
• A simple efficient approximation scheme for the restricted shortest path problem

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