Treatment of combinatorial optimization problems using selection equations with cost terms. Part II. NP-hard three-dimensional assignment problems

Physica D: Nonlinear Phenomena

Volumn 134, Issue 2, 1999, Pages 242-252

  Starke, J ^a   Schanz, M ^b   Haken, H ^c  

^a UNIVERSITY OF HEIDELBERG   (Germany)

^b Inst Parallele Verteilte H   (Germany)

^c UNIVERSITY OF STUTTGART   (Germany)

Author keywords

Assignment problems; Combinatorial optimization problems; Penalty methods; Selection equations

Indexed keywords

EID: 0012109775     PISSN: 01672789     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-2789(99)00113-X     Document Type: Article

References (14)

1. H. Achatz, P. Kleinschmidt, K. Paparrizos, A dual forest algorithm for the assignment problem, DIMACS Ser. Discrete Math. Theoret. Comp. Sci. 4 1-10, 1991, The Victor Klee Festschrift.
2. M. Garey, D. Johnson, Computers and Intractability, Freeman, San Francisco, CA, 1979.
3. H. Haken, Synergetic Computers and Cognition - A Top-Down Approach to Neural Nets, Springer Series in Synergetics, Springer, Berlin, 1991.
4. H. Haken, Decision making and optimization in regional planning, in: M.J. Beckmann, B. Johansson, F. Snickars, R. Thord (Eds.), Knowledge and Networks in a Dynamic Economy, Springer, Berlin, 1998.
5. H. Haken, M. Schanz, J. Starke, Treatment of combinatorial optimization problems using selection equations with cost terms. Part I. two-dimensional assignment problems, Physica D 134 (1999) 227-241.
6. M. Hestenes, Optimization Theory, Wiley, New York, 1975.
7. N. Lidstrom, P. Pardalos, L. Pitsoulis, G. Toraldo, An approximation algorithm for the three-index assignment problem, (1996) unpublished.
8. P. Molnár, J. Starke, Control of distributed autonomous robotic systems using principles of pattern formation in nature and pedestrian behaviour, (1999), submitted.
9. C. Papadimitriou, K. Steiglitz, Combinatorial Optimization - Algorithms and Complexity, Prentice-Hall, Englewood Cliffs, NJ, 1982.
10. J. Starke, Kombinatorische Optimierung auf der Basis gekoppelter Selektionsgleichungen, Ph.D. Thesis, Universität Stuttgart, Verlag Shaker, Aachen, 1997.
11. J. Starke, Combinatorial optimization based on coupled selection equations, Part I: continuous selection equations (1998), unpublished.
12. J. Starke, P. Molnár, Dynamic control of distributed autonomous robotic systems with underlying two- and NP-hard three-dimensional assignments, (1999), in preparation.
13. J. Starke, M. Schanz, Dynamical system approaches to combinatorial optimization, in: D.-Z. Du, P. Pardalos (Eds.), Handbook of Combinatorial Optimization, vol. 2, Kluwer Academic Publishers, Dordrecht, 1998, pp. 471-524.
14. J. Starke, M. Schanz, H. Haken, Self-organized behaviour of distributed autonomous mobile robotic systems by pattern formation principles, in: T. Lueth, R. Dillmann, P. Dario, and H. Wörn (Eds.), Distributed Autonomous Robotic Systems, vol. 3, Springer, New York, 1998, pp. 89-100.