A mixed integer linear programming formulation of the maximum betweenness problem
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.
Year of publication: |
2010
|
---|---|
Authors: | Savic, Aleksandar ; Kratica, Jozef ; Milanovic, Marija ; Dugosija, Djordje |
Published in: |
European Journal of Operational Research. - Elsevier, ISSN 0377-2217. - Vol. 206.2010, 3, p. 522-527
|
Publisher: |
Elsevier |
Keywords: | Integer programming Linear programming Betweenness problem |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
Genetic algorithms for solving the discrete ordered median problem
Stanimirovic, Zorica, (2007)
-
A mixed integer linear programming formulation of the maximum betweenness problem
Savić, Aleksandar, (2010)
-
Variable neighborhood search for metric dimension and minimal doubly resolving set problems
Mladenović, Nenad, (2012)
- More ...