Finding all nondominated points of multi-objective integer programs
From MaRDI portal
Publication:377734
DOI10.1007/S10898-012-9955-7zbMATH Open1315.90008OpenAlexW2041513149MaRDI QIDQ377734FDOQ377734
Authors: Banu Lokman, Murat Köksalan 
Publication date: 7 November 2013
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-012-9955-7
Recommendations
- A recursive algorithm for finding all nondominated extreme points in the outcome set of a multiobjective integer programme
- An exact algorithm for finding extreme supported nondominated points of multiobjective mixed integer programs
- Finding non dominated points for multiobjective integer convex programs with linear constraints
- Finding nadir points in multi-objective integer programs
- On nadir points of multiobjective integer programming problems
Multi-objective and goal programming (90C29) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Integer programming (90C10)
Cites Work
- Title not available (Why is that?)
- Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
- A survey and annotated bibliography of multiobjective combinatorial optimization
- An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
- A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives
- Multicriteria branch and bound: a vector maximization algorithm for mixed 0-1 multiple objective linear programming
- Multi-objective integer programming: a general approach for generating all non-dominated solutions
- A multicriteria Pareto-optimal path algorithm
- A method for finding the set of non-dominated vectors for multiple objective integer linear programs
- Core problems in bi-criteria \(\{0,1\}\)-knapsack problems
- An interactive evolutionary metaheuristic for multiobjective combinatorial optimization
- Approximating the nondominated frontiers of multi‐objective combinatorial optimization problems
- Using the idea of expanded core for the exact solution of bi-objective multi-dimensional knapsack problems
- Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors.
- On a multicriteria shortest path problem
- A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs
- MOSA method: a tool for solving multiobjective combinatorial optimization problems
- Label correcting methods to solve multicriteria shortest path problems
- A heuristic approach to bicriteria scheduling
- The problem of the optimal biobjective spanning tree
- Computing all efficient solutions of the biobjective minimum spanning tree problem
- Efficient spanning trees
Cited In (53)
- Exact method based on solution space cut for bi-objective Seru production
- A simple, efficient and versatile objective space algorithm for multiobjective integer programming
- Parallel optimization over the integer efficient set
- Effective anytime algorithm for multiobjective combinatorial optimization problems
- A Criterion Space Branch-and-Cut Algorithm for Mixed Integer Bilinear Maximum Multiplicative Programs
- SASS: slicing with adaptive steps search method for finding the non-dominated points of tri-objective mixed-integer linear programming problems
- Enumeration of the Nondominated Set of Multiobjective Discrete Optimization Problems
- A recursive algorithm for finding all nondominated extreme points in the outcome set of a multiobjective integer programme
- A criterion space search algorithm for mixed integer linear maximum multiplicative programs: a multiobjective optimization approach
- Distribution based representative sets for 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
- A multiobjective approach for maximizing the reach or GRP of different brands in TV advertising
- Multiobjective Integer Programming: Synergistic Parallel Approaches
- A branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: a bi-objective optimization approach
- Binary decision diagrams for generating and storing non-dominated project portfolios with interval-valued project scores
- A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs
- Preprocessing and cut generation techniques for multi-objective binary programming
- Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations
- Finding a representative nondominated set for multi-objective mixed integer programs
- The \(L\)-shape search method for triobjective integer programming
- Branching with hyperplanes in the criterion space: the frontier partitioner algorithm for biobjective integer programming
- Branch-and-Bound for Biobjective Mixed-Integer Linear Programming
- On the number of non-dominated points of a multicriteria optimization problem
- GoNDEF: an exact method to generate all non-dominated points of multi-objective mixed-integer linear programs
- On the representation of the search region in multi-objective optimization
- An exact algorithm for finding extreme supported nondominated points of multiobjective mixed integer programs
- Nondominated Nash points: application of biobjective mixed integer programming
- Empirical study of exact algorithms for the multi-objective spanning tree
- Multi-objective integer programming: a general approach for generating all non-dominated solutions
- Solution approaches for equitable multiobjective integer programming problems
- A multi-criteria approach for hospital capacity analysis
- Network Models for Multiobjective Discrete Optimization
- A multi-objective military system of systems architecting problem with inflexible and flexible systems: formulation and solution methods
- Split algorithms for multiobjective integer programming problems
- Multi-objective optimization based algorithms for solving mixed integer linear minimum multiplicative programs
- Fathoming rules for biobjective mixed integer linear programs: review and extensions
- Incorporating Aggregate Diversity in Recommender Systems Using Scalable Optimization Approaches
- A method for finding the set of non-dominated vectors for multiple objective integer linear programs
- An interactive algorithm to find the most preferred solution of multi-objective integer programs
- Finding non dominated points for multiobjective integer convex programs with linear constraints
- Representing the nondominated set in multi-objective mixed-integer programs
- An exact parallel objective space decomposition algorithm for solving multi-objective integer programming problems
- On nadir points of multiobjective integer programming problems
- A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems
- A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems
- An exact and polynomial approach for a bi-objective integer programming problem regarding network flow routing
- Disjunctive Programming for Multiobjective Discrete Optimisation
- Finding nadir points in multi-objective integer programs
- A criterion space search algorithm for biobjective integer programming: the balanced box method
- Optimizing a linear function over the nondominated set of multiobjective integer programs
- A New Exact Algorithm to Optimize a Linear Function over the Set of Efficient Solutions for Biobjective Mixed Integer Linear Programs
- An interactive approximation algorithm for multi-objective integer programs
This page was built for publication: Finding all nondominated points of multi-objective integer programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q377734)
