Authors: Savić, Aleksandar
Kratica, Jozef 
Milanović, Marija
Dugošija, Đorđe
Affiliations: Mathematical Institute of the Serbian Academy of Sciences and Arts 
Title: A mixed integer linear programming formulation of the maximum betweenness problem
Journal: European Journal of Operational Research
Volume: 206
Issue: 3
First page: 522
Last page: 527
Issue Date: 1-Nov-2010
Rank: M21a
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2010.02.028
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: Betweenness problem | Integer programming | Linear programming
Publisher: Elsevier
Project: Serbian Ministry of Science, Grant no. 144007

Show full item record


checked on Jun 21, 2024

Page view(s)

checked on May 9, 2024

Google ScholarTM




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