Abstract
This paper studies a facility selection problem which is generalised from the design of a mail sorting system with multiple input and output. The problem is formulated as a 0-1 integer linear programming (ILP) problem with logical constraints. We show how the logical constraints can be embedded into a ILP model. We compare three strategies for handling logical relations: (1) explicitly as added linear constraints; (2) implicitly as symbolic constraints; and (3) a combination of the two. The effectiveness of computations under different strategies are shown.
| Original language | English |
|---|---|
| Pages (from-to) | 273-277 |
| Number of pages | 5 |
| Journal | Journal of the Operational Research Society |
| Volume | 49 |
| Issue number | 3 |
| DOIs | |
| Publication status | Published - 1 Jan 1998 |
Keywords
- Integer programming
- Logical constraint
- Mail sorting
ASJC Scopus subject areas
- Management Information Systems
- Strategy and Management
- Management Science and Operations Research
- Marketing