A new compact formulation for the discrete p-dispersion problem
详细信息 查看全文
- 作者：David Sayah ; sayah@uni-mainz.de" class="auth_mail" title="E-mail the corresponding author ; Stefan Irnich
- 关键词：Facility location ; Dispersion problems ; Max&ndash ; min objective ; Integer programming
- 刊名：European Journal of Operational Research
- 出版年：2017
- 出版时间：1 January 2017
- 年：2017
- 卷：256
- 期：1
- 页码：62-67
- 全文大小：368 K
文摘
- •
A new compact pure binary formulation for discrete p-dispersion is proposed.
- •
Simple and effective model enhancement through preprocessing and valid inequalities.
- •
Computational comparison against standard model and exact search procedures.
- •
Some test instances are only solved with the new model.
- •
Some test instances are solved fastest using the new model.