.png){kind=icon}
.png){kind=icon}
Return
A meta-control algorithm for generating approximate solutions to binary integer programming problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.nahs.2008.09.021.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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. (C) 2008 Elsevier Ltd. All rights reserved.
Keywords:
Binary programming
Linear quadratic tracking
Optimal control
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
N
IF:
4.1
Papers:
1.4K
Citations:
3.1K