A Heuristic for a Mixed Integer Program using the Characteristic Equation Approach
2017 ◽
Vol 2
(1)
◽
pp. 1-16
◽
Keyword(s):
Np Hard
◽
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 a heuristic that generates a feasible solution along with the bounds for the NP-hard mixed integer program (MIP) model by solving the LP relaxation and the PIP, using the CE.
2016 ◽
Vol 46
(2)
◽
pp. 234-248
◽
Keyword(s):
Keyword(s):
Keyword(s):
2012 ◽
Vol 6
(19)
◽
pp. 450-456
Keyword(s):
2020 ◽
Vol 34
(10)
◽
pp. 13989-13990
Keyword(s):