An adaptive relaxation-refinement scheme for multi-objective mixed-integer nonconvex optimization
From MaRDI portal
Cites work
- A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms
- A Criterion Space Method for Biobjective Mixed Integer Programming: The Boxed Line Method
- A general branch-and-bound framework for continuous global multiobjective optimization
- A global optimization algorithm for linear fractional and bilinear programs
- A hybrid patch decomposition approach to compute an enclosure for multi-objective mixed-integer convex optimization problems
- A robust multi-objective model for healthcare resource management and location planning during pandemics
- A solver for multiobjective mixed-integer convex and nonconvex optimization
- A successive linear relaxation method for MINLPs with multivariate Lipschitz continuous nonlinearities
- Adaptive piecewise linear relaxations for enclosure computations for nonconvex multiobjective mixed-integer quadratically constrained programs
- Algorithms for generating Pareto fronts of multi-objective integer and mixed-integer programming problems
- An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs
- An approximation algorithm for multi-objective optimization problems using a box-coverage
- Bi‐objective optimization of the tactical allocation of job types to machines: mathematical modeling, theoretical analysis, and numerical tests
- Computing representations using hypervolume scalarizations
- Domain reduction techniques for global NLP and MINLP optimization
- Efficient computation of expected hypervolume improvement using box decomposition algorithms
- Global optimization using special ordered sets
- Mixed integer linear programming formulation techniques
- Mixed integer models for the stationary case of gas network optimization
- Mixed integer nonlinear programming. Selected papers based on the presentations at the IMA workshop mixed-integer nonlinear optimization: Algorithmic advances and applications, Minneapolis, MN, USA, November 17--21, 2008
- Mixed-integer nonlinear optimization
- Multicriteria Optimization
- On refinement strategies for solving \(\textsc{MINLP}\)s by piecewise linear relaxations: a generalized red refinement
- On the representation of the search region in multi-objective optimization
- Polyhedral methods for piecewise-linear functions. I: The lambda method
- Pyomo -- optimization modeling in Python
- Rigorous convex underestimators for general twice-differentiable problems
- Scalarizing vector optimization problems
- Solving mixed-integer nonlinear programmes using adaptively refined mixed-integer linear programmes
- Solving multiobjective mixed integer convex optimization problems
- Three enhancements for optimization-based bound tightening
- Using Piecewise Linear Functions for Solving MINLPs
This page was built for publication: An adaptive relaxation-refinement scheme for multi-objective mixed-integer nonconvex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7402749)
