The weighted \(p\)-norm weight set decomposition for multiobjective discrete optimization problems

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Graphical exploration of the weight space in three-objective mixed integer linear programs
An augmented weighted Tchebycheff method with adaptively chosen parameters for discrete bicriteria optimization problems
A dual variant of Benson's ``outer approximation algorithm for multiple objective linear programming
A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives
Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations
Benson type algorithms for linear vector optimization and applications
An inner approximation method to compute the weight set decomposition of a triobjective mixed-integer problem
On the completeness and constructiveness of parametric characterizations to vector optimization problems
A modified weighted Tchebycheff metric for multiple objective programming
Weighting factor extensions for finite multiple objective vector minimization problems
Algorithms for nonlinear integer bicriterion problems
Multiobjective programming and planning
The set of all nondominated solutions in linear cases and a multicriteria simplex method
An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
Outcome space partition of the weight set in multiobjective linear programming
A weight set decomposition algorithm for finding all efficient extreme points in the outcome set of a multiple objective linear program
Interactive algorithms for a broad underlying family of preference functions
Finding multi-objective supported efficient spanning trees
Evaluating solutions and solution sets under multiple objectives
An improved algorithm for solving biobjective integer programs
Multi-objective unconstrained combinatorial optimization: a polynomial bound on the number of extreme supported solutions
A Recursive Algorithm for Finding All Nondominated Extreme Points in the Outcome Set of a Multiobjective Integer Programme
Quantitative Comparison of Approximate Solution Sets for Multicriteria Optimization Problems with Weighted Tchebycheff Preference Function
The Multiobjective Discrete Optimization Problem: A Weighted Min-Max Two-Stage Optimization Approach and a Bicriteria Algorithm
An Exact Algorithm for Finding Extreme Supported Nondominated Points of Multiobjective Mixed Integer Programs
Output-Sensitive Algorithms for Enumerating the Extreme Nondominated Points of Multiobjective Combinatorial Optimization Problems
Geometric Duality in Multiple Objective Linear Programming
Bicriteria Transportation Problem
An interactive weighted Tchebycheff procedure for multiple objective programming
Multicriteria Optimization
A Class of Solutions for Group Decision Problems
An approach to determine unsupported non-dominated solutions in bicriteria integer linear programs
Analysis of the weighted Tchebycheff weight set decomposition for multiobjective discrete optimization problems

This page was built for publication: The weighted \(p\)-norm weight set decomposition for multiobjective discrete optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6614703)