A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs
From MaRDI portal
Publication:872117
DOI10.1016/j.ejor.2006.02.049zbMath1122.90055OpenAlexW2117538883MaRDI QIDQ872117
Publication date: 27 March 2007
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2006.02.049
Mixed integer programming (90C11) Multi-objective and goal programming (90C29) Sensitivity, stability, parametric optimization (90C31)
Related Items
A multiple objective methodology for sugarcane harvest management with varying maturation periods, Dynamic programming algorithms for the bi-objective integer knapsack problem, Towards a multi-objective performance assessment and optimization model of a two-echelon supply chain using SCOR metrics, An algorithm for optimizing a linear function over an integer efficient set, On the representation of the search region in multi-objective optimization, A multi-criteria approach for hospital capacity analysis, Bilevel programming for generating discrete representations in multiobjective optimization, A multi-objective military system of systems architecting problem with inflexible and flexible systems: formulation and solution methods, Representation of the non-dominated set in biobjective discrete optimization, On the quality of discrete representations in multiple objective programming, Finding all nondominated points of multi-objective integer programs, Distribution based representative sets for multi-objective integer programs, Computing representations using hypervolume scalarizations, Effective anytime algorithm for multiobjective combinatorial optimization problems, Optimization Over Stochastic Integer Efficient Set, Generating equidistant representations in biobjective programming, Representing the nondominated set in multi-objective mixed-integer programs, Finding a representative nondominated set for multi-objective mixed integer programs, An improved algorithm to compute the \(\omega\)-primality, A simple augmented \(\epsilon\)-constraint method for multi-objective mathematical integer programming problems, An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems, Enumerating the Set of Non-dominated Vectors in Multiple Objective Integer Linear Programming, A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method, An algorithm for multiparametric 0-1-Integer Programming problems relative to a generalized min max objective function, Equidistant representations: connecting coverage and uniformity in discrete biobjective optimization, Optimization of a linear function over the set of stochastic efficient solutions, A Method for Generating a Well-Distributed Pareto Set in Multiple Objective Mixed Integer Linear Programs Based on the Decision Maker’s Initial Aspiration Level, Multi-objective integer programming: a general approach for generating all non-dominated solutions, A linear fractional optimization over an integer efficient set, A flexible reference point-based multi-objective evolutionary algorithm: an application to the UAV route planning problem, The augmented weighted Tchebychev norm for optimizing a linear function over an integer efficient set of a multicriteria linear program, New \(\epsilon\)-constraint methods for multi-objective integer linear programming: a Pareto front representation approach, A reduction dynamic programming algorithm for the bi-objective integer knapsack problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Zero-one programming with multiple criteria
- An algorithm for the multiple objective integer linear programming problem
- A general method for determining the set of all efficient solutions to a linear vectormaximum problem
- Generating all maximal efficient faces for multiple objective linear programs
- A branch and bound algorithm for mixed zero-one multiple objective linear programming
- An interactive procedure for multiple objective integer linear programming problems
- Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming
- An interactive reference point approach for multiobjective mixed-integer programming using branch-and-bound
- A method for finding the set of non-dominated vectors for multiple objective integer linear programs
- A Procedure to Find Discrete Representations of the Efficient Set with Specified Coverage Errors
- The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program
- Linear multiple objective programs with zero–one variables
- Multi‐objective combinatorial optimization problems: A survey
