Construction of Hamiltonian paths in graphs of permutation polyhedra

DOI10.1007/s10559-010-9178-1zbMath1216.05069OpenAlexW2070968231MaRDI QIDQ1956963

G. A. Donec, L. M. Kolechkina

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

zbMATH Keywords

graphHamiltonian pathpolyhedral combinatoricspermutation polyhedroncombinatorial sethyperfacecombinatorial permutation set

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

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

• Method of ordering the values of a linear function on a set of permutations
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Construction of Hamiltonian paths in graphs of permutation polyhedra