论文信息 - An inexact algorithm for the sequential ordering problem - 字舞流文

An inexact algorithm for the sequential ordering problem

[1] Jan Karel Lenstra,et al. Sequencing by enumerative methods , 1977 .

[2] Christos H. Papadimitriou,et al. Local Search for the Asymmetric Traveling Salesman Problem , 1980, Oper. Res..

[3] P. Toth,et al. Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem , 1980 .

[4] Egon Balas,et al. A restricted Lagrangean approach to the traveling salesman problem , 1981, Math. Program..

[5] Silvano Martello,et al. Algorithm 595: An Enumerative Algorithm for Finding Hamiltonian Circuits in a Directed Graph , 1983, TOMS.

[6] Gerhard Reinelt,et al. A Cutting Plane Algorithm for the Linear Ordering Problem , 1984, Oper. Res..

[7] M. Padberg,et al. Lp-based combinatorial problem solving , 1985 .

[8] Martin Grötschel,et al. Facets of the linear ordering polytope , 1985, Math. Program..

[9] L. F. Escudero,et al. A production planning problem in FMS , 1989 .

[10] Gerd Finke,et al. MODELING AND SOLVING THE FLEXIBLE FORGING MODULE SCHEDULING PROBLEM , 1987 .

[11] Paolo Toth,et al. Linear Assignment Problems , 1987 .

[12] R. P. Davis,et al. Flexible manufacturing systems: Characteristics and assessment , 1987 .