Inscrição na biblioteca: Guest
Journal of Automation and Information Sciences

Publicou 12 edições por ano

ISSN Imprimir: 1064-2315

ISSN On-line: 2163-9337

SJR: 0.173 SNIP: 0.588 CiteScore™:: 2

Indexed in

Investigation of Solutions of Linear Problems of Euclidean Combinatorial Optimization on Permutations with Additional Restrictions. Part III

Volume 44, Edição 2, 2012, pp. 30-37
DOI: 10.1615/JAutomatInfScien.v44.i2.30
Get accessGet access

RESUMO

The extension of the well-known method of solving the systems of linear inequalities for finding the general formula of the points of a permutation polyhedron with additional restrictions is studied.

Referências
  1. Yemets O.A., Ustian N.Yu., Investigation of solutions of linear problems of Euclidean combinatorial optimization on permutations with additional restrictions, Part I.

  2. Yemets O.A., Ustian N.Yu., Investigation of solutions of linear problems of Euclidean combinatorial optimization on permutations with additional restrictions, Part II.

  3. Chernikov S.N., Linear inequalities.

  4. Chernikova N.V., An algorithm for finding a general formula of nonnegative solutions of system of linear equations.

  5. Motzkin T.S., Raiffa H., Thompson G.L., Thrall R.M., The double description method, Matrix games, Sbornik perevodov “Matrichnyye igry”, Ed. by N.N. Vorobiev.

  6. Burger E., Uber homogene lineare Ungleichungssysteme.

Portal Digital Begell Biblioteca digital da Begell eBooks Diários Referências e Anais Coleções de pesquisa Políticas de preços e assinaturas Begell House Contato Language English 中文 Русский Português German French Spain