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 Baos

International Conference in Mathematics and Applications, 2011

Bosaing et al. (IMSP, UPLB)

Assignment Problems...

ICMA 2011

1 / 42

Introduction

The Assignment Problem

Outline
1

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, 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

Figure: Assignment Problem as Weighted Bipartite Graph

Bosaing et al. (IMSP, UPLB) Assignment Problems... ICMA 2011 4 / 42

Introduction

Weighted Neighborhood Constraint

Outline
1

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 5 / 42

Introduction

Weighted Neighborhood Constraint

Weighted Neighborhood Constraint

Figure: Weighted Neighborhood Constraint

Bosaing et al. (IMSP, UPLB) Assignment Problems... ICMA 2011 6 / 42

Introduction

Nonweighted Neighborhood Constraint

Outline
1

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 7 / 42

Introduction

Nonweighted Neighborhood Constraint

Nonweighted Neighborhood Constraint

Figure: Weighted VS Nonweighted Neighborhood Constraint

Bosaing et al. (IMSP, UPLB) Assignment Problems... ICMA 2011 8 / 42

Introduction

Nonweighted Neighborhood Constraint

Nonweighted Neighborhood Constraint

Figure: Weighted VS Nonweighted Neighborhood Constraint

Bosaing et al. (IMSP, UPLB)

Assignment Problems...

ICMA 2011

9 / 42

Introduction

Parameters and Decision Variables

Outline
1

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 10 / 42

Introduction

Parameters and Decision Variables

Weighted Neighborhood Constraint

36 Tiling

Let the binary-valued decision variables be 0, if an element from set g is not assigned to the compartment at the ith row and jth column xgij = 1, otherwise for i = 1, 2, . . . , r and j = 1, 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, 2, . . . , k where k is the number of sets.

Bosaing et al. (IMSP, UPLB)

Assignment Problems...

ICMA 2011

11 / 42

Weighted Neighborhood Constraint

36 Tiling

Outline
1

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 12 / 42

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. (IMSP, UPLB)

Assignment Problems...

ICMA 2011

13 / 42

Weighted Neighborhood Constraint

36 Tiling

Weighted Neighborhood Constraint

36 Tiling

Figure: Graph representation

Figure: Adjacencies
Bosaing et al. (IMSP, UPLB) Assignment Problems... ICMA 2011 14 / 42

Weighted Neighborhood Constraint

36 Tiling

Weighted Neighborhood Constraint

36 Tiling: Starting with adjacent (column) compartment

The integer program is Minimize

r c1 k k

g xgij
i=1 j=1 g=1 g=1

g xgi(j+1)

(O1)

r /2 1 c/2

+
i=1 j=1 g=1

g xg(2i)(2j)
g=1

g xg(2i+1)(2j)

(O2)

r /2

c/2

+
i=1 j=1 g=1

g xg(2i1)(2j1)
g=1
Assignment Problems...

g xg(2i)(2j1)

(O3)

Bosaing et al. (IMSP, UPLB)

ICMA 2011

15 / 42

Weighted Neighborhood Constraint

36 Tiling

Weighted Neighborhood Constraint

36 Tiling: Starting with adjacent (column) compartment

subject to Constraint 1: For i = 1, 2, . . . , r and j = 1, 2, . . . , c,

k

xgij
g=1

= 0, if ijth compartment is a dummy compartment 1, otherwise

Constraint 2: For g = 1, 2, . . . , k ,
r c

xgij = Ng
i=1 j=1

Constraint 3: For i = 1, 2, . . . , r , j = 1, 2, . . . , c and g = 1, 2, . . . , k , xgij {0, 1}

Bosaing et al. (IMSP, UPLB) Assignment Problems... ICMA 2011 16 / 42

Weighted Neighborhood Constraint

36 Tiling

Weighted Neighborhood Constraint

36 Tiling: Starting with adjacent (column) compartment

The linearized objective function is Minimize

r c1 r /2 1 c/2 r /2 c/2

ij +
i=1 j=1 i=1 j=1

(2i)(2j) +
i=1 j=1

(2i1)(2j1)

subject to Constraint 1: For i = 1, 2, . . . , r and j = 1, 2, . . . , c 1,

k k

g xgij
g=1 g=1

g xgi(j+1) ij 0

Bosaing et al. (IMSP, UPLB)

Assignment Problems...

ICMA 2011

17 / 42

Weighted Neighborhood Constraint

36 Tiling

Weighted Neighborhood Constraint

36 Tiling: Starting with adjacent (column) compartment

continuation... Constraint 2: For i = 1, 2, . . . , r and j = 1, 2, . . . , c 1,

k k

g=1

g xgij +
g=1

g xgi(j+1) ij 0

Constraint 3: For i = 1, 2, . . . , r /2 1 and j = 1, 2, . . . , c/2 ,

k k

g xg(2i)(2j)
g=1 g=1

g xg(2i+1)(2j) (2i)(2j) 0

Constraint 4: For i = 1, 2, . . . , r /2 1 and j = 1, 2, . . . , c/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. (IMSP, UPLB)

Assignment Problems...

Weighted Neighborhood Constraint

36 Tiling

Weighted Neighborhood Constraint

36 Tiling: Starting with adjacent (column) compartment

continuation... Constraint 5: For i = 1, 2, . . . , r /2 and j = 1, 2, . . . , c/2 ,

k k

g xg(2i1)(2j1)
g=1 g=1

g xg(2i)(2j1) (2i1)(2j1) 0

Constraint 6: For i = 1, 2, . . . , r /2 and j = 1, 2, . . . , c/2 ,

k k

g=1

g xg(2i1)(2j1) +
g=1

g xg(2i)(2j1) (2i1)(2j1) 0

Bosaing et al. (IMSP, UPLB)

Assignment Problems...

ICMA 2011

19 / 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 c1 k k

g xgij
i=1 j=1 g=1 g=1

g xgi(j+1)

(O1)

r /2 1 c/2

+
i=1 j=1 g=1

g xg(2i)(2j1)
g=1

g xg(2i+1)(2j1)

(O2)

r /2

c/2

+
i=1 j=1 g=1

g xg(2i1)(2j)
g=1
Assignment Problems...

g xg(2i)(2j)

(O3)

Bosaing et al. (IMSP, UPLB)

ICMA 2011

20 / 42

Weighted Neighborhood Constraint

44 Tiling

Outline
1

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 21 / 42

Weighted Neighborhood Constraint

44 Tiling

Weighted Neighborhood Constraint

44 Tiling

The objective function of the integer program is Minimize

r c1 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. (IMSP, UPLB) Assignment Problems... ICMA 2011 22 / 42

Weighted Neighborhood Constraint

63 Tiling

Outline
1

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 23 / 42

Weighted Neighborhood Constraint

63 Tiling

Weighted Neighborhood Constraint

63 Tiling

Figure: Adjacencies in hexagonal tiling

Bosaing et al. (IMSP, UPLB)

Assignment Problems...

ICMA 2011

24 / 42

Weighted Neighborhood Constraint

63 Tiling

Weighted Neighborhood Constraint

63 Tiling

The objective function of the integer program is Minimize

r c1 k k

g xgij
i=1 j=1 g=1 g=1

g xgi(j+1)

(O1)

r 1

+
i=1 j=1 g=1

g xgij
g=1

g xg(i+1)j

(O2)

r 1

+
i=1 j=2 g=1
Bosaing et al. (IMSP, UPLB)

g xgij
g=1

g xg(i+1)(j1)

(O3)

Assignment Problems...

ICMA 2011

25 / 42

Nonweighted Neighborhood Constraint

36 Tiling

Outline
1

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 26 / 42

Nonweighted Neighborhood Constraint

36 Tiling

Nonweighted Neighborhood Constraint

Suppose a1 , a2 , . . . , ak , b1 , b2 , . . . , bk be the dummy weights associated to the decision variables y1 , y2 , . . . , yk , z1 , z2 , . . . , zk , respectively, then dene 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 ) . . . (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 ). 1(O
) Bosaing et al. (IMSP, UPLB) Assignment Problems... ICMA 2011 27 / 42

Nonweighted Neighborhood Constraint

36 Tiling

Nonweighted Neighborhood Constraint

For simplicity, we let g = g.

Figure: Circular Shift Permutation of the dummy weights

Bosaing et al. (IMSP, UPLB)

Assignment Problems...

ICMA 2011

28 / 42

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 c1

(O1)

g xgi(j+1) (O1)

g xgij
g=1 g=1

i=1 j=1

r /2 1 c/2

(O2)

g xg(2i+1)(2j) (O2)

+
i=1 j=1

g xg(2i)(2j)
g=1 g=1

r /2

c/2

(O3)

g xg(2i)(2j1) (O3)

+
i=1 j=1

g xg(2i1)(2j1)
g=1 g=1

Bosaing et al. (IMSP, UPLB)

Assignment Problems...

ICMA 2011

29 / 42

Nonweighted Neighborhood Constraint

36 Tiling

Nonweighted Neighborhood Constraint

36 Tiling: Starting with adjacent (column) compartment

The linearized objective function is Minimize

r c1 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(2i1)(2j1)

subject to Constraint 1: For h = 1, 2, . . . , k , i = 1, 2, . . . , r and j = 1, 2, . . . , c 1, h(O1) hij 0

Bosaing et al. (IMSP, UPLB)

Assignment Problems...

ICMA 2011

30 / 42

Nonweighted Neighborhood Constraint

36 Tiling

Nonweighted Neighborhood Constraint

36 Tiling: Starting with adjacent (column) compartment

continuation... Constraint 2: For h = 1, 2, . . . , k , i = 1, 2, . . . , r and j = 1, 2, . . . , c 1, h(O1) hij 0 Constraint 3: For h = 1, 2, . . . , k , i = 1, 2, . . . , r /2 1 and j = 1, 2, . . . , c/2 , h(O2) h(2i)(2j) 0 Constraint 4: For h = 1, 2, . . . , k , i = 1, 2, . . . , r /2 1 and j = 1, 2, . . . , c/2 , h(O2) h(2i)(2j) 0

Bosaing et al. (IMSP, UPLB)

Assignment Problems...

ICMA 2011

31 / 42

Nonweighted Neighborhood Constraint

36 Tiling

Nonweighted Neighborhood Constraint

36 Tiling: Starting with adjacent (column) compartment

continuation... Constraint 5: For h = 1, 2, . . . , k , i = 1, 2, . . . , r /2 and j = 1, 2, . . . , c/2 , h(O3) h(2i1)(2j1) 0 Constraint 6: For h = 1, 2, . . . , k , i = 1, 2, . . . , r /2 and j = 1, 2, . . . , c/2 , h(O3) h(2i1)(2j1) 0

Bosaing et al. (IMSP, UPLB)

Assignment Problems...

ICMA 2011

32 / 42

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 c1

(O1)

g xgi(j+1) (O1)

g xgij
g=1 g=1

i=1 j=1

r /2 1 c/2

(O2)

g xg(2i+1)(2j1) (O2)

+
i=1 j=1

g xg(2i)(2j1)
g=1 g=1

r /2

c/2

(O3)

g xg(2i)(2j) (O3)

+
i=1 j=1

g xg(2i1)(2j)
g=1 g=1

Bosaing et al. (IMSP, UPLB)

Assignment Problems...

ICMA 2011

33 / 42

Nonweighted Neighborhood Constraint

44 Tiling

Outline
1

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 34 / 42

Nonweighted Neighborhood Constraint

44 Tiling

Nonweighted Neighborhood Constraint

44 Tiling

The objective function of the integer program is Minimize

r c1

(O1)

g xgi(j+1) (O1)

g xgij
g=1 g=1

i=1 j=1

r 1

(O2)

g xg(i+1)j (O2)

+
i=1 j=1

g xgij
g=1 g=1

Bosaing et al. (IMSP, UPLB)

Assignment Problems...

ICMA 2011

35 / 42

Nonweighted Neighborhood Constraint

63 Tiling

Outline
1

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 36 / 42

Nonweighted Neighborhood Constraint

63 Tiling

Nonweighted Neighborhood Constraint

63 Tiling

The objective function of the integer program is Minimize

r c1

(O1)

g xgi(j+1) (O1)

g xgij
g=1 g=1

i=1 j=1

r 1

(O2)

g xg(i+1)j (O2)

+
i=1 j=1

g xgij
g=1 g=1

r 1

(O3)

g xg(i+1)(j1) (O3)

+
i=1 j=2

g xgij
g=1 g=1

Bosaing et al. (IMSP, UPLB)

Assignment Problems...

ICMA 2011

37 / 42

Illustrative Example

Weighted and Nonweighted Neighborhood Constraint

Outline
1

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 38 / 42

Illustrative Example

Weighted and Nonweighted Neighborhood Constraint

Illustrative Example

Table: Distribution of elements per group. Group Number of elements Group 1 3 Group 2 4 Group 3 5 Assume g = g

Bosaing et al. (IMSP, UPLB)

Assignment Problems...

ICMA 2011

39 / 42

Illustrative Example

Weighted and Nonweighted Neighborhood Constraint

Weighted Neighborhood Constraint

Figure: Optimal Solutions

Bosaing et al. (IMSP, UPLB)

Assignment Problems...

ICMA 2011

40 / 42

Illustrative Example

Weighted and Nonweighted Neighborhood Constraint

Nonweighted Neighborhood Constraint

Figure: Optimal Solutions

Bosaing et al. (IMSP, UPLB)

Assignment Problems...

ICMA 2011

41 / 42

Appendix

References

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

Bosaing et al. (IMSP, UPLB)

Assignment Problems...

ICMA 2011

42 / 42

Appendix

References

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

Bosaing et al. (IMSP, UPLB)

Assignment Problems...

ICMA 2011

42 / 42

Appendix

References

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

Bosaing et al. (IMSP, UPLB)

Assignment Problems...

ICMA 2011

42 / 42

Appendix

References

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

Bosaing et al. (IMSP, UPLB)

Assignment Problems...

ICMA 2011

42 / 42

Appendix

References

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

Bosaing et al. (IMSP, UPLB)

Assignment Problems...

ICMA 2011

42 / 42