2017
DOI: 10.33889/ijmems.2017.2.1-001
|View full text |Cite
|
Sign up to set email alerts
|

A Heuristic for a Mixed Integer Program using the Characteristic Equation Approach

Abstract: 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.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2017
2017
2021
2021

Publication Types

Select...
4

Relationship

2
2

Authors

Journals

citations
Cited by 4 publications
(3 citation statements)
references
References 17 publications
0
3
0
Order By: Relevance
“…The proposed model is a mixed integer quadratic programming (MIQP) problem and most MIQP problems are NP-hard which require solution algorithms to deal with larger instances of the problem. Some articles on solution methods are: Nyamugure et al (2017), Al-Hasani et al (2018), Turgay (2018). In future, new formulations of congestion cost based on queuing theoretic models would be developed.…”
Section: Discussionmentioning
confidence: 99%
“…The proposed model is a mixed integer quadratic programming (MIQP) problem and most MIQP problems are NP-hard which require solution algorithms to deal with larger instances of the problem. Some articles on solution methods are: Nyamugure et al (2017), Al-Hasani et al (2018), Turgay (2018). In future, new formulations of congestion cost based on queuing theoretic models would be developed.…”
Section: Discussionmentioning
confidence: 99%
“…(e) Apply the ideas developed in this paper to solve a conventional integer and mix integer programming model discussed in Kumar and Munapo (2012), Nyamugure et al (2017).…”
Section: Discussionmentioning
confidence: 99%
“…Using the CE approach, Al-Rabeeah et al ( 2019) obtained a non-dominated point set for a bi-objective linear integer problem, and Al-Hasani et al (2020) developed a rank-based solution method for finding a non-dominated point set of a given multiobjective integer program. Nyamugure et al (2017) applied the CE concept for a mixed integer program and Kumar et al (2009) solved a binary integer program using the CE approach.…”
Section: Introductionmentioning
confidence: 99%