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

This article proposes an exact method to solve the integer programming problem featuring several convex quadratic functions to be minimized (henceforth denoted by MOIQP). The proposed algorithm is a branch and bound based technique suitable for MOIQP problems to generate the set of all efficient sol...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Annals of operations research Ročník 267; číslo 1-2; s. 431 - 446
Hlavní autori:	Ouaïl, Fatma Zohra, Chergui, Mohamed El-Amine
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.08.2018 Springer Nature B.V
Predmet:	Algorithms Branch & bound algorithms Business and Management Combinatorics Integer programming Linear functions Multiple objective analysis Multiple Objective Optimization Operations research Operations Research/Decision Theory Problem solving Quadratic equations Quadratic programming Studies Theory of Computation 90C20 Efficient cuts 90C10 Branch and bound 90C57 Multiobjective optimization 90C29 Quadratic programming Multiobjective quadratic integer programming
ISSN:	0254-5330, 1572-9338
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!