A three‐stage procurement optimization problem under uncertainty

DOI10.1002/nav.21541zbMath1410.90129OpenAlexW1993286179MaRDI QIDQ4629182

Mike Prince, Joseph Geunes, J. Cole Smith

Publication date: 26 March 2019

Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.21541

zbMATH Keywords

integer programmingcutting planesnetwork interdictionfortificationprocurement game

Mathematics Subject Classification ID

Integer programming (90C10) Applications of game theory (91A80)

Related Items (4)

Modeling Defender-Attacker Problems as Robust Linear Programs with Mixed-Integer Uncertainty Sets ⋮ Robust flows with adaptive mitigation ⋮ Solving the traveling salesman problem with interdiction and fortification ⋮ A Brief Overview of Interdiction and Robust Optimization

This page was built for publication: A three‐stage procurement optimization problem under uncertainty