Доступ предоставлен для: Guest
Journal of Automation and Information Sciences

Выходит 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 Электронная Бибилиотека e-Книги Журналы Справочники и Сборники статей Коллекции Цены и условия подписки Begell House Контакты Language English 中文 Русский Português German French Spain