A test instance generator for multiobjective mixed-integer optimization
From MaRDI portal
Publication:6616284
DOI10.1007/S00186-023-00826-ZMaRDI QIDQ6616284
Leo Warnow, Gabriele Eichfelder, Tobias Gerlach
Publication date: 9 October 2024
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Nonlinear programming (90C30)
Cites Work
- Title not available (Why is that?)
- Bi-objective optimisation over a set of convex sub-problems
- On the exactness of the \(\varepsilon\)-constraint method for biobjective nonlinear integer programming
- Branching with hyperplanes in the criterion space: the frontier partitioner algorithm for biobjective integer programming
- GoNDEF: an exact method to generate all non-dominated points of multi-objective mixed-integer linear programs
- A criterion space search algorithm for biobjective mixed integer programming: the triangle splitting method
- An adaptive patch approximation algorithm for bicriteria convex mixed-integer problems
- Solving Multiobjective Mixed Integer Convex Optimization Problems
- A Criterion Space Method for Biobjective Mixed Integer Programming: The Boxed Line Method
- Advancements in the computation of enclosures for multi-objective optimization problems
Related Items (2)
Special issue on exact and approximation methods for mixed-integer multi-objective optimization ⋮ A hybrid patch decomposition approach to compute an enclosure for multi-objective mixed-integer convex optimization problems
This page was built for publication: A test instance generator for multiobjective mixed-integer optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6616284)
