DC FieldValueLanguage
dc.contributor.authorSavić, Aleksandaren
dc.contributor.authorKratica, Jozefen
dc.contributor.authorMilanović, Marijaen
dc.contributor.authorDugošija, Đorđeen
dc.date.accessioned2020-04-26T19:14:54Z-
dc.date.available2020-04-26T19:14:54Z-
dc.date.issued2010-11-01en
dc.identifier.issn0377-2217en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/496-
dc.description.abstractThis paper considers the maximum betweenness problem. A new mixed integer linear programming (MILP) formulation is presented and validity of this formulation is given. Experimental results are performed on randomly generated instances from the literature. The results of CPLEX solver, based on the proposed MILP formulation, are compared with results obtained by total enumeration technique. The results show that CPLEX optimally solves instances of up to 30 elements and 60 triples in a short period of time.en
dc.publisherElsevier-
dc.relationSerbian Ministry of Science, Grant no. 144007-
dc.relation.ispartofEuropean Journal of Operational Researchen
dc.subjectBetweenness problem | Integer programming | Linear programmingen
dc.titleA mixed integer linear programming formulation of the maximum betweenness problemen
dc.typeArticleen
dc.identifier.doi10.1016/j.ejor.2010.02.028en
dc.identifier.scopus2-s2.0-77951205806en
dc.contributor.affiliationMathematical Institute of the Serbian Academy of Sciences and Arts-
dc.relation.firstpage522en
dc.relation.lastpage527en
dc.relation.issue3en
dc.relation.volume206en
dc.description.rankM21a-
item.cerifentitytypePublications-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.openairetypeArticle-
item.grantfulltextnone-
item.fulltextNo Fulltext-
crisitem.author.orcid0000-0002-9752-0971-
Show simple item record

SCOPUSTM   
Citations

6
checked on Jun 1, 2024

Page view(s)

48
checked on May 9, 2024

Google ScholarTM

Check

Altmetric

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.