Bi-objective optimisation over a set of convex sub-problems
From MaRDI portal
Publication:2108798
DOI10.1007/s10479-020-03910-3OpenAlexW3118872643MaRDI QIDQ2108798
Guillermo Cabrera-Guerrero, Matthias Ehrgott, Andrea Raith, Andrew J. Mason
Publication date: 20 December 2022
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-020-03910-3
multiple objective programmingmixed binary programmingconvex optimisationintensity modulated radiation therapy
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Multiple criteria decision analysis. State of the art surveys. In 2 volumes
- Multiple objective branch and bound for mixed 0-1 linear programming: corrections and improvements for the biobjective case
- A two-phase method for selecting IMRT treatment beam angles: branch-and-prune and local neighborhood search
- Multicriteria branch and bound: a vector maximization algorithm for mixed 0-1 multiple objective linear programming
- Column generation for IMRT cancer therapy optimization with implementable segments
- Bound sets for biobjective combinatorial optimization problems
- Partitioning procedures for solving mixed-variables programming problems
- Kuhn-Tucker multipliers as trade-offs in multiobjective decision-making analysis
- A branch and bound algorithm for mixed zero-one multiple objective linear programming
- Nonlinear multiobjective optimization
- Optimisation of beam directions in intensity modulated radiation therapy planning
- Fathoming rules for biobjective mixed integer linear programs: review and extensions
- A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs
- A one direction search method to find the exact nondominated frontier of biobjective mixed-binary linear programming problems
- The search-and-remove algorithm for biobjective mixed-integer linear programming problems
- A coupled column generation, mixed integer approach to optimal planning of intensity modulated radiation therapy for cancer
- Multi-objective optimisation of positively homogeneous functions and an application in radiation therapy
- Beam selection in radiotherapy design
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- A Criterion Space Search Algorithm for Biobjective Mixed Integer Programming: The Triangle Splitting Method
- A matheuristic approach to solve the multiobjective beam angle optimization problem in intensity‐modulated radiation therapy
- Solving Multiobjective Mixed Integer Convex Optimization Problems
- Multicriteria Optimization
- The Triangle Splitting Method for Biobjective Mixed Integer Programming
- Mathematical optimization in intensity modulated radiation therapy
