A Heuristic for a Mixed Integer Program using the Characteristic Equation Approach
While most linear programming (LP) problems can be solved in polynomial time, pure and mixed integer problems are NP-hard and there are no known polynomial time algorithms to solve these problems. A characteristic equation (CE) was developed to solve a pure integer program (PIP). This paper presents...
Hlavní autoři: | , , , |
---|---|
Médium: | Článek |
Jazyk: | English |
Vydáno: |
Ram Arti Publishers
2017-03-01
|
Edice: | International Journal of Mathematical, Engineering and Management Sciences |
Témata: | |
On-line přístup: | https://www.ijmems.in/assets//1-ijmems-16-029-vol.-2%2c-no.-1%2c-1_16%2c-2017.pdf |