A Pre-estimate Approach to Find a Good Initial Point to Integer Linear Programming Problems

DOI

10.2991/ammsa-17.2017.68How to use a DOI?

Keywords

integer linear programming; relaxing methods; pre-estimate

Abstract

Integer Linear Programming problems are significant in many areas, and there exist many classic methods to deal with such problems. Based on the intuition that a proper pre-estimation of those problems may help find a good initial point that is relatively closed to the final solution, we constructed a framework to do such pre-estimate by introducing . We proposed two methods to estimate by trials and by direct estimation. In a case study our method reduces about 7% of computational expense compared to the Branch and Bound Algorithm.

Copyright

© 2017, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Zhifeng Kong
AU  - Jiaheng Wei
PY  - 2017/05
DA  - 2017/05
TI  - A Pre-estimate Approach to Find a Good Initial Point to Integer Linear Programming Problems
BT  - Proceedings of the 2017 International Conference on Applied Mathematics, Modelling and Statistics Application (AMMSA 2017)
PB  - Atlantis Press
SP  - 300
EP  - 302
SN  - 1951-6851
UR  - https://doi.org/10.2991/ammsa-17.2017.68
DO  - 10.2991/ammsa-17.2017.68
ID  - Kong2017/05
ER  -