An adaptive patch approximation algorithm for bicriteria convex mixed-integer problems
From MaRDI portal
Publication:5055294
DOI10.1080/02331934.2021.1939699OpenAlexW3172965851MaRDI QIDQ5055294
Publication date: 13 December 2022
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2021.1939699
Mixed integer programming (90C11) Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (1)
Uses Software
Cites Work
- Multiple objective branch and bound for mixed 0-1 linear programming: corrections and improvements for the biobjective case
- On the quality of discrete representations in multiple objective programming
- Hypervolume-based multiobjective optimization: theoretical foundations and practical implications
- Adaptive weighted sum method for multiobjective optimization: a new method for Pareto front generation
- Multicriteria branch and bound: a vector maximization algorithm for mixed 0-1 multiple objective linear programming
- Tractable approximate robust geometric programming
- Scalarizations for adaptively solving multi-objective optimization problems
- \(\epsilon\)-solutions in vector minimization problems
- Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes
- Approximation of convex bodies by polytopes
- The convergence rate of the sandwich algorithm for approximating convex functions
- A branch and bound algorithm for mixed zero-one multiple objective linear programming
- Fathoming rules for biobjective mixed integer linear programs: review and extensions
- A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs
- A one direction search method to find the exact nondominated frontier of biobjective mixed-binary linear programming problems
- Approximate Pareto sets of minimal size for multi-objective optimization problems
- On the Lambert \(w\) function
- A new technique for analyzing substructures in arrangements of piecewise linear surfaces
- Bi-objective optimisation over a set of convex sub-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
- An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
- Efficiently computing succinct trade-off curves
- Approximation methods in multiobjective programming
- A Criterion Space Search Algorithm for Biobjective Mixed Integer Programming: The Triangle Splitting Method
- An approximation method for the efficiency set of multiobjective programming problems
- Approximating the Pareto Front of Multi-criteria Optimization Problems
- Solving Multiobjective Mixed Integer Convex Optimization Problems
- A Criterion Space Method for Biobjective Mixed Integer Programming: The Boxed Line Method
- Multicriteria Optimization
This page was built for publication: An adaptive patch approximation algorithm for bicriteria convex mixed-integer problems
