New mixed-integer linear programming model for solving the multidimensional multi-way number partitioning problem
New mixed-integer linear programming model for solving the multidimensional multi-way number partitioning problem
https://doi.org/10.1007/s40314-022-01825-2
Abstract
The multidimensional multi-way number partitioning problem considers a set of n vectors
of a fixed dimension m ≥ 2 as an input. The goal is to find partitioning of the set into k ≥ 2
subsets such that sums per each coordinate in each subset are as nearly equal as possible.
The problem has applications in key encryption and multiprocessor scheduling. Prior to this
paper, there has been only one mixed-integer model proposed in case of general k ≥ 2. In
this paper, we propose a new mixed-integer programming model for the general case. The
obtained results indicate that our model significantly outperforms the model from literature
for larger values of k.
1 Introduction
Let S = {v1 , v2 , . . . , vn } be a set of n vectors, where each vector has m real coordinates. For
a fixed integer k ∈ {2, . . . , n}, the multidimensional multi-way number partitioning problem
B Marko Djukanovic
[email protected]; [email protected]
Bojan Nikolic
[email protected]
Dragan Matic
[email protected]
1 Faculty of Natural Sciences and Mathematics, University of Banja Luka, Banja Luka, Bosnia and
Herzegovina
2 Institute of Logic and Computation, TU Wien, Austria
123
119 Page 2 of 72 B. Nikolic et al.
(MDMWNPP) asks for a disjoint and collectively exhaustive partition (S1 , S2 , . . . , Sk ) of set
S, where sums per each coordinate in each partition set are as nearly equal as possible.
MDMWNPP is a generalization of the well-known two-way number partitioning problem
(TWNPP) whose goal is to divide a set S of real numbers into two subsets, such that sums of
the numbers in each subset are as close as possible. MDMWNPP generalizes TWNPP in two
ways: (i) in MDMWNPP, instead of real numbers, the set S contains general m-dimensional
vectors and (ii) the number of subsets, when partitioning the set of vectors S, can be arbitrary
fixed integer k ≥ 2. TWNPP is one of Karp’s 21 basic N P –hard problems Karp (1975) (it
is also N P complete). Thus, MDMWNPP is N P –hard in a general case, as a generalization
of an N P –hard problem.
An important characteristic of TWNPP is that its computational complexity does not
depend (only) on the cardinality of set S, but on the type of input numbers, i.e., the number
precision Hayes (2002), Mertens (2006). As it is stated in Kojić (2010), this is not the case
with the multidimensional version of TWNPP; even in the case when k = 2, the problem is
hard to solve with a moderate number of digits in the input. The MDMWNPP in the case of
m = 1 is considered in Korf (2009), Moffitt (2013), Korf et al. (2014).
The first generalization which introduces vectors instead of numbers was given by Kojić
(2010). Kojić (2010) presented a mixed-integer linear programming (MILP) formulation of
this specific problem; this MILP formulation has n binary variables and 2m constraints. The
problem is mainly solved by various heuristic approaches such as a genetic algorithm (GA) by
Pop and Matei (2013), a variable and neighborhood search (VNS) and an electromagnetism-
like (EM) by Kratica et al. (2014), a greedy randomized adaptive search (GRASP) with
exterior path-relinking and restricted local search by Rodriguez et al. (2017). Moreover,
the following four approaches: GA, Simulated annealing (SA), migrating bird optimization
algorithm (MBO) and clonal selection algorithms are proposed by Hacibeyoglu et al. (2018),
and an Algebraic Differential Evolution and VNS by Santucci et al. (2019).
Bi-dimensional two-way number partitioning problem has been solved by greedy and
genetic algorithms by Hacibeyoglu et al. (2014). The same bi-dimensional problem is also
solved by Fuksz et al. (2013) by means of three heuristics, greedy, a novel GA and a hybrid of
GA and VNS method. The generalized MDMWNPP with arbitrary m and k is introduced by
Pop and Matei (2013). In a recent work, Faria et al. (2020) in [2] introduced the first known
exact algorithm, a mixed-integer programming model, to solve the generalized MDMWNPP.
The model has been tested for a smaller number of subsets (k ∈ {2, 3, 4}). For k = 2, the
model has shown as competitive to the model of Kojić (2010). More details about these two
models will be discussed in Sects. 2.1 and 2.2.
TWNPP and its generalizations face with many practical applications in areas like public-
key encryption and task scheduling. Practical applications of the NPP include multiprocessor
scheduling Coffman and Lueker (1991), public-key cryptography Merkle and Hellman
(1978), and the assignment of tasks in low-power application-specific integrated circuits
Ercegovac and Potkonjak (1999).
Regarding the generalized problems, MDTWNPP and the MDMWNPP are of a practical
usage when it is necessary to find a balance between two or more characteristics of elements
from a given data set. These applications include public-key cryptography Pop and Matei
(2013), and assigning persons to fair teams Hacibeyoglu et al. (2018).
Some concrete examples of the MDTWNPP may concern the following:
• Two travel agents need to have as closely similar revenues from organized tours as possi-
ble; the parameters under consideration are the price of the tour, the mileage (due to petrol
123
New mixed-integer linear programming model... Page 3 of 72 119
consumption), special offers (such as restaurants, shopping tours, visits to museums, and
so on). This is a three-dimensional, two-way number partitioning problem.
• Two police patrols need to have similar mileage, degree of risk (depending on criminal
activities) and time for touring their beat.
Beside further generalizations of the abovementioned examples, some concrete examples for
the MDMWNPP may be as follows:
The main contributions of our paper are as follows: (i) we present a new mixed-integer
linear programming model to solve the MDMWNPP with a fixed number of subsets k ≥ 2;
(ii) we give an extensive computational studies also with larger k and compare our model to
the model of Faria [2] and (iii) our model has been competitive with this model for smaller
k, and is able to significantly outperform it significantly for a larger number of subsets k.
The objective of the problem is to minimize r over all possible k–decompositions of S. Recall
that for k = 2, we get the MDTWNPP.
In this section, we present the MILP model proposed by Kojić (2010). The model is defined
as follows.
123
119 Page 4 of 72 B. Nikolic et al.
min r
s.t.
n
− 0, 5 · r + vil · xi ≤ 0, 5 · sl , ∀l ∈ {1, . . . , m} (2)
i=1
n
0, 5 · r + vil · xi ≥ 0, 5 · sl , ∀l ∈ {1, . . . , m} (3)
i=1
xi ∈ {0, 1}, ∀i ∈ {1, 2, . . . , n} (4)
n
where sl = vil , ∀l = 1, 2, . . . , m, and xi = 1, if vi ∈ S1 , or 0 other-
i=1
wise. This model has 2 m constraints and n variables. As one could notice, this model
allows empty subsets. For example, the optimal solution of the MDTWNPP for S =
{(−4, −4), (1, 1), (1, 1), (1, 1), (1, 1)} can be obtained from subsets
S1 = {(−4, −4), (1, 1), (1, 1), (1, 1), (1, 1)},
S2 = ∅.
This model has been proposed by Faria et al. (2020) in [2], and until now, it is the only known
method to solve the MDMWNPP. Apart of the model proposed by Kojić (2010), Faria et al.
(2020) considered only k–partitions of the set S. The model has mk(k −1)+k +n constraints
and nk + 1 variables.
Variables are (except of r ) given by xi j = 1, if vector vi is included in the subset S j ,
i ∈ {1, . . . , n}, j ∈ {1, . . . , k}, or 0 otherwise.
min r (5)
s.t.
k
xi j = 1, ∀i ∈ {1, . . . , n} (6)
j=1
n
xi j ≥ 1, ∀ j ∈ {1, . . . , k} (7)
i=1
n
vil (xi j1 − xi j2 ) ≤ r , 1 ≤ j1 < j2 ≤ k, ∀l ∈ {1, . . . , m} (8)
i=1
n
vil (xi j2 − xi j1 ) ≤ r , 1 ≤ j1 < j2 ≤ k, ∀l ∈ {1, . . . , m} (9)
i=1
r ∈ [0, +∞) (10)
xi j ∈ {0, 1}, ∀i ∈ {1, . . . , n}, ∀ j ∈ {1, . . . , k} (11)
Constraint (6) ensures that each element belongs to exactly one subset, and constraint (7)
ensures that each subset is non-empty. Constraints (8) and (9) ensures that for each pair of
123
New mixed-integer linear programming model... Page 5 of 72 119
different subsets, the absolute difference between these two subset sums per each coordinate
is at most r .
In this section, we present a new MILP model for solving MDMWNPP, labeled by New.
Variables introduced in the model are as follows:
• Binary variables xi j : xi j = 1, if the i-th vector is included in the j-th subset, otherwise
0;
• real variables yl , zl : maximum and minimum sum of l-th coordinate among all subsets,
more precisely:
⎧ ⎫
⎨ ⎬
yl = max vil (12)
j∈{1,...,k} ⎩ ⎭
vi ∈S j
and
⎧ ⎫
⎨ ⎬
zl = min vil (13)
j∈{1,...,k} ⎩ ⎭
vi ∈S j
123
119 Page 6 of 72 B. Nikolic et al.
r is in line with the formula (1) and expression (14). Constraints (18) and (19) correspond
to the expressions (12) and (13) and bounds yl and zl variables, l ∈ {1, . . . , m}. Constraint
(16) ensures that each vector is assigned to exactly one subset.
The condition introduced in Faria et al. [2] version of MDTWNPP, that each of the subsets
has to be non-empty is expressed by (17). Clearly, constraints (21) ensures binary nature of
xi j variables, i ∈ {1, . . . , n}, j ∈ {1, . . . , k}.
Finally, New model has nk + 2m + 1 variables (from which nk are binary variables) and
n + k + 2km + m constraints.
Remark. Note that in the MDTWNPP literature, there is lack of consistency regarding use of
the constraint of non-emptiness of subsets for k-decompositions, modeled by constraint (17).
Still, it can be shown that this constraint is redundant under the assumption that all vector
coordinates are positive real numbers as it is the case of all the known benchmark sets from
literature. This fact is proven in Appendix B.
4 Experimental results
All proposed algorithms were implemented in C++ using GCC 5.4.2. All experiments were
performed on a cluster of machines under Linux with Intel Xeon E5649 CPUs with 2.53
GHz and a memory limit of 8 GB in single-threaded mode. The maximum computation time
allowed for each run was limited to 20 min, i.e., 1200 s.
The mathematical model proposed in this paper was implemented by using Cplex solver
version 12.5.1, with the default configuration, in C++ and GCC compiler version 5.4.2. Faria’s
et al. model and Kojic’s model have been re-implemented in the form as they presented in the
original papers. We recall that the model of Kojic would need additional constraint of non-
emptiness of subsets, but it is not required due to the characteristic of the problem instances
used in the experimental evaluation (all values of all vectors include positive real numbers).
The following models are compared:
• the model of Kojić (2010), labeled by Kojic; the model is limited to instances with k = 2;
• the model by Faria et al. [2], labeled by FdSdS;
• our model presented in Sect. 3, labeled by New.
The benchmark set used in our experiments was originally generated by Kojić (2010).
All the published papers on this topic used the same starting set of instances to generate the
final benchmark sets apart of the paper by Hacibeyoglu et al. (2014). In the set of instances
proposed by Kojić (2010), there are five types of instances, denoted as t ype ∈ {a, b, c, d, e},
that is five files in which a matrix of dimension 500 × 200 has been generated. Each element
of the matrices is a float number with four decimal places that are all randomly gener-
ated. The names of the starting instances are mdtwnpp_500_20a, mdtwnpp_500_20b,
mdtwnpp_500_20c, mdtwnpp_500_20d, mdtwnpp_500_20e, respectively. As an
example, to generate a specific instance with n = 30, m = 10, k = 5, and t ype = a, we
take a starting instance mdtwnpp_500_20a and store the upper-left matrix of dimension
30 × 10 which exactly gives us 30 vectors (rows) each of dimension 10. In the same manner,
for each of the following configurations:
• the number of vectors n ∈ {30, 40, 50, 100, 200, 300, 400, 500},
• the vector’s dimension m ∈ {2, 3, 5, 10, 15, 20},
• the number of allowed subsets k ∈ {2, 3, 4, 5, 10, 20, 30},
we generate one problem instance, which gives us, in overall, 1680 problem instances.
123
New mixed-integer linear programming model... Page 7 of 72 119
Note that, until now, there have not been performed any experiments with k ≥ 5 in the
literature. Thus, this paper further expands the experimental evaluation by considering the
problem instances with larger k, k ∈ {5, 10, 20, 30}, for the first time. Moreover, perfor-
mances of the algorithms are shown for the instances with n ∈ {30, 40} for the first time to
obtain a deeper insight into limitations of the exact solving which we found not so clear
in the literature. The executable file of our implementations and the benchmark sets can be
found at https://github.com/markodjukanovic90/mtwnpp-2021. For the complete results, we
refer readers to Appendix A.
To check the statistical significance of differences of our algorithms, we generated Figs. 5a,
6, 7 and 8. The following statistical evaluation is executed. Friedman’s test was performed
simultaneously on the groups of results for all models (three models in case of k = 2, or two
otherwise). The results are grouped w.r.t. different number of (non-empty) subsets k. Given
that in all cases the test rejected the hypothesis that the results on the same group for each
model are (statistically) equal, pairwise comparisons are performed using the Nemenyi post
hoc test, see Pohlert (2014). The outcome is shown by means of so-called critical difference
plots; we have two (comparing objective values and lower bound) for each group of results.
In short, each model is positioned in the horizontal segment according to its average ranking
concerning the considered set of instances. Then, the critical difference (CD) is computed for
a significance level of 0.05 and the performance of those algorithms that have a difference
lower than CD are considered as equal–that is, no difference of statistical significance can be
detected. This is indicated in the graphics by horizontal bars joining the respective models.
In the descriptions of the obtained results, we make a small convention. By writing the
model Kojic, FdSdS, and New, we always refer to the Cplex solver which is applied on
specific model.
Tables 1, 2, 3 and 4 present summaries over the results which compare number of best
achieved solutions, average best solutions, average lower bounds and number of optimal
solutions found, all grouped w.r.t. different k.
In Table 1, the number of achieved best results for each of the three compared algorithms
is presented. These results are given in terms of a plot by Fig. 1. The following observations
can be made:
• For k = 2, the model Kojic finds the best solutions for significantly more cases than the
model FdSdS. It seems that the performance of the model New performs worse than the
other competitors.
• For k = 3, the model FdSdS achieves best results on significantly more cases than the
competitor. The same can be argued for the instances with k = 4.
• Starting with k ≥ 5, the model New delivers best results on significantly more cases than
the competitor model FdSdS. This is especially noticeable for larger k, where the model
New shows superiority (please, see k = 30 where the best results in case of the model
New are achieved on 235 cases whereas the model FdSdS achieved it on just 46 cases).
In Table 2, average objective values for each model grouped by different k are presented.
These results are displayed in terms of a plot by Fig. 2. We observe the main conclusions:
• For k = 2, the model Kojic delivers the best average solutions quality that are slightly
better than that of the model FdSdS. However, these differences are statistically irrel-
evant, see Fig. 5a. The model New here obtains significantly worse average solutions
quality than those of the two competitors.
• For k ∈ {3, 4}, the model FdSdS obtains better average solution quality than the competi-
tor model New, these differences are not statistically significant in case of the instances
123
119 Page 8 of 72 B. Nikolic et al.
5 Conclusions
In this paper we proposed a new MILP model to solve the MDMWNPP. The experimen-
tal evaluation from the literature has been here further expanded to consider a new set of
instances, which includes the number of vectors n ∈ {30, 40} and the number of allowed
subsets k ∈ {5, 10, 20, 30}. The proposed model has been shown as mostly competitive with
123
New mixed-integer linear programming model... Page 9 of 72 119
123
119 Page 10 of 72 B. Nikolic et al.
123
New mixed-integer linear programming model... Page 11 of 72 119
1 2 3 1 2
Kojic New
(a) Objective values comparison: (b) Objective values comparison:
instances with k = 2. instances with k = 3.
Fig. 5 The CD plots showing statistical difference
1 2 1 2
New New
FDSDS FDSDS
the model from literature for smaller k, and outperforms it w.r.t. number of best achieved
solutions as well as average solutions quality for larger k. This difference was statistically
significant w.r.t. the achieved average solutions quality, according to our statistical evaluation.
In future work, we could consider different mechanisms for breaking symmetries in our
model to further boost the quality of obtained solutions. In addition, developing heuristic
methods that are hybridized with MILP could be a promising research direction to consider.
123
119 Page 12 of 72 B. Nikolic et al.
1 2 1 2
New New
FDSDS FDSDS
(a) Objective values comparison: (b) Objective values comparison:
instances with k = 10. instances with k = 20.
Fig. 7 The CD plots showing statistical differences
New
FDSDS
Acknowledgements This research is partially supported by Ministry for Scientific and Technological Devel-
opment, Higher Education and Information Society, Government of Republic of Srpska, B&H under the Project
“Development of artificial intelligence methods for solving computer biology problems”. The second author
was funded by the Doctoral Program Vienna Graduate School on Computational Optimization (VGSCO),
Austrian Science Foundation Project No. W1260-N35.
Appendices
In this section, we provide complete results obtained by testing following MILP models:
• the model Kojic; the model is limited to the instances with k = 2;
• the model FdSdS;
• New model.
Results are organized in Tables 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21,
22, 23, 24 and 25 as follows:
• k=2
– Table 5: results for n = 30, 40, 50;
– Table 6: results for n = 100, 300, 500;
– Table 7: results for n = 200, 400.
• k=3
123
New mixed-integer linear programming model... Page 13 of 72 119
123
Table 5 Results for n = 30, 40, 50 and k = 2
119
123
30 2 a 10.719 323.48 10.719 10.719 614.92 10.719 10.719 586.03 10.719
Page 14 of 72
123
40 5 d 3204.371 1200 0 4072.443 1200 0 4072.445 1200 0
40 5 e 9.154 1200 0 3.05 1200 0 7.628 1200 0
Page 15 of 72
119
Table 5 continued
119
123
40 10 a 16,516.276 345.83 16516.276 16,516.276 284.08 16516.276 16,516.276 285.48 16516.276
Page 16 of 72
123
Page 17 of 72
119
Table 5 continued
119
123
50 10 e 19303.638 1200 0 19309.742 1200 0 15,365.957 1200 0
Page 18 of 72
123
100 15 a 32,149.343 1200 0 32,149.343 1200 0 34161.617 1200 0
100 15 b 28,717.693 1200 0 28723.797 1200 0 30794.75 1200 0
Page 19 of 72
119
Table 6 continued
119
123
100 15 c 32,668.12 1200 0 32674.23 1200 0 33363.204 1200 0
Page 20 of 72
123
500 2 d 1.673 1200 0 3.187 1200 0 16.045 1200 0
Page 21 of 72
119
Table 6 continued
119
123
500 2 e 3.318 1200 0 3.6968 1200 0 6.08 1200 0
Page 22 of 72
123
Page 23 of 72
119
Table 7 Results for n = 200, 400 and k = 2
119
123
200 2 a 16.836 1200 0 19.2545 1200 0 16.531 1200 0
Page 24 of 72
123
400 3 a 198.164 1200 0 108.548 1200.16 0 90.244 1200 0
Page 25 of 72
119
Table 7 continued
119
123
400 3 b 211.739 1200 0 149.585 1200 0 175.794 1200 0
Page 26 of 72
123
Page 27 of 72
119
119 Page 28 of 72 B. Nikolic et al.
r t[s] LB r t[s] LB
123
New mixed-integer linear programming model... Page 29 of 72 119
Table 8 continued
n m T ype FdSdS New
r t[s] LB r t[s] LB
123
119 Page 30 of 72 B. Nikolic et al.
Table 8 continued
n m T ype FdSdS New
r t[s] LB r t[s] LB
r t[s] LB r t[s] LB
123
New mixed-integer linear programming model... Page 31 of 72 119
Table 9 continued
n m T ype FdSdS New
r t[s] LB r t[s] LB
123
119 Page 32 of 72 B. Nikolic et al.
Table 9 continued
n m T ype FdSdS New
r t[s] LB r t[s] LB
123
New mixed-integer linear programming model... Page 33 of 72 119
r t[s] LB r t[s] LB
123
119 Page 34 of 72 B. Nikolic et al.
Table 10 continued
n m T ype FdSdS New
r t[s] LB r t[s] LB
123
New mixed-integer linear programming model... Page 35 of 72 119
r t[s] LB r t[s] LB
123
119 Page 36 of 72 B. Nikolic et al.
Table 11 continued
n m T ype FdSdS New
r t[s] LB r t[s] LB
123
New mixed-integer linear programming model... Page 37 of 72 119
Table 11 continued
n m T ype FdSdS New
r t[s] LB r t[s] LB
123
119 Page 38 of 72 B. Nikolic et al.
r t[s] LB r t[s] LB
123
New mixed-integer linear programming model... Page 39 of 72 119
Table 12 continued
n m T ype FdSdS New
r t[s] LB r t[s] LB
123
119 Page 40 of 72 B. Nikolic et al.
Table 12 continued
n m T ype FdSdS New
r t[s] LB r t[s] LB
r t[s] LB r t[s] LB
123
New mixed-integer linear programming model... Page 41 of 72 119
Table 13 continued
n m T ype FdSdS New
r t[s] LB r t[s] LB
123
119 Page 42 of 72 B. Nikolic et al.
r t[s] LB r t[s] LB
123
New mixed-integer linear programming model... Page 43 of 72 119
Table 14 continued
n m T ype FdSdS New
r t[s] LB r t[s] LB
123
119 Page 44 of 72 B. Nikolic et al.
Table 14 continued
n m T ype FdSdS New
r t[s] LB r t[s] LB
r t[s] LB r t[s] LB
123
New mixed-integer linear programming model... Page 45 of 72 119
Table 15 continued
n m T ype FdSdS New
r t[s] LB r t[s] LB
123
119 Page 46 of 72 B. Nikolic et al.
Table 15 continued
n m T ype FdSdS New
r t[s] LB r t[s] LB
123
New mixed-integer linear programming model... Page 47 of 72 119
r t[s] LB r t[s] LB
123
119 Page 48 of 72 B. Nikolic et al.
Table 16 continued
n m T ype FdSdS New
r t[s] LB r t[s] LB
r t[s] LB r t[s] LB
123
New mixed-integer linear programming model... Page 49 of 72 119
Table 17 continued
n m T ype FdSdS New
r t[s] LB r t[s] LB
123
119 Page 50 of 72 B. Nikolic et al.
Table 17 continued
n m T ype FdSdS New
r t[s] LB r t[s] LB
123
New mixed-integer linear programming model... Page 51 of 72 119
r t[s] LB r t[s] LB
123
119 Page 52 of 72 B. Nikolic et al.
Table 18 continued
n m T ype FdSdS New
r t[s] LB r t[s] LB
123
New mixed-integer linear programming model... Page 53 of 72 119
Table 18 continued
n m T ype FdSdS New
r t[s] LB r t[s] LB
r t[s] LB r t[s] LB
123
119 Page 54 of 72 B. Nikolic et al.
Table 19 continued
n m T ype FdSdS New
r t[s] LB r t[s] LB
123
New mixed-integer linear programming model... Page 55 of 72 119
r t[s] LB r t[s] LB
123
119 Page 56 of 72 B. Nikolic et al.
Table 20 continued
n m T ype FdSdS New
r t[s] LB r t[s] LB
123
New mixed-integer linear programming model... Page 57 of 72 119
Table 20 continued
n m T ype FdSdS New
r t[s] LB r t[s] LB
r t[s] LB r t[s] LB
123
119 Page 58 of 72 B. Nikolic et al.
Table 21 continued
n m T ype FdSdS New
r t[s] LB r t[s] LB
123
New mixed-integer linear programming model... Page 59 of 72 119
Table 21 continued
n m T ype FdSdS New
r t[s] LB r t[s] LB
123
119 Page 60 of 72 B. Nikolic et al.
r t[s] LB r t[s] LB
123
New mixed-integer linear programming model... Page 61 of 72 119
Table 22 continued
n m T ype FdSdS New
r t[s] LB r t[s] LB
123
119 Page 62 of 72 B. Nikolic et al.
r t[s] LB r t[s] LB
123
New mixed-integer linear programming model... Page 63 of 72 119
Table 23 continued
n m T ype FdSdS New
r t[s] LB r t[s] LB
123
119 Page 64 of 72 B. Nikolic et al.
Table 23 continued
n m T ype FdSdS New
r t[s] LB r t[s] LB
123
New mixed-integer linear programming model... Page 65 of 72 119
r t[s] LB r t[s] LB
123
119 Page 66 of 72 B. Nikolic et al.
Table 24 continued
n m T ype FdSdS New
r t[s] LB r t[s] LB
123
New mixed-integer linear programming model... Page 67 of 72 119
Table 24 continued
n m T ype FdSdS New
r t[s] LB r t[s] LB
r t[s] LB r t[s] LB
123
119 Page 68 of 72 B. Nikolic et al.
Table 25 continued
n m T ype FdSdS New
r t[s] LB r t[s] LB
123
New mixed-integer linear programming model... Page 69 of 72 119
Table 25 continued
n m T ype FdSdS New
r t[s] LB r t[s] LB
Appendix B: Proof
m
In this appendix, we show that for a given set of vectors S ⊆ R+ , and arbitrary integer
k ∈ {2, . . . , |S|}, the objective function r of the MDMWNPP does not reach a minimum
value for the k–decomposition which contains an empty set. More precisely, we prove that
for each such k−decomposition of set S there is a corresponding k− partition of set S with
smaller value of the objective function r .
In accordance with the notation introduced in the definition of the model NEW, we use
the following abbreviations: if S = {S j | j ∈ {1, . . . , k}} is a k−decomposition of set S,
then
⎛ ⎞
yl (S ) = max ⎝ vil ⎠ , ∀l ∈ {1, . . . , m},
j∈{1,...,k}
vi ∈S j
⎛ ⎞
z l (S ) = min ⎝ vil ⎠ , ∀l ∈ {1, . . . , m},
j∈{1,...,k}
vi ∈S j
r (S ) = max {yl (S ) − zl (S )} .
l∈{1,...,m}
m
Lemma 1 Let m, n ≥ 2 be a fixed integers, and S = {vi ∈ R+ | i ∈ {1, 2, . . . , n}} is
a given set of vectors. For an arbitrary integer k ∈ {2, . . . , n} and any k−decomposition
S of set S which contains exactly one empty set exists k–partition S of set S such that
r (S ) < r (S ).
123
119 Page 70 of 72 B. Nikolic et al.
of set S. To complete the proof, it is sufficient to show that partition S has the required
property. Every member of the family S contains at least one vector and all coordinates
of all vectors are positive real numbers, which implies that zl S > 0 holds for any
l ∈ {1, . . . , m}. From this observation and definition of yl S , we get
r S = max yl S − zl S < max yl S
l∈{1,...,m} l∈{1,...,m}
⎧ ⎧ ⎫ ⎫
⎪
⎨ ⎨ ⎬ ⎪
⎬
= max max vil , vil , vil
⎩ j∈{1,...,k−1}\{ j0 } ⎩vi ∈S j ⎭
l∈{1,...,m} ⎪ ⎪
⎭
vi ∈S j vi ∈S j
0 0
⎧ ⎧ ⎫ ⎛ ⎞ ⎫
⎨ ⎨ ⎬ ⎬
= max max vil , vi0 l , ⎝ vil ⎠ − vi0 l
l∈{1,...,m} ⎩ j∈{1,...,k−1}\{ j0 } ⎩ ⎭ ⎭
vi ∈S j vi ∈S j0
This means that inequality yl (S ) ≤ yl (S ) holds for each index l ∈ {1, . . . , m}. From this
fact and the previous observations, we conclude r (S ) < r (S ).
Now, we generalize the claim from the previous lemma to the case of k-decompositions
of set S with at least one empty set.
m
Theorem 1 Let m, n ≥ 2 be a fixed integers, and S = {vi ∈ R+ | i ∈ {1, . . . , n}} is
a given set of vectors. For an arbitrary integer k ∈ {2, . . . , n} and any k–decomposition
S of set S which contains at least one empty sets exists k–partition S of set S such that
r (S ) < r (S ).
123
New mixed-integer linear programming model... Page 71 of 72 119
To complete the proof, it is sufficient to show that family S := Sq has the required property.
Indeed, the condition (i) implies that S is a k-partition of set S, while applying conditions
(ii) and (iii), we conclude
r (S ) < r (Sq−1 ∪ {∅}) ≤ r (Sq−2 ∪ {∅, ∅}) ≤ . . . ≤ r (S0 ∪ {∅, . . . , ∅}) = r (S ).
q
The consequence of the previous theorem is that from a standpoint of minimum of objective
function of the MDMWNPP it makes no difference in the definition of this problem if we
require that a family {S j | j ∈ {1, 2, . . . , k}} is a k–decomposition or a k–partition of set S,
m
as long as the condition S ⊆ R+ is fulfilled. This resolves a potential ambiguity which
may arise in the definition of the MDMWNPP, since all the published papers regarding
this problem used the same starting sets of instances for which the mentioned condition is
satisfied.
References
Coffman EG, Lueker GS (1991) Probabilistic analysis of packing and partitioning algorithms. Wiley, Ams-
terdam
Faria AF, de Souza SR, de Sá EM (2020) A mixed-integer linear programming model to solve the multidi-
mensional multi-way number partitioning problem. Comput Oper Res 127:105133
Fuksz L, Pop P, Zelina I (2013) Heuristic algorithms for solving the bi-dimensional two-way number parti-
tioning problem. Stud Univ Babes-Bolyai Ser Inf 58(3):17–28
Hacibeyoglu M, Alaykiran K, Acilar AM, Tongur V, Ulker E (2018) A comparative analysis of metaheuristic
approaches for multidimensional two-way number partitioning problem. Arab J Sci Eng 43(12):7499–
7520
Hacibeyoglu M, Tongur V, Alaykiran K (2014) Solving the bi-dimensional two-way number partitioning prob-
lem with heuristic algorithms. In: 2014 IEEE 8th international conference on application of information
and communication technologies (AICT), pp 1–5, IEEE
Hayes B (2002) Computing science: the easiest hard problem. Am Sci 90(2):113–117
Karp RM (1975) On the computational complexity of combinatorial problems. Networks 5(1):45–68
Kojić J (2010) Integer linear programming model for multidimensional two-way number partitioning problem.
Comput Math Appl 60(8):2302–2308
123
119 Page 72 of 72 B. Nikolic et al.
Publisher’s Note Springer Nature remains neutral with regard to jurisdictional claims in published maps and
institutional affiliations.
123