|
|||||
|
|
Branch-and-bound algorithms: A survey of recent advances in searching,branching, and pruning |
|
| Institution: | 1. Inverse Limit, USA;2. Department of Computer Science, University of Illinois at Urbana–Champaign, 201 North Goodwin Avenue, Urbana, IL 61801, USA;3. Department of Computer Science, University of Wisconsin–La Crosse, 1725 State Street, La Crosse, WI 54601, USA;4. Department of Mathematics and Statistics, Southern Illinois University Edwardsville, 1 Hairpin Drive, Edwardsville, IL 62025, USA |
| Abstract: | |
| Keywords: | Branch-and-bound Discrete optimization Integer programming Search strategies Cyclic best first search Survey |
| 本文献已被 ScienceDirect 等数据库收录！ | |