图书馆订阅: Guest
自动化与信息科学期刊

每年出版 12 

ISSN 打印: 1064-2315

ISSN 在线: 2163-9337

SJR: 0.173 SNIP: 0.588 CiteScore™:: 2

Indexed in

On Solution of a Certain Integer Programming Problem of a Specific Form

卷 30, 册 4-5, 1998, pp. 115-120
DOI: 10.1615/JAutomatInfScien.v30.i4-5.120
Get accessGet access

摘要

A special class of integer linear programming problems is considered. An implicit search algorithm is proposed in order to solve this problem. The efficient of this algorithm is examined via computational experiments.

参考文献
  1. Koffmann A. and Henri-Laborderre A., Metody i modeli issledovaniya operatsii (Methods and Models of Operation Research).

  2. Sergienko, I. V., Matematicheskie modeli i metody resheniya zadach discretnoi optimizatsii (Mathematical Models and Methods for Solution of Discrete Optimization Problems).

  3. Shor, N. Z. and Voitishin, Yu. V., Dual Network Estimates for Integer Programming Problems of a Special Form.

  4. Roshchin, V. A., and Sergienko, I. V., On a Certain Approach to the Solution of the Covering Problem.

Begell Digital Portal Begell 数字图书馆 电子图书 期刊 参考文献及会议录 研究收集 订购及政策 Begell House 联系我们 Language English 中文 Русский Português German French Spain