A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems

DOI10.1007/s10898-014-0205-zzbMath1338.90369arXiv1305.5266OpenAlexW1974080590MaRDI QIDQ2342947

Kerstin Dächert, Kathrin Klamroth

Publication date: 30 April 2015

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1305.5266

zbMATH Keywords

scalarizationbox algorithmdiscrete tricriteria optimization

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Sensitivity, stability, parametric optimization (90C31) Combinatorial optimization (90C27)

Related Items (32)

The \(L\)-shape search method for triobjective integer programming ⋮ An approximation algorithm for multi-objective optimization problems using a box-coverage ⋮ An adaptive patch approximation algorithm for bicriteria convex mixed-integer problems ⋮ On the representation of the search region in multi-objective optimization ⋮ Bilevel programming for generating discrete representations in multiobjective optimization ⋮ A multi-objective military system of systems architecting problem with inflexible and flexible systems: formulation and solution methods ⋮ A box decomposition algorithm to compute the hypervolume indicator ⋮ An interactive approximation algorithm for multi-objective integer programs ⋮ Branch-and-Bound for Biobjective Mixed-Integer Linear Programming ⋮ Network Models for Multiobjective Discrete Optimization ⋮ Distribution based representative sets for multi-objective integer programs ⋮ Split algorithms for multiobjective integer programming problems ⋮ Branch-and-bound and objective branching with three or more objectives ⋮ Algorithms for generating Pareto fronts of multi-objective integer and mixed-integer programming problems ⋮ A criterion space decomposition approach to generalized tri-objective tactical resource allocation ⋮ Effective anytime algorithm for multiobjective combinatorial optimization problems ⋮ Optimizing a linear function over the nondominated set of multiobjective integer programs ⋮ Outer approximation algorithms for convex vector optimization problems ⋮ Monomial Tropical Cones for Multicriteria Optimization ⋮ A Feasibility Pump and Local Search Based Heuristic for Bi-Objective Pure Integer Linear Programming ⋮ A New Exact Algorithm to Optimize a Linear Function over the Set of Efficient Solutions for Biobjective Mixed Integer Linear Programs ⋮ Representing the nondominated set in multi-objective mixed-integer programs ⋮ A coverage-based box-algorithm to compute a representation for optimization problems with three objective functions ⋮ Finding a representative nondominated set for multi-objective mixed integer programs ⋮ Efficient computation of the search region in multi-objective optimization ⋮ A bicriteria perspective on \(L\)-penalty approaches -- a corrigendum to Siddiqui and Gabriel's \(L\)-penalty approach for solving MPECs ⋮ An exact parallel objective space decomposition algorithm for solving multi-objective integer programming problems ⋮ Half-open polyblock for the representation of the search region in multiobjective optimization problems: its application and computational aspects ⋮ Multiobjective Integer Programming: Synergistic Parallel Approaches ⋮ Comments on: ``Static and dynamic source locations in undirected networks ⋮ FPBH: a feasibility pump based heuristic for multi-objective mixed integer linear programming ⋮ Decomposition of loosely coupled integer programs: a multiobjective perspective

Uses Software

• MOIP_AIRA

Cites Work

• Unnamed Item
• Unnamed Item
• An augmented weighted Tchebycheff method with adaptively chosen parameters for discrete bicriteria optimization problems
• Finding all nondominated points of multi-objective integer programs
• A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives
• Multi-objective integer programming: a general approach for generating all non-dominated solutions
• An algorithm for the bi-criterion integer programming problem
• Algorithms for nonlinear integer bicriterion problems
• An algorithm for the multiple objective integer linear programming problem
• Generating the noninferior set in mixed integer biobjective linear programs: An application to a location problem
• Nonlinear multiobjective optimization
• Computation of ideal and Nadir values and implications for their use in MCDM methods.
• A method for finding the set of non-dominated vectors for multiple objective integer linear programs
• Multi-objective integer programming: an improved recursive algorithm
• A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems
• \(K\)-PPM: a new exact method to solve multi-objective combinatorial optimization problems
• An improved algorithm for solving biobjective integer programs
• Finding representative systems for discrete bicriterion optimization problems
• An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
• The Multiobjective Discrete Optimization Problem: A Weighted Min-Max Two-Stage Optimization Approach and a Bicriteria Algorithm
• Bicriteria Transportation Problem
• An interactive weighted Tchebycheff procedure for multiple objective programming
• Multicriteria Optimization

This page was built for publication: A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems