Pages that link to "Item:Q1600950"

The following pages link to A weight set decomposition algorithm for finding all efficient extreme points in the outcome set of a multiple objective linear program (Q1600950):

Displaying 24 items.

• The \(L\)-shape search method for triobjective integer programming (Q298165) (← links)
• Graphical exploration of the weight space in three-objective mixed integer linear programs (Q320624) (← links)
• A dual variant of Benson's ``outer approximation algorithm'' for multiple objective linear programming (Q427391) (← links)
• An inner approximation method to compute the weight set decomposition of a triobjective mixed-integer problem (Q785628) (← links)
• Determining maximal efficient faces in multiobjective linear programming problem (Q1018182) (← links)
• Further analysis of an outcome set-based algorithm for multiple-objective linear programming (Q1264984) (← links)
• Hybrid approach for solving multiple-objective linear programs in outcome space (Q1265035) (← links)
• An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem (Q1265180) (← links)
• On degeneracy and collapsing in the construction of the set of objective values in a multiple objective linear program (Q1312767) (← links)
• Generating the efficient outcome set in multiple objective linear programs: The bicriteria case (Q1384421) (← links)
• Finding a weights-restricted efficient (extreme) point and using it for solving MOLP problems. (Q1428193) (← links)
• Outcome space partition of the weight set in multiobjective linear programming (Q1579630) (← links)
• Bilevel programming for generating discrete representations in multiobjective optimization (Q1646577) (← links)
• Reducing wall-clock time for the computation of all efficient extreme points in multiple objective linear programming (Q1737503) (← links)
• Optimising a nonlinear utility function in multi-objective integer programming (Q1955541) (← links)
• Multi-objective integer programming: an improved recursive algorithm (Q2251549) (← links)
• Multi-objective unconstrained combinatorial optimization: a polynomial bound on the number of extreme supported solutions (Q2423818) (← links)
• Standard sensitivity analysis and additive tolerance approach in MOLP (Q2430602) (← links)
• A criterion space search algorithm for biobjective integer programming: the balanced box method (Q2802251) (← links)
• A recursive algorithm for finding all nondominated extreme points in the outcome set of a multiobjective integer programme (Q2899069) (← links)
• (Q4963438) (← links)
• Filtering Algorithms for Biobjective Mixed Binary Linear Optimization Problems with a Multiple-Choice Constraint (Q5139847) (← links)
• Analysis of the weighted Tchebycheff weight set decomposition for multiobjective discrete optimization problems (Q6162512) (← links)
• The weighted \(p\)-norm weight set decomposition for multiobjective discrete optimization problems (Q6614703) (← links)