Approximately solving multiobjective linear programmes in objective space and an application in radiotherapy treatment planning
From MaRDI portal
Publication:953293
Recommendations
- Approximating the nondominated set of an MOLP by approximately solving its dual problem
- Integrating column generation in a method to compute a discrete representation of the non-dominated set of multi-objective linear programmes
- Intensity-modulated radiotherapy -- a large scale multi-criteria programming problem
- A dual variant of Benson's ``outer approximation algorithm for multiple objective linear programming
- Inverse radiation therapy planning -- a multiple objective optimization approach
Cites work
- scientific article; zbMATH DE number 1975112 (Why is no real title available?)
- scientific article; zbMATH DE number 2209474 (Why is no real title available?)
- An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
- Bound sets for biobjective combinatorial optimization problems
- Convex Analysis
- Hybrid approach for solving multiple-objective linear programs in outcome space
- Intensity-modulated radiotherapy -- a large scale multi-criteria programming problem
- Inverse radiation therapy planning -- a multiple objective optimization approach
- Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems
- On finding new vertices and redundant constraints in cutting plane algorithms for global optimization
- On-line and off-line vertex enumeration by adjacency lists
- The normalized normal constraint method for generating the Pareto frontier
Cited in
(34)- Scalarization for characterization of approximate strong/weak/proper efficiency in multi-objective optimization
- Multi-criteria optimization and decision-making in radiotherapy
- Benson type algorithms for linear vector optimization and applications
- Convergence analysis of a norm minimization-based convex vector optimization algorithm
- Strongly proper efficient solutions: efficient solutions with bounded trade-offs
- An extension of the non-inferior set estimation algorithm for many objectives
- Approximating the nondominated set of an MOLP by approximately solving its dual problem
- Objective selection for cancer treatment: an inverse optimization approach
- The vector linear program solver \textit{Bensolve} -- notes on theoretical background
- Integrating column generation in a method to compute a discrete representation of the non-dominated set of multi-objective linear programmes
- A Benson type algorithm for nonconvex multiobjective programming problems
- Multiobjective (Combinatorial) optimisation-some thoughts on applications
- Discrete representation of non-dominated sets in multi-objective linear programming
- Geometric Duality Results and Approximation Algorithms for Convex Vector Optimization Problems
- An approximation algorithm for convex multi-objective programming problems
- Partitioning multiple objective optimal solutions with applications in radiotherapy design
- Multi-objective optimisation of positively homogeneous functions and an application in radiation therapy
- Mathematical optimization in intensity modulated radiation therapy
- Tractability of convex vector optimization problems in the sense of polyhedral approximations
- Optimality conditions via a unified direction approach for (approximate) efficiency in multiobjective optimization
- Mathematical optimization in intensity modulated radiation therapy
- A parametric simplex algorithm for linear vector optimization problems
- Optimality conditions via scalarization for approximate quasi efficiency in multiobjective optimization
- Reducing wall-clock time for the computation of all efficient extreme points in multiple objective linear programming
- Computing the recession cone of a convex upper image via convex projection
- A Benson-type algorithm for bounded convex vector optimization problems with vertex selection
- A dual variant of Benson's ``outer approximation algorithm for multiple objective linear programming
- An algorithm to solve polyhedral convex set optimization problems
- A revised Pascoletti-Serafini scalarization method for multiobjective optimization problems
- A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs
- Generalized inverse multiobjective optimization with application to cancer therapy
- A deterministic algorithm for global multi-objective optimization
- Primal and dual approximation algorithms for convex vector optimization problems
- Slack-based generalized Tchebycheff norm scalarization approaches for solving multiobjective optimization problems
This page was built for publication: Approximately solving multiobjective linear programmes in objective space and an application in radiotherapy treatment planning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q953293)
