Bounds and convex heuristics for bi-objective optimal experiment design in water networks
From MaRDI portal
Publication:6164379
DOI10.1016/j.cor.2023.106181arXiv2207.04897OpenAlexW4319225049MaRDI QIDQ6164379
Publication date: 4 July 2023
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2207.04897
Cites Work
- An algorithmic framework for convex mixed integer nonlinear programs
- Near-optimal large-scale k-medoids clustering
- Multidimensional sum-up rounding for integer programming in optimal experimental design
- Near-optimal discrete optimization for experimental design: a regret minimization approach
- COSMO: a conic operator splitting method for convex conic problems
- Relax-tighten-round algorithm for optimal placement and control of valves and chlorine boosters in water networks
- Branching with hyperplanes in the criterion space: the frontier partitioner algorithm for biobjective integer programming
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Solving the \(p\)-median problem on regular and lattice networks
- Julia: A Fresh Approach to Numerical Computing
- Solution methods for thep-median problem: An annotated bibliography
- Sensor Selection via Convex Optimization
- Solving Multiobjective Mixed Integer Convex Optimization Problems
- JuMP: A Modeling Language for Mathematical Optimization
