Pump scheduling in drinking water distribution networks with an LP/NLP-based branch and bound
DOI10.1007/S11081-020-09575-YzbMATH Open1487.90273OpenAlexW3118562502WikidataQ114859178 ScholiaQ114859178MaRDI QIDQ2129196FDOQ2129196
Andrea Lodi, Sophie Demassey, Gratien Bonvin
Publication date: 22 April 2022
Published in: Optimization and Engineering (Search for Journal in Brave)
Full work available at URL: https://hal-mines-paristech.archives-ouvertes.fr/hal-02158535v2/file/bonvin20opteng.pdf
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Deterministic scheduling theory in operations research (90B35) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Mixed integer programming (90C11)
Cites Work
- Mixed-integer nonlinear optimization
- Optimization models for operative planning in drinking water networks
- An algorithmic framework for convex mixed integer nonlinear programs
- Canonical Cuts on the Unit Hypercube
- Towards globally optimal operation of water supply networks
- A Lagrangian decomposition approach for the pump scheduling problem in water networks
- Mixed Integer Optimization of Water Supply Networks
- Mathematical programming techniques in water network optimization
- Nonlinear Programming Techniques for Operative Planning in Large Drinking Water Networks
- Simulation-optimization approaches for water pump scheduling and pipe replacement problems
- On the optimal design of water distribution networks: a practical MINLP approach
- Derivation of near-optimal pump schedules for water distribution by simulated annealing
- Global Optimization of Nonlinear Network Design
- Mixed integer linear models for the optimization of dynamical transport networks
- Mixed integer nonlinear programming tools: an updated practical overview
- Title not available (Why is that?)
- On interval-subgradient and no-good cuts
- Three enhancements for optimization-based bound tightening
- Sufficient pruning conditions for MINLP in gas network design
- Convex reformulations for solving a nonlinear network design problem
- Pyomo -- optimization modeling in Python
- Penalty and relaxation methods for the optimal placement and operation of control valves in water supply networks
- An Exact Algorithmic Framework for a Class of Mixed-Integer Programs with Equilibrium Constraints
Cited In (3)
Uses Software
This page was built for publication: Pump scheduling in drinking water distribution networks with an LP/NLP-based branch and bound
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2129196)
