Treatment of combinatorial optimization problems using selection equations with cost terms. II: NP-hard three-dimensional assignment problems
type: Item
instance of: scholarly article
title: Treatment of combinatorial optimization problems using selection equations with cost terms. II: NP-hard three-dimensional assignment problems
zbMATH Open document ID: 0931.90040
DOI: 10.1016/S0167-2789(99)00113-X
published in: Physica D
publication date: 1999-12-06T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90-08
zbMATH DE Number: 1374408
zbMATH Keywords: selection equations
zbMATH Keywords: penalty methods
zbMATH Keywords: \({\mathcal N} {\mathcal P}\)-hard
zbMATH Keywords: three-dimensional assignment problem
zbMATH Keywords: combinatorial optimization
Wikidata QID: Q59897898
author: Jens Starke
author: Michael Schanz
author: H. Haken
MaRDI profile type: Publication
cites work: Q3974955
cites work: Q4198056
cites work: Synergetic computers and cognition. A top-down approach to neural nets
cites work: Treatment of combinatorial optimization problems using selection equations with cost terms. I: Two-dimensional assignment problems
cites work: Q4093215
cites work: Q4739657
cites work: Q4247453
full work available at URL: s0167-2789(99)00113-x
OpenAlex ID: W4234393882
Recommended article: Treatment of combinatorial optimization problems using selection equations with cost terms. I: Two-dimensional assignment problems
Recommended article: On solving a hard quadratic 3-dimensional assignment problem
Recommended article: Computational Results for Four Exact Methods to Solve the Three-Objective Assignment Problem
Recommended article: Time-cost tradeoff in a three-dimensional assignment problem
Recommended article: Combinatorial optimization problems with two and three criteria
Recommended article: The quadratic three-dimensional assignment problem: exact and approximate solution methods
Recommended article: Q4450463
Recommended article: Three-dimensional axial assignment problems with decomposable cost coefficients
Recommended article: Combinatorial optimization with interaction costs: complexity and solvable cases
description: scientific article; zbMATH DE number 1374408