A meta-control algorithm for generating approximate solutions to binary integer programming problems

Binary integer program problems, which are known to be difficult to solve, have long been an important research area. We use a new approach with continualization techniques to find approximate solutions to binary integer programming problems. The algorithm constructs a sequence of approximations to...

Full description

Saved in:
Bibliographic Details
Published inNonlinear analysis. Hybrid systems Vol. 2; no. 4; pp. 1232 - 1244
Main Authors von Haartman, Kathrine, Kohn, Wolf, Zabinsky, Zelda B.
Format Journal Article
LanguageEnglish
Published Elsevier Ltd 01.11.2008
Subjects
Binary programming
Linear quadratic tracking
Optimal control
Binary programming
Optimal control
Linear quadratic tracking
Online AccessGet full text
ISSN1751-570X
DOI10.1016/j.nahs.2008.09.021

Cover

More Information
Summary:Binary integer program problems, which are known to be difficult to solve, have long been an important research area. We use a new approach with continualization techniques to find approximate solutions to binary integer programming problems. The algorithm constructs a sequence of approximations to a solution using a meta-control approach that has low polynomial time complexity. The algorithm is illustrated with a BIP example.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:1751-570X
DOI:10.1016/j.nahs.2008.09.021