Finding all nondominated points of multi-objective integer programs

DOI10.1007/s10898-012-9955-7zbMath1315.90008OpenAlexW2041513149MaRDI QIDQ377734

Banu Lokman, Murat M. 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

zbMATH Keywords

combinatorial optimizationmultiple criterianondominated point

Mathematics Subject Classification ID

Integer programming (90C10) Multi-objective and goal programming (90C29) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Related Items (44)

SASS: slicing with adaptive steps search method for finding the non-dominated points of tri-objective mixed-integer linear programming problems ⋮ A branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: a bi-objective optimization approach ⋮ The \(L\)-shape search method for triobjective integer programming ⋮ On the representation of the search region in multi-objective optimization ⋮ A multi-criteria approach for hospital capacity analysis ⋮ 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 ⋮ An interactive approximation algorithm for multi-objective integer programs ⋮ Nondominated Nash points: application of biobjective mixed integer programming ⋮ An interactive algorithm to find the most preferred solution of multi-objective integer programs ⋮ Branch-and-Bound for Biobjective Mixed-Integer Linear Programming ⋮ Network Models for Multiobjective Discrete Optimization ⋮ A Criterion Space Branch-and-Cut Algorithm for Mixed Integer Bilinear Maximum Multiplicative Programs ⋮ Distribution based representative sets for multi-objective integer programs ⋮ Split algorithms for multiobjective integer programming problems ⋮ On nadir points of multiobjective integer programming problems ⋮ Exact method based on solution space cut for bi-objective Seru production ⋮ A multiobjective approach for maximizing the reach or GRP of different brands in TV advertising ⋮ A criterion space search algorithm for mixed integer linear maximum multiplicative programs: a multiobjective optimization approach ⋮ Effective anytime algorithm for multiobjective combinatorial optimization problems ⋮ Optimizing a linear function over the nondominated set of multiobjective integer programs ⋮ Incorporating Aggregate Diversity in Recommender Systems Using Scalable Optimization Approaches ⋮ Parallel optimization over the integer efficient set ⋮ Disjunctive Programming for Multiobjective Discrete Optimisation ⋮ A New Exact Algorithm to Optimize a Linear Function over the Set of Efficient Solutions for Biobjective Mixed Integer Linear Programs ⋮ An exact and polynomial approach for a bi-objective integer programming problem regarding network flow routing ⋮ Representing the nondominated set in multi-objective mixed-integer programs ⋮ Finding a representative nondominated set for multi-objective mixed integer programs ⋮ Fathoming rules for biobjective mixed integer linear programs: review and extensions ⋮ Binary decision diagrams for generating and storing non-dominated project portfolios with interval-valued project scores ⋮ The quadrant shrinking method: a simple and efficient algorithm for solving tri-objective integer programs ⋮ A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs ⋮ Preprocessing and cut generation techniques for multi-objective binary programming ⋮ An exact parallel objective space decomposition algorithm for solving multi-objective integer programming problems ⋮ Multi-objective optimization based algorithms for solving mixed integer linear minimum multiplicative programs ⋮ 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 ⋮ Empirical study of exact algorithms for the multi-objective spanning tree ⋮ Multiobjective Integer Programming: Synergistic Parallel Approaches ⋮ Enumeration of the Nondominated Set of Multiobjective Discrete Optimization Problems ⋮ GoNDEF: an exact method to generate all non-dominated points of multi-objective mixed-integer linear programs ⋮ A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems ⋮ Finding nadir points in multi-objective integer programs

Cites Work

• Unnamed Item
• A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives
• 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
• Efficient spanning trees
• Multicriteria branch and bound: a vector maximization algorithm for mixed 0-1 multiple objective linear programming
• A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs
• Multi-objective integer programming: a general approach for generating all non-dominated solutions
• A multicriteria Pareto-optimal path algorithm
• Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
• The problem of the optimal biobjective spanning tree
• A method for finding the set of non-dominated vectors for multiple objective integer linear programs
• A survey and annotated bibliography of multiobjective combinatorial optimization
• Computing all efficient solutions of the biobjective minimum spanning tree problem
• Core problems in bi-criteria \(\{0,1\}\)-knapsack problems
• An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
• An Interactive Evolutionary Metaheuristic for Multiobjective Combinatorial Optimization
• Approximating the nondominated frontiers of multi‐objective combinatorial optimization problems
• MOSA method: a tool for solving multiobjective combinatorial optimization problems
• A heuristic approach to bicriteria scheduling
• Label correcting methods to solve multicriteria shortest path problems

This page was built for publication: Finding all nondominated points of multi-objective integer programs