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

DOI10.1016/S0167-2789(99)00113-XzbMath0931.90040OpenAlexW4234393882WikidataQ59897898 ScholiaQ59897898MaRDI QIDQ1808370

Michael Schanz, Hermann Haken, Jens Starke

Publication date: 6 December 1999

Published in: Physica D (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-2789(99)00113-x

zbMATH Keywords

combinatorial optimizationpenalty methodsselection equations\({\mathcal N} {\mathcal P}\)-hardthree-dimensional assignment problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

On a multistable competitive network model in the case of an inhomogeneous growth rate spectrum: With an application to priming ⋮ Multistable selection equations of pattern formation type in the case of inhomogeneous growth rates: With applications to two-dimensional assignment problems ⋮ Self-organized control in cooperative robots using a pattern formation principle

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Synergetic computers and cognition. A top-down approach to neural nets
• Treatment of combinatorial optimization problems using selection equations with cost terms. I: Two-dimensional assignment problems