LINEAR PROGRAMMING PROBLEMS WITH FUNDAMENTAL CUT MATRICES

Basit Öğe Kaydı
dc.contributor.authorSharifov, Firdovsi
dc.contributor.authorKutucu, Hakan
dc.date.accessioned2024-09-29T16:11:37Z
dc.date.available2024-09-29T16:11:37Z
dc.date.issued2018
dc.departmentKarabük Üniversitesien_US
dc.description.abstractIn the paper, we consider a linear programming problem with con-straint matrices whose rows are 0, 1 characteristics vectors of fundamental cuts in a given undirected graph G = (V, E). We prove that the simplex algorithm finds an optimal solution in at most m-n+1 (m = vertical bar E vertical bar, n = vertical bar V vertical bar) iterations. We also consider the question whether a given binary matrix is a 0, 1 characteristic vector of fundamental cuts in the graph G.en_US
dc.identifier.endpage848en_US
dc.identifier.issn1304-7205
dc.identifier.issn1304-7191
dc.identifier.issue3en_US
dc.identifier.startpage835en_US
dc.identifier.urihttps://hdl.handle.net/20.500.14619/8570
dc.identifier.volume36en_US
dc.identifier.wosWOS:000445810300019en_US
dc.identifier.wosqualityN/Aen_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.language.isoenen_US
dc.publisherYildiz Technical Univen_US
dc.relation.ispartofSigma Journal of Engineering and Natural Sciences-Sigma Muhendislik Ve Fen Bilimleri Dergisien_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectNetwork designen_US
dc.subjectsubmodular functionen_US
dc.subjectfundamental cut setsen_US
dc.subjectlinear programmingen_US
dc.titleLINEAR PROGRAMMING PROBLEMS WITH FUNDAMENTAL CUT MATRICESen_US
dc.typeArticleen_US

Dosyalar

Koleksiyon

WoS İndeksli Yayınlar Koleksiyonu