Construction of Hamiltonian paths in graphs of permutation polyhedra
From MaRDI portal
Publication:1956963
DOI10.1007/s10559-010-9178-1zbMath1216.05069OpenAlexW2070968231MaRDI QIDQ1956963
Publication date: 24 September 2010
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Full work available at URL: http://dspace.puet.edu.ua/handle/123456789/3422
graphHamiltonian pathpolyhedral combinatoricspermutation polyhedroncombinatorial sethyperfacecombinatorial permutation set
Related Items (2)
A method to solve conditional optimization problems with quadratic objective functions on the set of permutations ⋮ Theory and methods of Euclidian combinatorial optimization: current status and prospects
Cites Work
This page was built for publication: Construction of Hamiltonian paths in graphs of permutation polyhedra