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

Full description

Bibliographic Details

Published in:	European journal of operational research Vol. 282; no. 2; pp. 453 - 463
Main Authors:	Hartillo-Hermoso, María Isabel, Jiménez-Tafur, Haydee, Ucha-Enríquez, José María
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 16.04.2020
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!