A mixed integer linear programming formulation for low discrepancy consecutive k-sums permutation problem
Keyword(s):
In this paper, low discrepancy consecutive k-sums permutation problem is considered. A mixed integer linear programing (MILP) formulation with a moderate number of variables and constraints is proposed. The correctness proof shows that the proposed formulation is equivalent to the basic definition of low discrepancy consecutive k-sums permutation problem. Computational results, obtained on standard CPLEX solver, give 88 new exact values, which clearly show the usefulness of the proposed MILP formulation.
2020 ◽
Vol 180
◽
pp. 106061
◽
2012 ◽
Vol 51
(35)
◽
pp. 11417-11433
◽
2018 ◽
Vol 6
(4)
◽
pp. 755-769
◽
2013 ◽
Vol 30
(3)
◽
pp. 190-201
◽
2019 ◽
Vol 6
(2)
◽
pp. 104-112
◽