Title of article
A mixed integer linear programming formulation of the maximum betweenness problem
Author/Authors
Aleksandar Savi?، نويسنده , , Jozef Kratica، نويسنده , , Marija Milanovi?، نويسنده , , Djordje Dugo?ija، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2010
Pages
6
From page
522
To page
527
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.
Keywords
Integer programming , Linear programming , Betweenness problem
Journal title
European Journal of Operational Research
Serial Year
2010
Journal title
European Journal of Operational Research
Record number
1312840
Link To Document