An Exact Algorithm for Finding Extreme Supported Nondominated Points of Multiobjective Mixed Integer Programs
From MaRDI portal
Publication:3117344
DOI10.1287/mnsc.1100.1248zbMath1232.90329OpenAlexW2105630212MaRDI QIDQ3117344
Özgür Özpeynirci, Murat M. Köksalan
Publication date: 27 February 2012
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.1100.1248
Related Items
Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems, 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, Output-Sensitive Algorithms for Enumerating the Extreme Nondominated Points of Multiobjective Combinatorial Optimization Problems, Graphical exploration of the weight space in three-objective mixed integer linear programs, Bilevel programming for generating discrete representations in multiobjective optimization, An interactive algorithm to find the most preferred solution of multi-objective integer programs, Branch-and-Bound for Biobjective Mixed-Integer Linear Programming, Exact solution approaches for integer linear generalized maximum multiplicative programs through the lens of multi-objective optimization, On nadir points of multiobjective integer programming problems, A criterion space search algorithm for mixed integer linear maximum multiplicative programs: a multiobjective optimization approach, Effective anytime algorithm for multiobjective combinatorial optimization problems, Advancements in the computation of enclosures for multi-objective optimization problems, Multi-objective unconstrained combinatorial optimization: a polynomial bound on the number of extreme supported solutions, Twenty years of continuous multiobjective optimization in the twenty-first century, Analysis of the weighted Tchebycheff weight set decomposition for multiobjective discrete optimization problems, Optimising a nonlinear utility function in multi-objective integer programming, Efficient Storage of Pareto Points in Biobjective Mixed Integer Programming, 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, PolySCIP, Finding a representative nondominated set for multi-objective mixed integer programs, Fathoming rules for biobjective mixed integer linear programs: review and extensions, Multi-objective branch and bound, The search-and-remove algorithm for biobjective mixed-integer linear programming problems, Preprocessing and cut generation techniques for multi-objective binary programming, Multi-objective integer programming: an improved recursive algorithm, Multi-objective optimization based algorithms for solving mixed integer linear minimum multiplicative programs, Characteristics of semi-convex frontier optimization, Finding multi-objective supported efficient spanning trees, Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations, Pharmacy duty scheduling problem, An extension of the non-inferior set estimation algorithm for many objectives, Multiobjective Integer Programming: Synergistic Parallel Approaches, An interactive algorithm for resource allocation with balance concerns, GoNDEF: an exact method to generate all non-dominated points of multi-objective mixed-integer linear programs, FPBH: a feasibility pump based heuristic for multi-objective mixed integer linear programming, An inner approximation method to compute the weight set decomposition of a triobjective mixed-integer problem
