A branch-and-cut technique to solve multiobjective integer quadratic programming problems
DOI10.1007/s10479-017-2698-6zbMath1398.90160OpenAlexW2766490375MaRDI QIDQ1615968
Mohamed El-Amine Chergui, Fatma Zohra Ouaïl
Publication date: 31 October 2018
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-017-2698-6
quadratic programmingbranch and boundmultiobjective optimizationefficient cutsmultiobjective quadratic integer programming
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Multi-objective and goal programming (90C29) Quadratic programming (90C20)
Related Items (3)
Cites Work
- Tri-criterion modeling for constructing more-sustainable mutual funds
- Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers
- The quadratic knapsack problem -- a survey
- Integer quadratic fractional programming problems with bounded variables
- Suitable-portfolio investors, nondominated frontier sensitivity, and the effect of multiple objectives on standard portfolio selection
- Tri-criterion inverse portfolio optimization with application to socially responsible mutual funds
- Solving the Multiple Objective Integer Linear Programming Problem
- Multiple objective programming for the quadratic assignment problem
This page was built for publication: A branch-and-cut technique to solve multiobjective integer quadratic programming problems