Polyhedral relaxations for optimal pump scheduling of potable water distribution networks

DOI10.1287/IJOC.2022.0233MaRDI QIDQ6598942zbMATH OpenFDO

Authors Byron Tasseff, Russell Bent, Carleton Coffrin, Clayton Barrows, Devon Sigler, Jonathan J. Stickel, Ahmed S. Zamzam, Yang Liu, Pascal Van Hentenryck

Publication date 5 September 2024

Published in INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/IJOC.2022.0233

zbMATH Keywords

bound tighteningconvexnetworknonconvexpolyhedralrelaxationvalid inequalitieswater

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Recommendations

• Pump scheduling in drinking water distribution networks with an LP/NLP-based branch and bound
• On the optimal design of water distribution networks: a practical MINLP approach
• Effective relaxations and partitioning schemes for solving water distribution network design problems to global optimality
• Towards globally optimal operation of water supply networks
• Relax-tighten-round algorithm for optimal placement and control of valves and chlorine boosters in water networks

This page was built for publication: Polyhedral relaxations for optimal pump scheduling of potable water distribution networks

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