A mixed integer linear programming formulation for low discrepancy consecutive k-sums permutation problem | Zendy

Milena Bogdanović | Zendy; Zoran Maksimović | Zendy; Ana Simić | Zendy; Jelisavka Milosevic | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A mixed integer linear programming formulation for low discrepancy consecutive k-sums permutation problem

Author(s) -

Milena Bogdanović,

Zoran Maksimović,

Ana Simić,

Jelisavka Milosevic

Publication year - 2016

Publication title -

yugoslav journal of operations research

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.221

H-Index - 21

eISSN - 1820-743X

pISSN - 0354-0243

DOI - 10.2298/yjor160104005b

Subject(s) - permutation (music) , integer programming , correctness , mathematics , solver , linear programming , integer (computer science) , mathematical optimization , discrete mathematics , combinatorics , algorithm , computer science , physics , acoustics , programming language

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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research