Pages that link to "Item:Q1827646"
From MaRDI portal
The following pages link to A method for finding the set of non-dominated vectors for multiple objective integer linear programs (Q1827646):
Displaying 21 items.
- Enumerating the Set of Non-dominated Vectors in Multiple Objective Integer Linear Programming (Q3598043) (← links)
- Approximating the nondominated frontiers of multi‐objective combinatorial optimization problems (Q3621927) (← links)
- An algorithm for multiparametric 0-1-Integer Programming problems relative to a generalized min max objective function (Q3621972) (← links)
- Solving the Multiple Objective Integer Linear Programming Problem (Q3627676) (← links)
- Computational Results for Four Exact Methods to Solve the Three-Objective Assignment Problem (Q3649594) (← links)
- An Algorithm For Solving Multiple Objective Integer Linear Programming Problem (Q4457893) (← links)
- Incorporating Aggregate Diversity in Recommender Systems Using Scalable Optimization Approaches (Q4599312) (← links)
- Enumeration of the Nondominated Set of Multiobjective Discrete Optimization Problems (Q4995057) (← links)
- MOBILE SECONDARY IDEAL POINT AND MOMA-PLUS METHOD IN TWO-PHASE METHOD FOR SOLVING BI-OBJECTIVE ASSIGNMENT PROBLEMS (Q5036170) (← links)
- Network Models for Multiobjective Discrete Optimization (Q5086002) (← links)
- Disjunctive Programming for Multiobjective Discrete Optimisation (Q5137948) (← links)
- A linear fractional optimization over an integer efficient set (Q5247690) (← links)
- Using lexicographic parametric programming for searching a non-dominated set in multiple-objective linear programming (Q5690283) (← links)
- An approach to determine unsupported non-dominated solutions in bicriteria integer linear programs (Q5879665) (← links)
- Optimization of a linear function over an integer efficient set (Q6059580) (← links)
- A multiobjective approach for maximizing the reach or GRP of different brands in TV advertising (Q6069770) (← links)
- Effective anytime algorithm for multiobjective combinatorial optimization problems (Q6086280) (← links)
- Optimization of a quadratic programming problem over an Integer efficient set (Q6145182) (← links)
- Parallel optimization over the integer efficient set (Q6187313) (← links)
- A fast and robust algorithm for solving biobjective mixed integer programs (Q6616277) (← links)
- A simple, efficient and versatile objective space algorithm for multiobjective integer programming (Q6616283) (← links)