Abonnement à la biblothèque: Guest
Journal of Automation and Information Sciences

Publication de 12  numéros par an

ISSN Imprimer: 1064-2315

ISSN En ligne: 2163-9337

SJR: 0.173 SNIP: 0.588 CiteScore™:: 2

Indexed in

The Solution of a Minimization Problem of the Weighted Length of a Connecting Grid by Branch and Bound Method

Volume 44, Numéro 7, 2012, pp. 22-33
DOI: 10.1615/JAutomatInfScien.v44.i7.30
Get accessGet access

RÉSUMÉ

The branch and bound method has been offered and realized for a minimization problem of the weighted length of a connecting grid at linear placing of rectangular elements. The rule of branching of admissible set on subsets has been considered. The estimation of an admissible set has been offered and proved. The illustrative example has been given.

CITÉ PAR
  1. Stoyan Y. G., Yakovlev S. V., Theory and Methods of Euclidian Combinatorial Optimization: Current Status and Prospects, Cybernetics and Systems Analysis, 56, 3, 2020. Crossref

Portail numérique Bibliothèque numérique eBooks Revues Références et comptes rendus Collections Prix et politiques d'abonnement Begell House Contactez-nous Language English 中文 Русский Português German French Spain