A branch-and-cut technique to solve multiobjective integer quadratic programming problems

DOI10.1007/S10479-017-2698-6MaRDI QIDQ1615968zbMATH OpenOpenAlexFDO

Authors Fatma Zohra Ouaïl, Mohamed El-Amine Chergui

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

zbMATH Keywords

branch and boundefficient cutsmultiobjective optimizationmultiobjective quadratic integer programmingquadratic programming

Mathematics Subject Classification ID

Integer programming (90C10) Quadratic programming (90C20) Multi-objective and goal programming (90C29) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• An indefinite quadratic optimization over an integer efficient set
• Biobjective optimization over the efficient set of multiobjective integer programming problem
• Solving multi-objective integer indefinite quadratic fractional programs
• A cutting plane approach for multi-objective integer indefinite quadratic programming problem
• Bicriteria integer quadratic programming problems

Cites work

• Integer quadratic fractional programming problems with bounded variables
• Multiple objective programming for the quadratic assignment problem
• Solving the Multiple Objective Integer Linear Programming Problem
• Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers
• Suitable-portfolio investors, nondominated frontier sensitivity, and the effect of multiple objectives on standard portfolio selection
• The quadratic knapsack problem -- a survey
• Tri-criterion inverse portfolio optimization with application to socially responsible mutual funds
• Tri-criterion modeling for constructing more-sustainable mutual funds

Cited in

(12)

• The quadrant shrinking method: a simple and efficient algorithm for solving tri-objective integer programs
• Biobjective optimization over the efficient set of multiobjective integer programming problem
• Finding non dominated points for multiobjective integer convex programs with linear constraints
• A cutting plane approach for multi-objective integer indefinite quadratic programming problem
• A decision space algorithm for multiobjective convex quadratic integer optimization
• Application of stochastic programming technique to solve interval quadratic programming problem
• Branch and cut method for solving integer indefinite quadratic bilevel programs
• Bicriteria integer quadratic programming problems
• An indefinite quadratic optimization over an integer efficient set
• Evolutionary Computation in Combinatorial Optimization
• An algorithm to solve multi-objective integer quadratic programming problem
• An exact scalarization method with multiple reference points for bi-objective integer linear optimization problems

This page was built for publication: A branch-and-cut technique to solve multiobjective integer quadratic programming problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1615968)