An exact algebraic ϵ-constraint method for bi-objective linear integer programming based on test sets

•We present a new exact algorithm for bi-objective linear integer problems.•Based on the epsilon-constraint method and algebraic test sets for integer problems.•The Pareto frontier is obtained solving exactly one problem for each point.•Integer problems are solved via reduction with test set, not us...

Celý popis

Podrobná bibliografie

Vydáno v:	European journal of operational research Ročník 282; číslo 2; s. 453 - 463
Hlavní autoři:	Hartillo-Hermoso, María Isabel, Jiménez-Tafur, Haydee, Ucha-Enríquez, José María
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier B.V 16.04.2020
Témata:	Algebraic test sets Multiple objective programming Non-dominated set Pareto set Unbounded Knapsack Problem ϵ-constraint method Non-dominated set Pareto set ϵ-constraint method Unbounded Knapsack Problem Algebraic test sets Multiple objective programming
ISSN:	0377-2217, 1872-6860
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!