New solution approaches for the maximum-reliability stochastic network interdiction problem

DOI10.1007/s10287-018-0321-1zbMath1483.90041arXiv1708.04261OpenAlexW2748210885WikidataQ129666846 ScholiaQ129666846MaRDI QIDQ1989731

Eli Towle, James R. Luedtke

Publication date: 29 October 2018

Published in: Computational Management Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1708.04261

zbMATH Keywords

stochastic programminginteger programmingvalid inequalitiesnetwork interdiction

Mathematics Subject Classification ID

Mixed integer programming (90C11) Stochastic programming (90C15) Stochastic network models in operations research (90B15)

Related Items (9)

A survey on bilevel optimization under uncertainty ⋮ Outer-product-free sets for polynomial optimization and oracle-based cuts ⋮ Generating valid linear inequalities for nonlinear programs via sums of squares ⋮ Shortest path network interdiction with asymmetric uncertainty ⋮ Optimization models of anti-terrorist protection ⋮ On the implementation and strengthening of intersection cuts for QCQPs ⋮ A survey of network interdiction models and algorithms ⋮ On a generalization of the Chvátal-Gomory closure ⋮ Maximal quadratic-free sets

Uses Software

• Julia

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maximizing a class of submodular utility functions with constraints
• Maximizing a class of submodular utility functions
• Network deployment of radiation detectors with physics-based detection probability calculations
• Deterministic network interdiction
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Stochastic Network Interdiction
• Interdicting a Nuclear-Weapons Project
• Minimizing a stochastic maximum-reliability path
• Reformulation and sampling to solve a stochastic network interdiction problem
• Computing in Operations Research Using Julia
• Jointly Constrained Biconvex Programming
• L’algebre de Boole et ses applications en recherche operationnelle
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• Maximizing the minimum source-sink path subject to a budget constraint
• An analysis of approximations for maximizing submodular set functions—I
• A problem in network interdiction
• Removing Arcs from a Network
• Strengthened Benders Cuts for Stochastic Integer Programs with Continuous Recourse

This page was built for publication: New solution approaches for the maximum-reliability stochastic network interdiction problem