Pages that link to "Item:Q953293"

The following pages link to Approximately solving multiobjective linear programmes in objective space and an application in radiotherapy treatment planning (Q953293):

Displaying 32 items.

• Strongly proper efficient solutions: efficient solutions with bounded trade-offs (Q283930) (← links)
• A dual variant of Benson's ``outer approximation algorithm'' for multiple objective linear programming (Q427391) (← links)
• Primal and dual approximation algorithms for convex vector optimization problems (Q475807) (← links)
• A parametric simplex algorithm for linear vector optimization problems (Q526835) (← links)
• An approximation algorithm for convex multi-objective programming problems (Q548180) (← links)
• Integrating column generation in a method to compute a discrete representation of the non-dominated set of multi-objective linear programmes (Q681288) (← links)
• Benson type algorithms for linear vector optimization and applications (Q743969) (← links)
• Approximating the nondominated set of an MOLP by approximately solving its dual problem (Q999127) (← links)
• A revised Pascoletti-Serafini scalarization method for multiobjective optimization problems (Q1670109) (← links)
• Multi-criteria optimization and decision-making in radiotherapy (Q1735159) (← links)
• Reducing wall-clock time for the computation of all efficient extreme points in multiple objective linear programming (Q1737503) (← links)
• Discrete representation of non-dominated sets in multi-objective linear programming (Q1751259) (← links)
• The vector linear program solver Bensolve -- notes on theoretical background (Q1753500) (← links)
• A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs (Q1753510) (← links)
• Tractability of convex vector optimization problems in the sense of polyhedral approximations (Q1756800) (← links)
• An extension of the non-inferior set estimation algorithm for many objectives (Q2301933) (← links)
• A Benson type algorithm for nonconvex multiobjective programming problems (Q2408519) (← links)
• Scalarization for characterization of approximate strong/weak/proper efficiency in multi-objective optimization (Q2841152) (← links)
• A deterministic algorithm for global multi-objective optimization (Q2926067) (← links)
• Generalized Inverse Multiobjective Optimization with Application to Cancer Therapy (Q2935310) (← links)
• Multiobjective (Combinatorial) Optimisation—Some Thoughts on Applications (Q3649619) (← links)
• An algorithm to solve polyhedral convex set optimization problems (Q4916312) (← links)
• Optimality conditions via a unified direction approach for (approximate) efficiency in multiobjective optimization (Q4999342) (← links)
• Optimality conditions via scalarization for approximate quasi efficiency in multiobjective optimization (Q5005859) (← links)
• A Benson-type algorithm for bounded convex vector optimization problems with vertex selection (Q5043850) (← links)
• Objective Selection for Cancer Treatment: An Inverse Optimization Approach (Q5095171) (← links)
• Geometric Duality Results and Approximation Algorithms for Convex Vector Optimization Problems (Q5883318) (← links)
• Mathematical optimization in intensity modulated radiation therapy (Q5900895) (← links)
• Mathematical optimization in intensity modulated radiation therapy (Q5902146) (← links)
• Slack-based generalized Tchebycheff norm scalarization approaches for solving multiobjective optimization problems (Q6046880) (← links)
• Convergence analysis of a norm minimization-based convex vector optimization algorithm (Q6587338) (← links)
• Computing the recession cone of a convex upper image via convex projection (Q6593832) (← links)