Quadratic convex reformulations for multiobjective binary quadratic programming
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 4010155 (Why is no real title available?)
- A decision space algorithm for multiobjective convex quadratic integer optimization
- A general branch-and-bound framework for continuous global multiobjective optimization
- A hybrid patch decomposition approach to compute an enclosure for multi-objective mixed-integer convex optimization problems
- A solver for multiobjective mixed-integer convex and nonconvex optimization
- Adaptive piecewise linear relaxations for enclosure computations for nonconvex multiobjective mixed-integer quadratically constrained programs
- Advancements in the computation of enclosures for multi-objective optimization problems
- An approximation algorithm for multi-objective optimization problems using a box-coverage
- Bi-objective design-for-control of water distribution networks with global bounds
- Bound sets for biobjective combinatorial optimization problems
- Bounds and convex heuristics for bi-objective optimal experiment design in water networks
- Branch-and-bound and objective branching with three or more objectives
- Branch-and-bound for bi-objective integer programming
- Branching with hyperplanes in the criterion space: the frontier partitioner algorithm for biobjective integer programming
- Dantzig-Wolfe reformulations for binary quadratic problems
- Effective implementation of the \(\varepsilon \)-constraint method in multi-objective mathematical programming problems
- Exact solution methods for the k-item quadratic knapsack problem
- Experiments in quadratic 0-1 programming
- Extending the QCR method to general mixed-integer programs
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
- Multi-objective branch and bound
- Multi-objective mathematical programming for optimally sizing and managing battery energy storage for solar photovoltaic system integration of a multi-apartment building
- Multicriteria Optimization
- On the representation of the search region in multi-objective optimization
- Solving multiobjective mixed integer convex optimization problems
- The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
- Using dual relaxations in multiobjective mixed-integer convex quadratic programming
This page was built for publication: Quadratic convex reformulations for multiobjective binary quadratic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7228831)
