no. 1
Solving a family of permutation problems on 0-1 matrices
RAIRO - Operations Research - Recherche Opérationnelle, Tome 21 (1987) no. 1, pp. 65-85 
@article{RO_1987__21_1_65_0,
     author = {Laporte, Gilbert},
     title = {Solving a family of permutation problems on 0-1 matrices},
     journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
     pages = {65--85},
     year = {1987},
     publisher = {EDP Sciences},
     volume = {21},
     number = {1},
     mrnumber = {887293},
     zbl = {0612.90074},
     language = {en},
     url = {https://www.numdam.org/item/RO_1987__21_1_65_0/}
}
TY  - JOUR
AU  - Laporte, Gilbert
TI  - Solving a family of permutation problems on 0-1 matrices
JO  - RAIRO - Operations Research - Recherche Opérationnelle
PY  - 1987
SP  - 65
EP  - 85
VL  - 21
IS  - 1
PB  - EDP Sciences
UR  - https://www.numdam.org/item/RO_1987__21_1_65_0/
LA  - en
ID  - RO_1987__21_1_65_0
ER  - 
%0 Journal Article
%A Laporte, Gilbert
%T Solving a family of permutation problems on 0-1 matrices
%J RAIRO - Operations Research - Recherche Opérationnelle
%D 1987
%P 65-85
%V 21
%N 1
%I EDP Sciences
%U https://www.numdam.org/item/RO_1987__21_1_65_0/
%G en
%F RO_1987__21_1_65_0
Laporte, Gilbert. Solving a family of permutation problems on 0-1 matrices. RAIRO - Operations Research - Recherche Opérationnelle, Tome 21 (1987) no. 1, pp. 65-85. https://www.numdam.org/item/RO_1987__21_1_65_0/

1. R. M. Adelson, G. Laporte et J. M. Norman, A Dynamic Programming Formulation with Diverse Applications, Operational Research Quarterly, Vol. 27, 1976, pp. 119-121. | Zbl

2. J. C. Bartholdi Iii, J. B. Orlin et H. D. Ratliff, Cyclic Scheduling via Integer Programs with Circular Ones, Operations Research, Vol. 28, 1980, pp. 1074-1085. | Zbl | MR

3. G. Carpaneto et P. Toth, Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem, Management Science, Vol. 26, 1980, pp. 736-743. | Zbl | MR

4.G. B. Dantzig, On the Significance of Solving Linear Programming Problems with Some Integer Variables, Econometrica, Vol. 28, 1960, pp.30-44. | Zbl | MR

5. P. Dempsey et M. Baumhoff, The Statistical Use of Artifact Distributions to Establish Chronological Sequence, American Antiquity, Vol. 28, 1963, pp. 496-509.

6. J. E. Doran, Computer Analysis of Data from the La Tène Cemetery at Münsingen-Rain, Mathematics in the Archaeological and Historical Sciences, F. R. HODSON et al Eds., Edinburgh University Press, 1971, pp. 422-431.

7. J. E. Doran et S. Powell, Solving a Combinatorial Problem Encountered in Archaeology, Some Research Applications of the Computer, Atlas Computer Laboratory, 1972.

8. L. R. Ford et D. R. Fulkerson, Flows in Networks, Princeton University Press, 1962. | MR

9. D. R. Fulkerson et O. A. Gross, Incidence Matrices and Interval Graphs, Pacific Journal of Mathematics Vol. 15, 1965, pp. 835-855. | Zbl | MR

10. B. L. Golden et W. R. Stewart, Empirical Analysis of Heuristics, The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, E. L. LAWLER et al Eds., Wiley, 1985, pp. 207-250. | Zbl | MR

11. K. Goldmann, Some Archaeological Criteria for Chronological Seriation, Mathematics in the Archaeological and Historical Sciences, F. R, HODSON et al. Eds. Edinburgh University Press, 1971, pp. 202-208.

12. M. D. Grigoriadis et T. Hsu, RNET-The Rutgers Minimum Cost Network Flow Subroutines, Rutgers University, New-Brunswick, N.J., 1979.

13. F. R. Hodson, The La Tène Cemetery at Münsingen-Rain, Stämpfli, 1968.

14. F. R. Hodson, D. G. Kendall et P. Tautu, Mathematics in the Archaeological and Historical Sciences, Edinburgh University Press, 1971. | Zbl

15. F. Hole et M. Shaw, Computer Analysis of Chronological Seriation, Rice University Studies, Vol. 53, 1967.

16. L. J. Hubert, Some Applications of Graph Theory and Reiated Non-Metric Techniques to Problems of Approximate Seriation: the Case of Symmetric Proximity Measures, British Journal of Mathematical and Statistical Psychology, Vol. 27, 1974, pp. 133-153. | Zbl

17. L. J. Hubert et F. B. Baker, Applications of Combinatorial Programming to Data Analysis: the Travelling Salesman Problem and Related Problems, Psychometrika, Vol. 43, 1978, pp. 81-91. | MR

18. D. G. Kendall, Some Problems and Methods in Statistical Archaeology, World Archaeology, Vol. 1, 1969, pp. 68-76.

19. I. Kivu-Sculy, On the Hole-Show Method of Permutation Search, Mathematics in the Archaeological and Historical Sciences, F. R. HODSON et al. Eds., Edinburgh University Press, 1971, pp. 253-254.

20. R. S. Kuzara, R. G. Mead et K. A. Dixon, Seriation of Anthropological Data: a Computer Program for Matrix Ordering, American Anthropologist, Vol. 68, 1966, pp. 1442-1455.

21. G. Laporte, A Comparison of Two Norms in Archaeological Seriation, Journal of Archaeological Science, Vol. 3, 1976, pp. 249-255.

22. G. Laporte et S. Desroches, The Problem of Assigning Students to Course Sections in a Large Engineering School, Computers and Operations Research, Vol. 13, 1986, pp. 387-394.

23. E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan et D. B. Shmoys, The Travelling Salesman Problem. A Guided Tour of Combinatorial 0ptimization, Wiley, 1985. | Zbl | MR

24. J. K. Lenstra et A. H. G. Rinnooy Kan, Some Applications of the Travelling Salesman Problem, Operational Research Quarterly, Vol. 26, 1975, pp. 717-734. | Zbl

25. S. Lin, Computer Solution of the Travelling Salesman Problem, Bell System Technical Journal, Vol. 44, 1965, pp. 2245-2269. | Zbl | MR

26. J. D. C. Little, K. G. Murphy, D. W. Sweeney et C. Karel, An Algorithm for the Travelling Salesman Problem, Operations Research, Vol. 11, 1963, pp. 972-989. | Zbl

27. W. H. Marquardt, Advances in Archaeological Seriation, Advances in Archaeological Method and Theory, Vol. 1, M. B. SCHIFFER Ed., Academic Press, 1978, pp. 257-314.

28. B. J. Meggers et C. Evans, Archaeological Investigation in the Mouth of the Amazon, Bulletin 167, Smithsonian Institute, Bureau of American Ethnology, 1957.

29. P. Miliotis, Integer Programming Approaches to the Travelling Salesman Problem, Mathematical Programming, Vol 10, 1976, pp. 367-378. | Zbl | MR

30. T. A. J. Nicholson, Permutation Programming and its Applications, Ph.D. Thesis, University of London, 1970.

31. J. M. Norman, Elementary Dynamic Programming, Crane, Russak & Company, Inc., New York, 1977. | Zbl | MR

32. I. Or, Traveling Salesman-Type Combinatorial Problems and their Relation to the Logistics of Regional Blood Banking, Ph.D. Thesis, Northwestern University, Evanston, IL, 1976.

33. W. S. Robinson, Method for Chronologically Ordering Archaeological Deposits, American Antiquity, Vol. 16, 1951, pp. 293-301.

34. A. Shuchat, Matrix and Network Models in Archaeology, Mathematics Magazine, Vol. 57, 1984, pp. 3-14. | Zbl | MR

35. R. Sibson, Some Thoughts on Sequencing Methods, Mathematics in the Archaeological and Historical Sciences, F. R. HODSON et al Eds., Edinburgh University Press, 1971, pp. 263-266.

36. A. Stefan, Applications of Mathematical Methods to Epigraphy, Mathematics in the Archaeological and Historical Sciences, F. R. HODSON et al. Eds., Edinburgh University Press, 1971, pp. 267-275.

37. J. Telgen, How to Schedule Meetings with a Travelling Salesman Q & D, and Why we Didn't, Interfaces, Vol. 15, 1985, pp. 89-93.