A MIXED INTEGER LINEAR PROGRAMMING FORMULATION FOR LOW DISCREPANCY CONSECUTIVE K-SUMS PERMUTATION PROBLEM

  • Milena BOGDANOVI´Ć Pedagogical Faculty, University of Niˇs,Vranje, Serbia
  • Zoran MAKSIMOVIĆ Military Academy,Belgrade, Serbia
  • Ana SIMIĆ Faculty of Mathematics, University of Belgrade, Belgrade, Serbia
  • Jelisavka MILOŠEVIĆ FASPER, University of Belgrade

Abstract

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.

Published
2016-10-11
How to Cite
BOGDANOVI´Ć, Milena et al. A MIXED INTEGER LINEAR PROGRAMMING FORMULATION FOR LOW DISCREPANCY CONSECUTIVE K-SUMS PERMUTATION PROBLEM. Yugoslav Journal of Operations Research, [S.l.], v. 27, n. 1, p. 125–132, oct. 2016. ISSN 2334-6043. Available at: <https://yujor.fon.bg.ac.rs/index.php/yujor/article/view/20>. Date accessed: 03 apr. 2025.
Section
Articles

Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.