Please use this identifier to cite or link to this item:
https://research.matf.bg.ac.rs/handle/123456789/800| Title: | A mixed integer linear programming formulation of the maximum betweenness problem | Authors: | Savić, Aleksandar Kratica, Jozef Milanović, Marija Dugošija, Djordje |
Affiliations: | Numerical Mathematics and Optimization | Keywords: | Betweenness problem;Integer programming;Linear programming | Issue Date: | 1-Nov-2010 | Journal: | European Journal of Operational Research | Abstract: | This 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. |
URI: | https://research.matf.bg.ac.rs/handle/123456789/800 | ISSN: | 03772217 | DOI: | 10.1016/j.ejor.2010.02.028 |
| Appears in Collections: | Research outputs |
Show full item record
SCOPUSTM
Citations
6
checked on Nov 9, 2024
Page view(s)
13
checked on Nov 15, 2024
Google ScholarTM
Check
Altmetric
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.