Robust balanced optimization
From MaRDI portal
Publication:668952
DOI10.1007/s13675-018-0093-yzbMath1417.90127OpenAlexW2790669781MaRDI QIDQ668952
Annette M. C. Ficker, Frits C. R. Spieksma, Gerhard J. Woeginger
Publication date: 19 March 2019
Published in: EURO Journal on Computational Optimization (Search for Journal in Brave)
Full work available at URL: https://lirias.kuleuven.be/handle/123456789/611921
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Robust combinatorial optimization with variable cost uncertainty
- The balanced traveling salesman problem
- Balanced optimization problems
- Complexity of the min-max and min-max regret assignment problems
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- Most and least uniform spanning trees
- On finding most uniform spanning trees
- The balanced linear programming problem
- Robust solutions of uncertain linear programs
- Robust discrete optimization and its applications
- Robust discrete optimization and network flows
- Robust solutions of linear programming problems contaminated with uncertain data
- Exact algorithms for the equitable traveling salesman problem
- Constrained balanced optimization problems
- Recent advances in robust optimization: an overview
- Multi-dimensional vector assignment problems
- Extending scope of robust optimization: comprehensive robust counterparts of uncertain problems
- Robust Convex Optimization
- Distributionally Robust Convex Optimization
- Theory and Applications of Robust Optimization
- Efficient algorithms for minimum range cut problems
- Technical Note—Branch-and-Price-and-Cut Approach to the Robust Network Design Problem Without Flow Bifurcations
- Balanced paths in acyclic networks: Tractable cases and related approaches
- Robust network design: Formulations, valid inequalities, and computations
- JuMP: A Modeling Language for Mathematical Optimization
This page was built for publication: Robust balanced optimization
