1. Research with MATF
  2. MATF
  3. Research outputs
Please use this identifier to cite or link to this item: https://research.matf.bg.ac.rs/handle/123456789/800
DC FieldValueLanguage
dc.contributor.authorSavić, Aleksandaren_US
dc.contributor.authorKratica, Jozefen_US
dc.contributor.authorMilanović, Marijaen_US
dc.contributor.authorDugošija, Djordjeen_US
dc.date.accessioned2022-08-15T15:47:45Z-
dc.date.available2022-08-15T15:47:45Z-
dc.date.issued2010-11-01-
dc.identifier.issn03772217en
dc.identifier.urihttps://research.matf.bg.ac.rs/handle/123456789/800-
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. © 2010 Elsevier B.V. All rights reserved.en_US
dc.language.isoenen_US
dc.publisherElsevieren_US
dc.relation.ispartofEuropean Journal of Operational Researchen_US
dc.subjectBetweenness problemen_US
dc.subjectInteger programmingen_US
dc.subjectLinear programmingen_US
dc.titleA mixed integer linear programming formulation of the maximum betweenness problemen_US
dc.typeArticleen_US
dc.identifier.doi10.1016/j.ejor.2010.02.028-
dc.identifier.scopus2-s2.0-77951205806-
dc.identifier.isi000278188400002-
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/77951205806-
dc.contributor.affiliationNumerical Mathematics and Optimizationen_US
dc.relation.issn0377-2217en_US
dc.description.rankM21aen_US
dc.relation.firstpage522en_US
dc.relation.lastpage527en_US
dc.relation.volume206en_US
dc.relation.issue3en_US
item.openairetypeArticle-
item.languageiso639-1en-
item.grantfulltextnone-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.fulltextNo Fulltext-
item.cerifentitytypePublications-
crisitem.author.deptNumerical Mathematics and Optimization-
crisitem.author.orcid0009-0003-8568-4260-
Appears in Collections:Research outputs
Show simple item record

SCOPUSTM   
Citations

6
checked on Dec 3, 2025

Page view(s)

13
checked on Jan 19, 2025

Google ScholarTM

Check

Altmetric

Altmetric


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