On the complexity of solving a decision problem with flow-depending costs: the case of the IJsselmeer dikes

DOI10.1016/j.disopt.2019.100565zbMath1506.90282arXiv1804.09752OpenAlexW2999713232MaRDI QIDQ783034

Matthias Mnich, Aida Abiad, Guus Regts, G. Verweij, Domenico Lahaye, Peter J. Zwaneveld, Lluís Vena, Sander Gribling

Publication date: 30 July 2020

Published in: Discrete Optimization (Search for Journal in Brave)

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

zbMATH Keywords

integer programmingdynamic programmingcost-benefit analysis

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Integer programming (90C10) Dynamic programming (90C39)

Cites Work

• The directed subgraph homeomorphism problem
• Safe dike heights at minimal costs: an integer programming approach
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Economic Decision Problems for Flood Prevention
• Safe Dike Heights at Minimal Costs: The Nonhomogeneous Case

This page was built for publication: On the complexity of solving a decision problem with flow-depending costs: the case of the IJsselmeer dikes