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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	European journal of operational research Jg. 282; H. 2; S. 453 - 463
Hauptverfasser:	Hartillo-Hermoso, María Isabel, Jiménez-Tafur, Haydee, Ucha-Enríquez, José María
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 16.04.2020
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!