A mixed integer linear programming formulation for low discrepancy consecutive k-sums permutation problem
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...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Belgrade
2017-01-01
|
| Series: | Yugoslav Journal of Operations Research |
| Subjects: | |
| Online Access: | http://www.doiserbia.nb.rs/img/doi/0354-0243/2017/0354-02431600005B.pdf |
| _version_ | 1818906399088836608 |
|---|---|
| author | Bogdanović Milena Maksimović Zoran Simić Ana Milošević Jelisavka |
| author_facet | Bogdanović Milena Maksimović Zoran Simić Ana Milošević Jelisavka |
| author_sort | Bogdanović Milena |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-12-19T21:38:36Z |
| format | Article |
| id | doaj.art-f84ca8469f3945d2b7c25e72ee5e8380 |
| institution | Directory Open Access Journal |
| issn | 0354-0243 1820-743X |
| language | English |
| last_indexed | 2024-12-19T21:38:36Z |
| publishDate | 2017-01-01 |
| publisher | University of Belgrade |
| record_format | Article |
| series | Yugoslav Journal of Operations Research |
| spelling | doaj.art-f84ca8469f3945d2b7c25e72ee5e83802022-12-21T20:04:44ZengUniversity of BelgradeYugoslav Journal of Operations Research0354-02431820-743X2017-01-0127112513210.2298/YJOR160104005B0354-02431600005BA mixed integer linear programming formulation for low discrepancy consecutive k-sums permutation problemBogdanović Milena0Maksimović Zoran1Simić Ana2Milošević Jelisavka3Pedagogical Faculty, VranjeMilitary Academy, BelgradeFaculty of Mathematics, BelgradeFASPER, BelgradeIn 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.http://www.doiserbia.nb.rs/img/doi/0354-0243/2017/0354-02431600005B.pdfMixed integer linear programmingPermutations with low discrepancy consecutive k-sums |
| spellingShingle | Bogdanović Milena Maksimović Zoran Simić Ana Milošević Jelisavka A mixed integer linear programming formulation for low discrepancy consecutive k-sums permutation problem Yugoslav Journal of Operations Research Mixed integer linear programming Permutations with low discrepancy consecutive k-sums |
| title | A mixed integer linear programming formulation for low discrepancy consecutive k-sums permutation problem |
| title_full | A mixed integer linear programming formulation for low discrepancy consecutive k-sums permutation problem |
| title_fullStr | A mixed integer linear programming formulation for low discrepancy consecutive k-sums permutation problem |
| title_full_unstemmed | A mixed integer linear programming formulation for low discrepancy consecutive k-sums permutation problem |
| title_short | A mixed integer linear programming formulation for low discrepancy consecutive k-sums permutation problem |
| title_sort | mixed integer linear programming formulation for low discrepancy consecutive k sums permutation problem |
| topic | Mixed integer linear programming Permutations with low discrepancy consecutive k-sums |
| url | http://www.doiserbia.nb.rs/img/doi/0354-0243/2017/0354-02431600005B.pdf |
| work_keys_str_mv | AT bogdanovicmilena amixedintegerlinearprogrammingformulationforlowdiscrepancyconsecutiveksumspermutationproblem AT maksimoviczoran amixedintegerlinearprogrammingformulationforlowdiscrepancyconsecutiveksumspermutationproblem AT simicana amixedintegerlinearprogrammingformulationforlowdiscrepancyconsecutiveksumspermutationproblem AT milosevicjelisavka amixedintegerlinearprogrammingformulationforlowdiscrepancyconsecutiveksumspermutationproblem AT bogdanovicmilena mixedintegerlinearprogrammingformulationforlowdiscrepancyconsecutiveksumspermutationproblem AT maksimoviczoran mixedintegerlinearprogrammingformulationforlowdiscrepancyconsecutiveksumspermutationproblem AT simicana mixedintegerlinearprogrammingformulationforlowdiscrepancyconsecutiveksumspermutationproblem AT milosevicjelisavka mixedintegerlinearprogrammingformulationforlowdiscrepancyconsecutiveksumspermutationproblem |