# Assignment Problems with Weighted and Nonweighted Neighborhood Constraints in 36 , 44 and 63 Tilings

A.A.D. Bosaing J.F. Rabajante M.L.D. De Lara

Institute of Mathematical Sciences and Physics University of the Philippines Los Baños

International Conference in Mathematics and Applications, 2011

Bosaing et al. (IMSP, UPLB)

Assignment Problems...

ICMA 2011

1 / 42

Introduction

The Assignment Problem

Outline
1

2

3

4

Introduction The Assignment Problem Weighted Neighborhood Constraint Nonweighted Neighborhood Constraint Parameters and Decision Variables Weighted Neighborhood Constraint 36 Tiling 44 Tiling 63 Tiling Nonweighted Neighborhood Constraint 36 Tiling 44 Tiling 63 Tiling Illustrative Example Weighted and Nonweighted Neighborhood Constraint
Bosaing et al. (IMSP, UPLB) Assignment Problems... ICMA 2011 2 / 42

Introduction

The Assignment Problem

Assignment Problem

ASSIGNMENT: elements of given ﬁnite sets should be assigned to the compartments of a ﬁnite tiling
regular tilings of regular polygons in Euclidean plane (36 , 44 and 63 )

CONSTRAINT: costs of having adjacent elements from different sets are minimized
two compartments are adjacent if they share a common edge we assign weights ωg and ωg to sets g and g, respectively cost of adjacency= ωg − ωg

Bosaing et al. (IMSP, UPLB)

Assignment Problems...

ICMA 2011

3 / 42

Introduction

The Assignment Problem

Assignment Problem

ASSIGNMENT: elements of given ﬁnite sets should be assigned to the compartments of a ﬁnite tiling
regular tilings of regular polygons in Euclidean plane (36 , 44 and 63 )

CONSTRAINT: costs of having adjacent elements from different sets are minimized
two compartments are adjacent if they share a common edge we assign weights ωg and ωg to sets g and g, respectively cost of adjacency= ωg − ωg

Bosaing et al. (IMSP, UPLB)

Assignment Problems...

ICMA 2011

3 / 42

Introduction

The Assignment Problem

Assignment Problem

ASSIGNMENT: elements of given ﬁnite sets should be assigned to the compartments of a ﬁnite tiling
regular tilings of regular polygons in Euclidean plane (36 , 44 and 63 )

CONSTRAINT: costs of having adjacent elements from different sets are minimized
two compartments are adjacent if they share a common edge we assign weights ωg and ωg to sets g and g, respectively cost of adjacency= ωg − ωg

Bosaing et al. (IMSP, UPLB)

Assignment Problems...

ICMA 2011

3 / 42

.Introduction The Assignment Problem Assignment Problem ASSIGNMENT: elements of given ﬁnite sets should be assigned to the compartments of a ﬁnite tiling regular tilings of regular polygons in Euclidean plane (36 . 44 and 63 ) CONSTRAINT: costs of having adjacent elements from different sets are minimized two compartments are adjacent if they share a common edge we assign weights ωg and ωg to sets g and g. UPLB) Assignment Problems. (IMSP.. ICMA 2011 3 / 42 . respectively cost of adjacency= ωg − ωg Bosaing et al.

(IMSP. UPLB) Assignment Problems. 44 and 63 ) CONSTRAINT: costs of having adjacent elements from different sets are minimized two compartments are adjacent if they share a common edge we assign weights ωg and ωg to sets g and g. respectively cost of adjacency= ωg − ωg Bosaing et al..Introduction The Assignment Problem Assignment Problem ASSIGNMENT: elements of given ﬁnite sets should be assigned to the compartments of a ﬁnite tiling regular tilings of regular polygons in Euclidean plane (36 .. ICMA 2011 3 / 42 .

ICMA 2011 3 / 42 . (IMSP..Introduction The Assignment Problem Assignment Problem ASSIGNMENT: elements of given ﬁnite sets should be assigned to the compartments of a ﬁnite tiling regular tilings of regular polygons in Euclidean plane (36 . UPLB) Assignment Problems.. respectively cost of adjacency= ωg − ωg Bosaing et al. 44 and 63 ) CONSTRAINT: costs of having adjacent elements from different sets are minimized two compartments are adjacent if they share a common edge we assign weights ωg and ωg to sets g and g.

UPLB) Assignment Problems. ICMA 2011 4 / 42 .. (IMSP..Introduction The Assignment Problem Assignment Problem Figure: Assignment Problem as Weighted Bipartite Graph Bosaing et al.

ICMA 2011 5 / 42 .Introduction Weighted Neighborhood Constraint Outline 1 2 3 4 Introduction The Assignment Problem Weighted Neighborhood Constraint Nonweighted Neighborhood Constraint Parameters and Decision Variables Weighted Neighborhood Constraint 36 Tiling 44 Tiling 63 Tiling Nonweighted Neighborhood Constraint 36 Tiling 44 Tiling 63 Tiling Illustrative Example Weighted and Nonweighted Neighborhood Constraint Bosaing et al. UPLB) Assignment Problems. (IMSP...

Introduction Weighted Neighborhood Constraint Weighted Neighborhood Constraint Figure: Weighted Neighborhood Constraint Bosaing et al. UPLB) Assignment Problems. (IMSP.. ICMA 2011 6 / 42 ..

UPLB) Assignment Problems... ICMA 2011 7 / 42 . (IMSP.Introduction Nonweighted Neighborhood Constraint Outline 1 2 3 4 Introduction The Assignment Problem Weighted Neighborhood Constraint Nonweighted Neighborhood Constraint Parameters and Decision Variables Weighted Neighborhood Constraint 36 Tiling 44 Tiling 63 Tiling Nonweighted Neighborhood Constraint 36 Tiling 44 Tiling 63 Tiling Illustrative Example Weighted and Nonweighted Neighborhood Constraint Bosaing et al.

..Introduction Nonweighted Neighborhood Constraint Nonweighted Neighborhood Constraint Figure: Weighted VS Nonweighted Neighborhood Constraint Bosaing et al. (IMSP. ICMA 2011 8 / 42 . UPLB) Assignment Problems.

ICMA 2011 9 / 42 .. (IMSP..Introduction Nonweighted Neighborhood Constraint Nonweighted Neighborhood Constraint Figure: Weighted VS Nonweighted Neighborhood Constraint Bosaing et al. UPLB) Assignment Problems.

.Introduction Parameters and Decision Variables Outline 1 2 3 4 Introduction The Assignment Problem Weighted Neighborhood Constraint Nonweighted Neighborhood Constraint Parameters and Decision Variables Weighted Neighborhood Constraint 36 Tiling 44 Tiling 63 Tiling Nonweighted Neighborhood Constraint 36 Tiling 44 Tiling 63 Tiling Illustrative Example Weighted and Nonweighted Neighborhood Constraint Bosaing et al. ICMA 2011 10 / 42 . (IMSP.. UPLB) Assignment Problems.

Introduction Parameters and Decision Variables Weighted Neighborhood Constraint 36 Tiling Let the binary-valued decision variables be   0. ICMA 2011 11 / 42 . Bosaing et al. .. .. . 2. . c r is the number of rows c is the number of columns Let Ng be the number of elements in set g for g = 1. otherwise for i = 1. (IMSP. if an element from set g is not assigned to the compartment at the i−th row and j−th column xgij =  1. . . . . UPLB) Assignment Problems. . r and j = 1. . . 2. . k where k is the number of sets. 2.

.Weighted Neighborhood Constraint 36 Tiling Outline 1 2 3 4 Introduction The Assignment Problem Weighted Neighborhood Constraint Nonweighted Neighborhood Constraint Parameters and Decision Variables Weighted Neighborhood Constraint 36 Tiling 44 Tiling 63 Tiling Nonweighted Neighborhood Constraint 36 Tiling 44 Tiling 63 Tiling Illustrative Example Weighted and Nonweighted Neighborhood Constraint Bosaing et al. UPLB) Assignment Problems.. (IMSP. ICMA 2011 12 / 42 .

(IMSP. ICMA 2011 13 / 42 . UPLB) Assignment Problems.Weighted Neighborhood Constraint 36 Tiling Weighted Neighborhood Constraint 36 Tiling Figure: Starting with adjacent (column) compartment and starting with non-adjacent (column) compartment Bosaing et al...

.. UPLB) Assignment Problems.Weighted Neighborhood Constraint 36 Tiling Weighted Neighborhood Constraint 36 Tiling Figure: Graph representation Figure: Adjacencies Bosaing et al. (IMSP. ICMA 2011 14 / 42 .

. UPLB) ICMA 2011 15 / 42 . (IMSP. ωg xg(2i)(2j−1) (O3) Bosaing et al..Weighted Neighborhood Constraint 36 Tiling Weighted Neighborhood Constraint 36 Tiling: Starting with adjacent (column) compartment The integer program is Minimize r c−1 k k ωg xgij − i=1 j=1 g=1 g=1 ωg xgi(j+1) (O1) r /2 −1 c/2 k k + i=1 j=1 g=1 ωg xg(2i)(2j) − g=1 ωg xg(2i+1)(2j) (O2) r /2 c/2 k k + i=1 j=1 g=1 ωg xg(2i−1)(2j−1) − g=1 Assignment Problems.

2. 2. 2. . . . if ij−th compartment is a dummy compartment ≤ 1. (IMSP. j = 1. otherwise Constraint 2: For g = 1. . . c. r c xgij = Ng i=1 j=1 Constraint 3: For i = 1. . r .. . UPLB) Assignment Problems.Weighted Neighborhood Constraint 36 Tiling Weighted Neighborhood Constraint 36 Tiling: Starting with adjacent (column) compartment subject to Constraint 1: For i = 1. . k . . 1} Bosaing et al. xgij ∈ {0. . 2. . .. . k xgij g=1 = 0. . r and j = 1. 2. c and g = 1. 2. . . . . . . k . . . ICMA 2011 16 / 42 . . .

2. k k ωg xgij − g=1 g=1 ωg xgi(j+1) − αij ≤ 0 Bosaing et al..Weighted Neighborhood Constraint 36 Tiling Weighted Neighborhood Constraint 36 Tiling: Starting with adjacent (column) compartment The linearized objective function is Minimize r c−1 r /2 −1 c/2 r /2 c/2 αij + i=1 j=1 i=1 j=1 β(2i)(2j) + i=1 j=1 γ(2i−1)(2j−1) subject to Constraint 1: For i = 1. . c − 1. . ICMA 2011 17 / 42 . (IMSP. UPLB) Assignment Problems. r and j = 1. . . . . . . 2..

. . 2. r and j = 1.. . . 2. k k − g=1 ωg xg(2i)(2j) + g=1 ωg xg(2i+1)(2j) − β(2i)(2j) ≤ 0 ICMA 2011 18 / 42 Bosaing et al. k k − g=1 ωg xgij + g=1 ωg xgi(j+1) − αij ≤ 0 Constraint 3: For i = 1. . . . 2.Weighted Neighborhood Constraint 36 Tiling Weighted Neighborhood Constraint 36 Tiling: Starting with adjacent (column) compartment continuation.. . k k ωg xg(2i)(2j) − g=1 g=1 ωg xg(2i+1)(2j) − β(2i)(2j) ≤ 0 Constraint 4: For i = 1. r /2 − 1 and j = 1. . . (IMSP. UPLB) Assignment Problems. . r /2 − 1 and j = 1. . . ... . 2. . . . c/2 . c/2 . . . c − 1. . . . Constraint 2: For i = 1. 2. 2. . .

. k k ωg xg(2i−1)(2j−1) − g=1 g=1 ωg xg(2i)(2j−1) − γ(2i−1)(2j−1) ≤ 0 Constraint 6: For i = 1. . .. . k k − g=1 ωg xg(2i−1)(2j−1) + g=1 ωg xg(2i)(2j−1) − γ(2i−1)(2j−1) ≤ 0 Bosaing et al. .. c/2 . r /2 and j = 1.. r /2 and j = 1. c/2 .. 2. 2. . . . . 2. ICMA 2011 19 / 42 . UPLB) Assignment Problems. 2. . . . (IMSP. .Weighted Neighborhood Constraint 36 Tiling Weighted Neighborhood Constraint 36 Tiling: Starting with adjacent (column) compartment continuation. . Constraint 5: For i = 1. . .

ωg xg(2i)(2j) (O3) Bosaing et al. UPLB) ICMA 2011 20 / 42 ...Weighted Neighborhood Constraint 36 Tiling Weighted Neighborhood Constraint 36 Tiling: Starting with non-adjacent (column) compartment The objective function of the integer program is Minimize r c−1 k k ωg xgij − i=1 j=1 g=1 g=1 ωg xgi(j+1) (O1) r /2 −1 c/2 k k + i=1 j=1 g=1 ωg xg(2i)(2j−1) − g=1 ωg xg(2i+1)(2j−1) (O2) r /2 c/2 k k + i=1 j=1 g=1 ωg xg(2i−1)(2j) − g=1 Assignment Problems. (IMSP.

Weighted Neighborhood Constraint 44 Tiling Outline 1 2 3 4 Introduction The Assignment Problem Weighted Neighborhood Constraint Nonweighted Neighborhood Constraint Parameters and Decision Variables Weighted Neighborhood Constraint 36 Tiling 44 Tiling 63 Tiling Nonweighted Neighborhood Constraint 36 Tiling 44 Tiling 63 Tiling Illustrative Example Weighted and Nonweighted Neighborhood Constraint Bosaing et al. UPLB) Assignment Problems.. ICMA 2011 21 / 42 .. (IMSP.

. ICMA 2011 22 / 42 . (IMSP.. UPLB) Assignment Problems.Weighted Neighborhood Constraint 44 Tiling Weighted Neighborhood Constraint 44 Tiling The objective function of the integer program is Minimize r c−1 k k r −1 c k k ωg xgij − i=1 j=1 g=1 g=1 ωg xgi(j+1) + i=1 j=1 g=1 ωg xgij − g=1 ωg xg(i+1)j Figure: Adjacencies in square tiling Bosaing et al.

Weighted Neighborhood Constraint 63 Tiling Outline 1 2 3 4 Introduction The Assignment Problem Weighted Neighborhood Constraint Nonweighted Neighborhood Constraint Parameters and Decision Variables Weighted Neighborhood Constraint 36 Tiling 44 Tiling 63 Tiling Nonweighted Neighborhood Constraint 36 Tiling 44 Tiling 63 Tiling Illustrative Example Weighted and Nonweighted Neighborhood Constraint Bosaing et al.. UPLB) Assignment Problems. (IMSP.. ICMA 2011 23 / 42 .

. ICMA 2011 24 / 42 . (IMSP. UPLB) Assignment Problems.Weighted Neighborhood Constraint 63 Tiling Weighted Neighborhood Constraint 63 Tiling Figure: Adjacencies in hexagonal tiling Bosaing et al..

Weighted Neighborhood Constraint 63 Tiling Weighted Neighborhood Constraint 63 Tiling The objective function of the integer program is Minimize r c−1 k k ωg xgij − i=1 j=1 g=1 g=1 ωg xgi(j+1) (O1) r −1 c k k + i=1 j=1 g=1 ωg xgij − g=1 ωg xg(i+1)j (O2) r −1 c k k + i=1 j=2 g=1 Bosaing et al. ICMA 2011 25 / 42 . (IMSP. UPLB) ωg xgij − g=1 ωg xg(i+1)(j−1) (O3) Assignment Problems...

UPLB) Assignment Problems.Nonweighted Neighborhood Constraint 36 Tiling Outline 1 2 3 4 Introduction The Assignment Problem Weighted Neighborhood Constraint Nonweighted Neighborhood Constraint Parameters and Decision Variables Weighted Neighborhood Constraint 36 Tiling 44 Tiling 63 Tiling Nonweighted Neighborhood Constraint 36 Tiling 44 Tiling 63 Tiling Illustrative Example Weighted and Nonweighted Neighborhood Constraint Bosaing et al... (IMSP. ICMA 2011 26 / 42 .

. ak . . κ(k −1)(O ) = (ak −1 y1 + ak y2 + · · · + ak −3 yk −1 + ak −2 yk ) −(bk −1 z1 + bk z2 + · · · + bk −3 zk −1 + bk −2 zk ) κk (O ) = (ak y1 + a1 y2 + · · · + ak −2 yk −1 + ak −1 yk ) −(bk z1 + b1 z2 + · · · + bk −2 zk −1 + bk −1 zk ). y2 . . zk . z2 . . . . . respectively. .Nonweighted Neighborhood Constraint 36 Tiling Nonweighted Neighborhood Constraint Suppose a1 . bk be the dummy weights associated to the decision variables y1 . (IMSP. b1 . κ1(O ) Bosaing et al. z1 . . . UPLB) Assignment Problems. .. . . a2 . . then deﬁne the relation ρ(O ) as ρ(O ) (|(a1 y1 + a2 y2 + · · · + ak yk ) − (b1 z1 + b2 z2 + · · · + bk zk )|) = κ1(O ) + κ2(O ) + · · · + κk (O ) where = (a1 y1 + a2 y2 + · · · + ak −1 yk −1 + ak yk ) −(b1 z1 + b2 z2 + · · · + bk −1 zk −1 + bk zk ) κ2(O ) = (a2 y1 + a3 y2 + · · · + ak yk −1 + a1 yk ) −(b2 z1 + b3 z2 + · · · + bk zk −1 + b1 zk ) κ3(O ) = (a3 y1 + a4 y2 + · · · + a1 yk −1 + a2 yk ) −(b3 z1 + b4 z2 + · · · + b1 zk −1 + b2 zk ) . yk . ICMA 2011 27 / 42 . . . b2 . . . .

Nonweighted Neighborhood Constraint 36 Tiling Nonweighted Neighborhood Constraint For simplicity. (IMSP.. ICMA 2011 28 / 42 . we let ωg = g. UPLB) Assignment Problems.. Figure: Circular Shift Permutation of the dummy weights Bosaing et al.

(IMSP..Nonweighted Neighborhood Constraint 36 Tiling Nonweighted Neighborhood Constraint 36 Tiling: Starting with adjacent (column) compartment The objective function of the integer program is Minimize r c−1  ρ(O1)  k k  ωg xgi(j+1)  (O1) ωg xgij − g=1 g=1 i=1 j=1 r /2 −1 c/2  ρ(O2)  k k  ωg xg(2i+1)(2j)  (O2) + i=1 j=1 ωg xg(2i)(2j) − g=1 g=1 r /2 c/2  ρ(O3)  k k  ωg xg(2i)(2j−1)  (O3) + i=1 j=1 ωg xg(2i−1)(2j−1) − g=1 g=1 Bosaing et al. ICMA 2011 29 / 42 . UPLB) Assignment Problems..

k . 2.. . . . . (IMSP. ICMA 2011 30 / 42 . . . .Nonweighted Neighborhood Constraint 36 Tiling Nonweighted Neighborhood Constraint 36 Tiling: Starting with adjacent (column) compartment The linearized objective function is Minimize r c−1 k r /2 −1 c/2 k r /2 c/2 k αhij + i=1 j=1 h=1 i=1 j=1 h=1 βh(2i)(2j) + i=1 j=1 h=1 γh(2i−1)(2j−1) subject to Constraint 1: For h = 1.. . r and j = 1. UPLB) Assignment Problems. i = 1. c − 1. κh(O1) − αhij ≤ 0 Bosaing et al. . . . . 2. 2.

. . 2. . . . 2. r /2 − 1 and j = 1. . 2. . UPLB) Assignment Problems. 2. .. . . −κh(O1) − αhij ≤ 0 Constraint 3: For h = 1. . . 2. r /2 − 1 and j = 1. 2. . . k . . . . . . k . . . (IMSP. . . c/2 . 2. . . . c/2 . i = 1. 2. ICMA 2011 31 / 42 . .. i = 1. .. .. . κh(O2) − βh(2i)(2j) ≤ 0 Constraint 4: For h = 1. . Constraint 2: For h = 1. 2. . r and j = 1. c − 1. . −κh(O2) − βh(2i)(2j) ≤ 0 Bosaing et al. .Nonweighted Neighborhood Constraint 36 Tiling Nonweighted Neighborhood Constraint 36 Tiling: Starting with adjacent (column) compartment continuation. . . k . i = 1.

−κh(O3) − γh(2i−1)(2j−1) ≤ 0 Bosaing et al. κh(O3) − γh(2i−1)(2j−1) ≤ 0 Constraint 6: For h = 1. . 2. . . . . c/2 .. .Nonweighted Neighborhood Constraint 36 Tiling Nonweighted Neighborhood Constraint 36 Tiling: Starting with adjacent (column) compartment continuation. .. Constraint 5: For h = 1. . . . . i = 1. r /2 and j = 1. . 2. 2. . 2. ICMA 2011 32 / 42 . . . . . k . . UPLB) Assignment Problems. r /2 and j = 1. . (IMSP. . i = 1. 2. . . . k . c/2 . 2.. ..

(IMSP.. ICMA 2011 33 / 42 . UPLB) Assignment Problems..Nonweighted Neighborhood Constraint 36 Tiling Nonweighted Neighborhood Constraint 36 Tiling: Starting with non-adjacent (column) compartment The objective function of the integer program is Minimize r c−1  ρ(O1)  k k  ωg xgi(j+1)  (O1) ωg xgij − g=1 g=1 i=1 j=1 r /2 −1 c/2  ρ(O2)  k k  ωg xg(2i+1)(2j−1)  (O2) + i=1 j=1 ωg xg(2i)(2j−1) − g=1 g=1 r /2 c/2  ρ(O3)  k k  ωg xg(2i)(2j)  (O3) + i=1 j=1 ωg xg(2i−1)(2j) − g=1 g=1 Bosaing et al.

..Nonweighted Neighborhood Constraint 44 Tiling Outline 1 2 3 4 Introduction The Assignment Problem Weighted Neighborhood Constraint Nonweighted Neighborhood Constraint Parameters and Decision Variables Weighted Neighborhood Constraint 36 Tiling 44 Tiling 63 Tiling Nonweighted Neighborhood Constraint 36 Tiling 44 Tiling 63 Tiling Illustrative Example Weighted and Nonweighted Neighborhood Constraint Bosaing et al. ICMA 2011 34 / 42 . UPLB) Assignment Problems. (IMSP.

. (IMSP..Nonweighted Neighborhood Constraint 44 Tiling Nonweighted Neighborhood Constraint 44 Tiling The objective function of the integer program is Minimize r c−1  ρ(O1)  k k  ωg xgi(j+1)  (O1) ωg xgij − g=1 g=1 i=1 j=1 r −1 c  ρ(O2)  k k  ωg xg(i+1)j  (O2) + i=1 j=1 ωg xgij − g=1 g=1 Bosaing et al. UPLB) Assignment Problems. ICMA 2011 35 / 42 .

(IMSP.Nonweighted Neighborhood Constraint 63 Tiling Outline 1 2 3 4 Introduction The Assignment Problem Weighted Neighborhood Constraint Nonweighted Neighborhood Constraint Parameters and Decision Variables Weighted Neighborhood Constraint 36 Tiling 44 Tiling 63 Tiling Nonweighted Neighborhood Constraint 36 Tiling 44 Tiling 63 Tiling Illustrative Example Weighted and Nonweighted Neighborhood Constraint Bosaing et al. ICMA 2011 36 / 42 .. UPLB) Assignment Problems..

ICMA 2011 37 / 42 .Nonweighted Neighborhood Constraint 63 Tiling Nonweighted Neighborhood Constraint 63 Tiling The objective function of the integer program is Minimize r c−1  ρ(O1)  k k  ωg xgi(j+1)  (O1) ωg xgij − g=1 g=1 i=1 j=1 r −1 c  ρ(O2)  k k  ωg xg(i+1)j  (O2) + i=1 j=1 ωg xgij − g=1 g=1 r −1 c  ρ(O3)  k k  ωg xg(i+1)(j−1)  (O3) + i=1 j=2 ωg xgij − g=1 g=1 Bosaing et al.. UPLB) Assignment Problems.. (IMSP.

UPLB) Assignment Problems.Illustrative Example Weighted and Nonweighted Neighborhood Constraint Outline 1 2 3 4 Introduction The Assignment Problem Weighted Neighborhood Constraint Nonweighted Neighborhood Constraint Parameters and Decision Variables Weighted Neighborhood Constraint 36 Tiling 44 Tiling 63 Tiling Nonweighted Neighborhood Constraint 36 Tiling 44 Tiling 63 Tiling Illustrative Example Weighted and Nonweighted Neighborhood Constraint Bosaing et al.. ICMA 2011 38 / 42 . (IMSP..

.Illustrative Example Weighted and Nonweighted Neighborhood Constraint Illustrative Example Table: Distribution of elements per group. (IMSP.. ICMA 2011 39 / 42 . UPLB) Assignment Problems. Group Number of elements Group 1 3 Group 2 4 Group 3 5 Assume ωg = g Bosaing et al.

. ICMA 2011 40 / 42 . (IMSP.Illustrative Example Weighted and Nonweighted Neighborhood Constraint Weighted Neighborhood Constraint Figure: Optimal Solutions Bosaing et al. UPLB) Assignment Problems..

UPLB) Assignment Problems.. ICMA 2011 41 / 42 .Illustrative Example Weighted and Nonweighted Neighborhood Constraint Nonweighted Neighborhood Constraint Figure: Optimal Solutions Bosaing et al.. (IMSP.

H. Cebu. ICMA 2011 42 / 42 . Operations Research: An Introduction. Bosaing et al.. 2010. J. Prentice Hall. F.Appendix References References Taha.. Order in mathematically ideal porous arrays: the regular tilings. Determining the Optimal Distribution of Bee Colony Locations To Avoid Overpopulation Using Mixed Integer Programming.cs. Villadelrey. Bultheel. and Rabajante. Philippines. Population assignments in grids with neighborhood constraint.kuleuven. 9(1):79–82. Int. International Industrial Engineering Conference: Research. Kaatz.L. 2(3):259–289.A. R. 2010.. Journal of Nature Studies. Applications and Best Practices August 2010. and Egami. J. M.J.F. 2006.html De Lara. M..be/papers/ade/regulartiles/index.P. (IMSP. M. Linear programming formulation of the vertex colouring problem.C. A.F. UPLB) Assignment Problems. Diaby. http://nalag. and Rabajante.D. J. Esteves. H. T. Mathematics in Operational Research.

Journal of Nature Studies. Mathematics in Operational Research. Applications and Best Practices August 2010. Esteves. M. F. (IMSP. Determining the Optimal Distribution of Bee Colony Locations To Avoid Overpopulation Using Mixed Integer Programming.kuleuven.P. M. T.html De Lara. M.A. Villadelrey. http://nalag. Kaatz. 9(1):79–82.J. and Rabajante.F.. R.L. 2006. and Egami. Int.Appendix References References Taha. J.F.C. UPLB) Assignment Problems..H.be/papers/ade/regulartiles/index. Diaby.cs. ICMA 2011 42 / 42 . Philippines. Population assignments in grids with neighborhood constraint. 2010. Operations Research: An Introduction. Prentice Hall. Bultheel. Order in mathematically ideal porous arrays: the regular tilings. J. A. J. Linear programming formulation of the vertex colouring problem. 2010..D.. and Rabajante. 2(3):259–289. International Industrial Engineering Conference: Research. H. Bosaing et al. Cebu.

9(1):79–82. Bosaing et al. and Rabajante. M. Bultheel.J. Villadelrey.F. H.D. Population assignments in grids with neighborhood constraint. J. Prentice Hall.. T. R. A. International Industrial Engineering Conference: Research.L.A.P.Appendix References References Taha.kuleuven. Operations Research: An Introduction.be/papers/ade/regulartiles/index. and Rabajante..cs. 2(3):259–289.html De Lara. Journal of Nature Studies. J. (IMSP. Applications and Best Practices August 2010. Diaby. 2006. http://nalag. Linear programming formulation of the vertex colouring problem. Kaatz. Cebu. Order in mathematically ideal porous arrays: the regular tilings. Philippines. J. Esteves. M.. F.H. M.C. Mathematics in Operational Research.. and Egami. UPLB) Assignment Problems. 2010. Int. 2010. ICMA 2011 42 / 42 . Determining the Optimal Distribution of Bee Colony Locations To Avoid Overpopulation Using Mixed Integer Programming.F.

kuleuven. 2010. Bultheel. M. and Egami. Order in mathematically ideal porous arrays: the regular tilings.html De Lara. 2(3):259–289.P.. Journal of Nature Studies.cs. Applications and Best Practices August 2010.. 9(1):79–82.A.L. Prentice Hall. Linear programming formulation of the vertex colouring problem. M. T. J. (IMSP. F.. International Industrial Engineering Conference: Research. H. Operations Research: An Introduction. Esteves. J. Cebu. Villadelrey. ICMA 2011 42 / 42 . and Rabajante.H. A. M. Diaby. 2010.J. Bosaing et al. Philippines. UPLB) Assignment Problems.F.be/papers/ade/regulartiles/index. 2006. R. Kaatz.Appendix References References Taha. http://nalag. J. Mathematics in Operational Research..F. Determining the Optimal Distribution of Bee Colony Locations To Avoid Overpopulation Using Mixed Integer Programming.C. and Rabajante. Population assignments in grids with neighborhood constraint.D. Int.

Esteves.. Applications and Best Practices August 2010. Kaatz. (IMSP.J. Bosaing et al. International Industrial Engineering Conference: Research. Int. and Egami. 9(1):79–82. M. J.L. and Rabajante. A. 2010.D.P. M.cs. R. Mathematics in Operational Research. T. F. H.H. 2(3):259–289. Linear programming formulation of the vertex colouring problem.be/papers/ade/regulartiles/index.F.. Determining the Optimal Distribution of Bee Colony Locations To Avoid Overpopulation Using Mixed Integer Programming.kuleuven. 2010. Prentice Hall. Villadelrey. Order in mathematically ideal porous arrays: the regular tilings.. 2006. Philippines. UPLB) Assignment Problems. J.html De Lara. ICMA 2011 42 / 42 . Cebu. Bultheel. Operations Research: An Introduction.A. and Rabajante. Population assignments in grids with neighborhood constraint. http://nalag.C.Appendix References References Taha. J. M.. Journal of Nature Studies.F. Diaby.