On the exactness of the \(\varepsilon\)-constraint method for biobjective nonlinear integer programming
From MaRDI portal
Publication:2157908
DOI10.1016/j.orl.2022.04.007OpenAlexW4224442561MaRDI QIDQ2157908
Gabriele Eichfelder, Daniele Patria, Marianna De Santis
Publication date: 22 July 2022
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2022.04.007
integer programmingmultiobjective optimization\(\varepsilon\)-constraint algorithmcriterion space algorithms
Cites Work
- Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations
- Scalarizations for adaptively solving multi-objective optimization problems
- Equity portfolio construction and selection using multiobjective mathematical programming
- Equal risk bounding is better than risk parity for portfolio selection
- A Frank-Wolfe based branch-and-bound algorithm for mean-risk optimization
- Multi-objective branch and bound
- BARON: A general purpose global optimization software package
- An exact parallel objective space decomposition algorithm for solving multi-objective integer programming problems
- Branching with hyperplanes in the criterion space: the frontier partitioner algorithm for biobjective integer programming
- A new method for mean-variance portfolio optimization with cardinality constraints
- An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
- An exact algorithm for biobjective integer programming problems
- A decision space algorithm for multiobjective convex quadratic integer optimization
- Enumeration of the Nondominated Set of Multiobjective Discrete Optimization Problems
- Solving Multiobjective Mixed Integer Convex Optimization Problems
- Multicriteria Optimization
- Benchmarking optimization software with performance profiles.
- Twenty years of continuous multiobjective optimization in the twenty-first century
This page was built for publication: On the exactness of the \(\varepsilon\)-constraint method for biobjective nonlinear integer programming
