An inexact algorithm for the sequential ordering problem
作者： L.F. Escudero
DOI: 10.1016/0377-2217(88)90333-5
关键词:
摘要: … sequential ordering such that its h-th element so h gives the node that is sequenced in the level h for h = 1, 2 ..... IN I- Let nl -on 2 denote a partial order… with the partial ordering nl -o n2. …
elsevier.com
sci-hub.se 参考文章(12)
Silvano Martello, Paolo Toth, Linear Assignment Problems North-holland Mathematics Studies. ,vol. 132, pp. 259- 282 ,(1987) , 10.1016/S0304-0208(08)73238-9
G. Pérez-Sáinz de Rozas, Laureano F. Escudero, A production planning problem in FMS Questiió: Quaderns d'Estadística, Sistemes, Informatica i Investigació Operativa. ,vol. 11, pp. 85- 114 ,(1987)
Jan Karel Lenstra, Sequencing by enumerative methods ,(1977)
Egon Balas, Nicos Christofides, A restricted Lagrangean approach to the traveling salesman problem Mathematical Programming. ,vol. 21, pp. 19- 46 ,(1981) , 10.1007/BF01584228
Silvano Martello, Algorithm 595: An Enumerative Algorithm for Finding Hamiltonian Circuits in a Directed Graph ACM Transactions on Mathematical Software. ,vol. 9, pp. 131- 138 ,(1983) , 10.1145/356022.356030
Martin Grötschel, Michael Jünger, Gerhard Reinelt, Facets of the linear ordering polytope Mathematical Programming. ,vol. 33, pp. 43- 60 ,(1985) , 10.1007/BF01582010
Karla Hoffman, Manfred Padberg, LP-Based Combinatorial Problem Solving Annals of Operations Research. ,vol. 4, pp. 55- 123 ,(1985) , 10.1007/978-3-642-82450-0_3
Martin Grötschel, Michael Jünger, Gerhard Reinelt, A Cutting Plane Algorithm for the Linear Ordering Problem Operations Research. ,vol. 32, pp. 1195- 1220 ,(1984) , 10.1287/OPRE.32.6.1195
Giorgio Carpaneto, Paolo Toth, Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem Management Science. ,vol. 26, pp. 736- 743 ,(1980) , 10.1287/MNSC.26.7.736
Paris-C. Kanellakis, Christos H. Papadimitriou, Local Search for the Asymmetric Traveling Salesman Problem Operations Research. ,vol. 28, pp. 1086- 1099 ,(1980) , 10.1287/OPRE.28.5.1086