A method for finding the set of non-dominated vectors for multiple objective integer linear programs
From MaRDI portal
Publication:1827646
DOI10.1016/S0377-2217(03)00255-8zbMath1061.90103MaRDI QIDQ1827646
Publication date: 6 August 2004
Published in: European Journal of Operational Research (Search for Journal in Brave)
Integer programming (90C10) Multi-objective and goal programming (90C29) Sensitivity, stability, parametric optimization (90C31)
Related Items (61)
An exact method for optimizing a quadratic function over the efficient set of multiobjective integer linear fractional program ⋮ A multiple objective methodology for sugarcane harvest management with varying maturation periods ⋮ MOBILE SECONDARY IDEAL POINT AND MOMA-PLUS METHOD IN TWO-PHASE METHOD FOR SOLVING BI-OBJECTIVE ASSIGNMENT PROBLEMS ⋮ An exact scalarization method with multiple reference points for bi-objective integer linear optimization problems ⋮ SASS: slicing with adaptive steps search method for finding the non-dominated points of tri-objective mixed-integer linear programming problems ⋮ The \(L\)-shape search method for triobjective integer programming ⋮ 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 ⋮ Solution approaches for equitable multiobjective integer programming problems ⋮ A multi-objective military system of systems architecting problem with inflexible and flexible systems: formulation and solution methods ⋮ Multiple objective branch and bound for mixed 0-1 linear programming: corrections and improvements for the biobjective case ⋮ A review of interactive methods for multiobjective integer and mixed-integer programming ⋮ A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs ⋮ Network Models for Multiobjective Discrete Optimization ⋮ Finding all nondominated points of multi-objective integer programs ⋮ Distribution based representative sets for multi-objective integer programs ⋮ Split algorithms for multiobjective integer programming problems ⋮ Warm-starting lower bound set computations for branch-and-bound algorithms for multi objective integer linear programs ⋮ Branch-and-bound and objective branching with three or more objectives ⋮ Optimization of a linear function over an integer efficient set ⋮ A multiobjective approach for maximizing the reach or GRP of different brands in TV advertising ⋮ Effective anytime algorithm for multiobjective combinatorial optimization problems ⋮ Multiobjective integer nonlinear fractional programming problem: a cutting plane approach ⋮ Optimization of a quadratic programming problem over an Integer efficient set ⋮ Incorporating Aggregate Diversity in Recommender Systems Using Scalable Optimization Approaches ⋮ Parallel optimization over the integer efficient set ⋮ A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives ⋮ An interior proximal method in vector optimization ⋮ Optimising a nonlinear utility function in multi-objective integer programming ⋮ Disjunctive Programming for Multiobjective Discrete Optimisation ⋮ Finding a representative nondominated set for multi-objective mixed integer programs ⋮ Variants of the \(\varepsilon\)-constraint method for biobjective integer programming problems: application to \(p\)-median-cover problems ⋮ Efficient computation of the search region in multi-objective optimization ⋮ The quadrant shrinking method: a simple and efficient algorithm for solving tri-objective integer programs ⋮ A new method for optimizing a linear function over the efficient set of a multiobjective integer program ⋮ An improved algorithm to compute the \(\omega\)-primality ⋮ Multi-objective integer programming: an improved recursive algorithm ⋮ A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems ⋮ 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 ⋮ An exact parallel objective space decomposition algorithm for solving multi-objective integer programming problems ⋮ Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations ⋮ Branching with hyperplanes in the criterion space: the frontier partitioner algorithm for biobjective integer programming ⋮ A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method ⋮ Approximating the nondominated frontiers of multi‐objective combinatorial optimization problems ⋮ An algorithm for multiparametric 0-1-Integer Programming problems relative to a generalized min max objective function ⋮ Solving the Multiple Objective Integer Linear Programming Problem ⋮ Empirical study of exact algorithms for the multi-objective spanning tree ⋮ An extension of the non-inferior set estimation algorithm for many objectives ⋮ 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 ⋮ Computational Results for Four Exact Methods to Solve the Three-Objective Assignment Problem ⋮ Enumeration of the Nondominated Set of Multiobjective Discrete Optimization Problems ⋮ Multi-objective integer programming: a general approach for generating all non-dominated solutions ⋮ GoNDEF: an exact method to generate all non-dominated points of multi-objective mixed-integer linear programs ⋮ A linear fractional optimization over an integer efficient set ⋮ A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems ⋮ 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
- An algorithm for the bi-criterion integer programming problem
- Zero-one programming with multiple criteria
- An algorithm for the multiple objective integer linear programming problem
- The design of multiactivity multifacility systems
- A reduction algorithm for integer multiple objective linear programs
- A contraction for the multiparametric integer linear programming problem
- Using DEA to obtain efficient solutions for multi-objective 0--1 linear programs
- Solving zero-one multiple objective programs through implicit enumeration
- An Algorithm for Multiobjective Zero-One Linear Programming
- Efficiency and Optimality in Minisum, Minimax 0-1 Programming Problems
- Multicriteria integer programming: A (hybrid) dynamic programming recursive approach
- Linear multiple objective programs with zero–one variables
- Multi‐objective combinatorial optimization problems: A survey
This page was built for publication: A method for finding the set of non-dominated vectors for multiple objective integer linear programs
