Half-open polyblock for the representation of the search region in multiobjective optimization problems: its application and computational aspects
DOI10.1007/s10288-020-00430-5zbMath1471.90127OpenAlexW3009841423MaRDI QIDQ2040606
Hoai An Le Thi, Pham Thi Hoai, Nguyen Canh Nam
Publication date: 14 July 2021
Published in: 4OR (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10288-020-00430-5
multiobjective programming\(\varepsilon\)-constraint methodmonotonic optimizationweighted sum scalarizationmulti-service outsourcing problemmultiobjective assignment problemmultiobjective discrete programmingmultiobjective knapsack problem
Multi-objective and goal programming (90C29) Fixed-point theorems (47H10) Set-valued operators (47H04)
Related Items (1)
Cites Work
- On the representation of the search region in multi-objective optimization
- A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives
- A unified monotonic approach to generalized linear fractional programming
- Normal sets, polyblocks, and monotonic optimization
- Efficient computation of the search region in multi-objective optimization
- Monotonic optimization for sensor cover energy problem
- Monotonic optimization based decoding for linear codes
- 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
- Monotonic Optimization: Problems and Solution Approaches
- Robust Monotonic Optimization Framework for Multicell MISO Systems
- Multicriteria Optimization
- Discrete Monotonic Optimization with Application to a Discrete Location Problem
This page was built for publication: Half-open polyblock for the representation of the search region in multiobjective optimization problems: its application and computational aspects
