A method for finding the set of non-dominated vectors for multiple objective integer linear programs
From MaRDI portal
Publication:1827646
Recommendations
- Enumerating the Set of Non-dominated Vectors in Multiple Objective Integer Linear Programming
- A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs
- Efficient cuts for generating the non-dominated vectors for Multiple Objective Integer Linear Programming
- Finding all nondominated points of multi-objective integer programs
- scientific article; zbMATH DE number 3873105
Cites work
- scientific article; zbMATH DE number 4085440 (Why is no real title available?)
- scientific article; zbMATH DE number 3999655 (Why is no real title available?)
- A contraction for the multiparametric integer linear programming problem
- A reduction algorithm for integer multiple objective linear programs
- An Algorithm for Multiobjective Zero-One Linear Programming
- An algorithm for the bi-criterion integer programming problem
- An algorithm for the multiple objective integer linear programming problem
- Efficiency and Optimality in Minisum, Minimax 0-1 Programming Problems
- Linear multiple objective programs with zero–one variables
- Multicriteria integer programming: A (hybrid) dynamic programming recursive approach
- Multi‐objective combinatorial optimization problems: A survey
- Solving zero-one multiple objective programs through implicit enumeration
- The design of multiactivity multifacility systems
- Using DEA to obtain efficient solutions for multi-objective 0--1 linear programs
- Zero-one programming with multiple criteria
Cited in
(72)- A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs
- Warm-starting lower bound set computations for branch-and-bound algorithms for multi objective integer linear programs
- Multiobjective integer nonlinear fractional programming problem: a cutting plane approach
- Optimising a nonlinear utility function in multi-objective integer programming
- Solving multiobjective programming problems by discrete representation
- Disjunctive Programming for Multiobjective Discrete Optimisation
- An Algorithm For Solving Multiple Objective Integer Linear Programming Problem
- 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
- Solving the Multiple Objective Integer Linear Programming Problem
- Solution approaches for equitable multiobjective integer programming problems
- Multiple objective branch and bound for mixed 0-1 linear programming: corrections and improvements for the biobjective case
- scientific article; zbMATH DE number 1784652 (Why is no real title available?)
- A new method for optimizing a linear function over the efficient set of a multiobjective integer program
- Efficient cuts for generating the non-dominated vectors for Multiple Objective Integer Linear Programming
- A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives
- An extension of the non-inferior set estimation algorithm for many objectives
- An algorithm for optimizing a linear function over an integer efficient set
- Efficient computation of the search region in multi-objective optimization
- A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems
- An improved algorithm to compute the \(\omega\)-primality
- The augmented weighted Tchebychev norm for optimizing a linear function over an integer efficient set of a multicriteria linear program
- An exact parallel objective space decomposition algorithm for solving multi-objective integer programming problems
- Enumeration of the Nondominated Set of Multiobjective Discrete Optimization Problems
- A reduction dynamic programming algorithm for the bi-objective integer knapsack problem
- 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
- A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems
- A multiple objective methodology for sugarcane harvest management with varying maturation periods
- Computational Results for Four Exact Methods to Solve the Three-Objective Assignment Problem
- An exact method for optimizing a quadratic function over the efficient set of multiobjective integer linear fractional program
- Finding all nondominated points of multi-objective integer programs
- Enumerating the Set of Non-dominated Vectors in Multiple Objective Integer Linear Programming
- The quadrant shrinking method: a simple and efficient algorithm for solving tri-objective integer programs
- Incorporating Aggregate Diversity in Recommender Systems Using Scalable Optimization Approaches
- Network Models for Multiobjective Discrete Optimization
- Towards a multi-objective performance assessment and optimization model of a two-echelon supply chain using SCOR metrics
- Multi-objective integer programming: an improved recursive algorithm
- Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations
- A review of interactive methods for multiobjective integer and mixed-integer programming
- An interior proximal method in vector optimization
- A simple augmented \(\epsilon\)-constraint method for multi-objective mathematical integer programming problems
- Effective algorithm to construct the set of nondominated alternatives of decomposable objects
- Branching with hyperplanes in the criterion space: the frontier partitioner algorithm for biobjective integer programming
- Empirical study of exact algorithms for the multi-objective spanning tree
- GoNDEF: an exact method to generate all non-dominated points of multi-objective mixed-integer linear programs
- A recursive algorithm for finding all nondominated extreme points in the outcome set of a multiobjective integer programme
- New \(\epsilon\)-constraint methods for multi-objective integer linear programming: a Pareto front representation approach
- An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems
- A multi-objective military system of systems architecting problem with inflexible and flexible systems: formulation and solution methods
- Finding a representative nondominated set for multi-objective mixed integer programs
- Distribution based representative sets for multi-objective integer programs
- Variants of the \(\varepsilon\)-constraint method for biobjective integer programming problems: application to \(p\)-median-cover problems
- A linear fractional optimization over an integer efficient set
- The \(L\)-shape search method for triobjective integer programming
- Dynamic programming algorithms for the bi-objective integer knapsack problem
- Multi-objective integer programming: a general approach for generating all non-dominated solutions
- Optimization of a linear function over an integer efficient set
- Approximating the nondominated frontiers of multi‐objective combinatorial optimization problems
- Split algorithms for multiobjective integer programming problems
- 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
- scientific article; zbMATH DE number 721859 (Why is no real title available?)
- Identifying efficient solutions in multiple objective integer monotone programs
- Optimization of a quadratic programming problem over an Integer efficient set
- A fast and robust algorithm for solving biobjective mixed integer programs
- A simple, efficient and versatile objective space algorithm for multiobjective integer programming
- Effective anytime algorithm for multiobjective combinatorial optimization problems
- A multiobjective approach for maximizing the reach or GRP of different brands in TV advertising
- MOBILE SECONDARY IDEAL POINT AND MOMA-PLUS METHOD IN TWO-PHASE METHOD FOR SOLVING BI-OBJECTIVE ASSIGNMENT PROBLEMS
- An approach to determine unsupported non-dominated solutions in bicriteria integer linear programs
- Branch-and-bound and objective branching with three or more objectives
- Parallel optimization over the integer efficient set
This page was built for publication: A method for finding the set of non-dominated vectors for multiple objective integer linear programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1827646)
