论文信息 - Treatment of combinatorial optimization problems using selection equations with cost terms. Part II. NP -hard three-dimensional assignment problems - 字舞流文

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

H. Haken | M. Schanz | J. Starke

[1] Hermann Haken. Pattern Formation and Pattern Recognition — An Attempt at a Synthesis , 1979 .

[2] Kenneth Steiglitz,et al. Combinatorial Optimization: Algorithms and Complexity , 1981 .

[3] Konstantinos Paparrizos,et al. A Dual Forest Algorithm for the Assignment Problem , 1990, Applied Geometry And Discrete Mathematics.

[4] Professor Dr. Dr. h.c. Hermann Haken,et al. Synergetic Computers and Cognition , 1991, Springer Series in Synergetics.

[5] H. Haken,et al. Associative memory of a dynamical system: the example of the convection instability , 1991 .

[6] Jens Starke. Cost oriented competing processes — a new handling of assignment problems , 1996 .

[7] Michael Schanz,et al. Self-Organized Behaviour of Distributed Autonomous Mobile Robotic Systems by Pattern Formation Principles , 1998, DARS.

[8] Michael Schanz,et al. Dynamical System Approaches to Combinatorial Optimization , 1998 .

[9] Hermann Haken. Decision Making and Optimization in Regional Planning , 1998 .

[10] P. Pardalos,et al. Handbook of Combinatorial Optimization , 1998 .