Quadratic convex reformulations for multiObjective binary quadratic programming
- 9 January 2026
- journal article
- research article
- Published by Springer Nature in Journal of Global Optimization
- Vol. 94 (3) , 667-698
Abstract
No abstract availableKeywords
Funding Information
- Sorbonne Université
This publication has 32 references indexed in Scilit:
- A hybrid patch decomposition approach to compute an enclosure for multi-objective mixed-integer convex optimization problemsMathematical Methods of Operations Research, 2023
- Adaptive piecewise linear relaxations for enclosure computations for nonconvex multiobjective mixed-integer quadratically constrained programsJournal of Global Optimization, 2023
- Exact algorithms for multiobjective linear optimization problems with integer variables: A state of the art surveyJournal of Multi-Criteria Decision Analysis, 2022
- An approximation algorithm for multi-objective optimization problems using a box-coverageJournal of Global Optimization, 2021
- A general branch-and-bound framework for continuous global multiobjective optimizationJournal of Global Optimization, 2021
- Exact Solution Methods for the k-Item Quadratic Knapsack Problem2016
- Extending the QCR method to general mixed-integer programsMathematical Programming, 2010
- Using a Mixed Integer Quadratic Programming Solver for the Unconstrained Quadratic 0-1 ProblemMathematical Programming, 2006
- The max-cut problem and quadratic 0–1 optimization; polyhedral aspects, relaxations and boundsAnnals of Operations Research, 1991
- Experiments in quadratic 0–1 programmingMathematical Programming, 1989