Bi-objective design-for-control of water distribution networks with global bounds
From MaRDI portal
Publication:2138314
DOI10.1007/s11081-021-09598-zzbMath1492.90166OpenAlexW3134176015MaRDI QIDQ2138314
Aly-Joy Ulusoy, Ivan Stoianov, Filippo Pecci
Publication date: 11 May 2022
Published in: Optimization and Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11081-021-09598-z
global optimizationinteger programmingbranch and boundbi-objective programmingwater distribution network
Applications of mathematical programming (90C90) Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29)
Related Items
Uses Software
Cites Work
- Mathematical programming techniques in water network optimization
- GLOMIQO: global mixed-integer quadratic optimizer
- Novel insights for multi-objective optimisation in engineering using normal boundary intersection and (enhanced) normalised normal constraint
- The normalized normal constraint method for generating the Pareto frontier
- Multicriteria branch and bound: a vector maximization algorithm for mixed 0-1 multiple objective linear programming
- Bound sets for biobjective combinatorial optimization problems
- The set of all nondominated solutions in linear cases and a multicriteria simplex method
- A branch and bound algorithm for mixed zero-one multiple objective linear programming
- Nonlinear multiobjective optimization
- Convex envelopes of monomials of odd degree
- Domain reduction techniques for global NLP and MINLP optimization
- A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs
- A polyhedral branch-and-cut approach to global optimization
- Towards globally optimal operation of water supply networks
- Penalty and relaxation methods for the optimal placement and operation of control valves in water supply networks
- Optimality-based bound contraction with multiparametric disaggregation for the global optimization of mixed-integer bilinear problems
- Branching with hyperplanes in the criterion space: the frontier partitioner algorithm for biobjective integer programming
- A discussion of scalarization techniques for multiple objective integer programming
- Obtaining an outer approximation of the efficient set of nonlinear biobjective problems
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems
- A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization
- SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
- Solving Multiobjective Mixed Integer Convex Optimization Problems
- Optimal Water–Power Flow-Problem: Formulation and Distributed Optimal Solution
- A New Scalarization Technique and New Algorithms to Generate Pareto Fronts
- Programming with linear fractional functionals
- Mixed-integer nonlinear optimization
