Name
Abstract | ||
|---|---|---|
We propose a 0/1 integer programming model to tackle the office space allocation (OSA) problem which refers to assigning room space to a set of entities (people, machines, roles, etc.), with the goal of optimising the space utilisation while satisfying a set of additional requirements. In the proposed approach, these requirements can be modelled as constraints (hard constraints) or as objectives (soft constraints). Then, we conduct some experiments on benchmark instances and observe that setting certain constraints as hard (actual constraints) or soft (objectives) has a significant impact on the computational difficulty on this combinatorial optimisation problem. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1016/j.endm.2010.05.073 | Electronic Notes in Discrete Mathematics |
Keywords | Field | DocType |
Office Space Allocation,Integer Programming | Combinatorics,Integer programming model,Mathematical optimization,Constraint (mathematics),Integer programming,Space allocation,Mathematics | Journal |
Volume | ISSN | Citations |
36 | 1571-0653 | 5 |
PageRank | References | Authors |
0.53 | 3 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Özgür Ülker | 1 | 39 | 2.91 |
| Dario Landa Silva | 2 | 316 | 28.38 |