We show that systems with two different cone bases associated with an integer linear programming problem are equivalent under a b-complementary Multisemigroup. In addition, we present Benders' decomposition and algorithm for the dual problem of the a b-Complementary Multisemigroup.
Author(s) DetailsEleazar Madriz Lozada
Center for Exact and Technological Sciences (CETEC), Federal University of Recôncavo da Bahia, Cruz das Almas, Bahia, Brazil.
View Book :- https://stm.bookpi.org/CTMCS-V1/article/view/1385
No comments:
Post a Comment