IEEE - Institute of Electrical and Electronics Engineers, Inc. - A branch and bound algorithm for the sequential ordering problem

2011 34th International Convention on Information and Communication Technology, Electronics and Microelectronics (MIPRO)

Author(s): Karan, M. ; Skorin-Kapov, N.
Publisher: IEEE - Institute of Electrical and Electronics Engineers, Inc.
Publication Date: 1 May 2011
Conference Location: Opatija, Croatia, Croatia
Conference Date: 23 May 2011
Page(s): 452 - 457
ISBN (CD): 978-953-233-067-0
ISBN (Electronic): 978-953-233-059-5
ISBN (Paper): 978-1-4577-0996-8
Regular:

The Sequential Ordering Problem (SOP) is the problem of finding the shortest hamiltonian path in a graph while satisfying given precedence constraints regarding the order in which the nodes are... View More

Advertisement