文章基本信息

标题：A mixed integer linear programming formulation for low discrepancy consecutive k-sums permutation problem
本地全文：下载
作者：Bogdanović, Milena ; Maksimović, Zoran ; Simić, Ana 等
期刊名称：Yugoslav Journal of Operations Research
印刷版ISSN：0354-0243
电子版ISSN：1820-743X
出版年度：2017
卷号：27
期号：1
页码：125-132
出版社：Faculty of Organizational Sciences, Belgrade, Mihajlo Pupin Institute, Belgrade, Economics Institute, Belgrade, Faculty of Transport and Traffic Engineering, Belgrade, Faculty of Mechanical Engineering, Belgrade
摘要：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.
关键词：Mixed integer linear programming; Permutations with low discrepancy consecutive k-sums