Solving Multiobjective Mixed Integer Convex Optimization Problems
From MaRDI portal
Publication:5131967
DOI10.1137/19M1264709zbMath1453.90139OpenAlexW2966382902MaRDI QIDQ5131967
Julia Niebling, Gabriele Eichfelder, Stefan Rocktäschel, Marianna De Santis
Publication date: 9 November 2020
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/19m1264709
Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29)
Related Items (16)
Geometric Duality Results and Approximation Algorithms for Convex Vector Optimization Problems ⋮ Bi-objective design-for-control of water distribution networks with global bounds ⋮ An adaptive patch approximation algorithm for bicriteria convex mixed-integer problems ⋮ A norm minimization-based convex vector optimization algorithm ⋮ On the exactness of the \(\varepsilon\)-constraint method for biobjective nonlinear integer programming ⋮ Finding non dominated points for multiobjective integer convex programs with linear constraints ⋮ Branch-and-Bound for Biobjective Mixed-Integer Linear Programming ⋮ A decision space algorithm for multiobjective convex quadratic integer optimization ⋮ Branch-and-bound and objective branching with three or more objectives ⋮ Algorithms for generating Pareto fronts of multi-objective integer and mixed-integer programming problems ⋮ Algorithms to Solve Unbounded Convex Vector Optimization Problems ⋮ Advancements in the computation of enclosures for multi-objective optimization problems ⋮ Twenty years of continuous multiobjective optimization in the twenty-first century ⋮ Bounds and convex heuristics for bi-objective optimal experiment design in water networks ⋮ Adaptive piecewise linear relaxations for enclosure computations for nonconvex multiobjective mixed-integer quadratically constrained programs ⋮ Bi-objective optimisation over a set of convex sub-problems
Uses Software
Cites Work
- Unnamed Item
- The \(L\)-shape search method for triobjective integer programming
- On the representation of the search region in multi-objective optimization
- Editorial: Multiple criteria decision making in emergency management
- An exact algorithm for biobjective mixed integer linear programming problems
- A new scalarization technique to approximate Pareto fronts of problems with disconnected feasible sets
- Primal and dual approximation algorithms for convex vector optimization problems
- An approximation algorithm for convex multi-objective programming problems
- Multicriteria branch and bound: a vector maximization algorithm for mixed 0-1 multiple objective linear programming
- SASS: slicing with adaptive steps search method for finding the non-dominated points of tri-objective mixed-integer linear programming problems
- Bound sets for biobjective combinatorial optimization problems
- Equity portfolio construction and selection using multiobjective mathematical programming
- A feasibility pump for mixed integer nonlinear programs
- A branch and bound algorithm for mixed zero-one multiple objective linear programming
- A branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: a bi-objective optimization approach
- The quadrant shrinking method: a simple and efficient algorithm for solving tri-objective integer programs
- A new method for optimizing a linear function over the efficient set of a multiobjective integer program
- 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
- The feasibility pump
- A Criterion Space Search Algorithm for Biobjective Mixed Integer Programming: The Triangle Splitting Method
- A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method
- A New Class of Functions for Measuring Solution Integrality in the Feasibility Pump Approach
- A Multiobjective Branch-and-Bound Framework: Application to the Biobjective Spanning Tree Problem
- A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization
- A New Approach to the Feasibility Pump in Mixed Integer Programming
- A Criterion Space Method for Biobjective Mixed Integer Programming: The Boxed Line Method
- A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization
- A New Scalarization Technique and New Algorithms to Generate Pareto Fronts
- Penalty Alternating Direction Methods for Mixed-Integer Optimization: A New View on Feasibility Pumps
- The Triangle Splitting Method for Biobjective Mixed Integer Programming
- Mixed-integer nonlinear optimization
- Multiobjective Programming and Multiattribute Utility Functions in Portfolio Optimization
This page was built for publication: Solving Multiobjective Mixed Integer Convex Optimization Problems
