Treatment of combinatorial optimization problems using selection equations with cost terms. II: NP-hard three-dimensional assignment problems (Q1808370): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Jens Starke / rank
Normal rank
 
Property / author
 
Property / author: Michael Schanz / rank
Normal rank
 
Property / author
 
Property / author: Hermann Haken / rank
Normal rank
 
Property / Wikidata QID
 
Property / Wikidata QID: Q59897898 / rank
 
Normal rank
Property / author
 
Property / author: Jens Starke / rank
 
Normal rank
Property / author
 
Property / author: Michael Schanz / rank
 
Normal rank
Property / author
 
Property / author: Hermann Haken / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3974955 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synergetic computers and cognition. A top-down approach to neural nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treatment of combinatorial optimization problems using selection equations with cost terms. I: Two-dimensional assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4093215 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247453 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0167-2789(99)00113-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4234393882 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:22, 30 July 2024

scientific article
Language Label Description Also known as
English
Treatment of combinatorial optimization problems using selection equations with cost terms. II: NP-hard three-dimensional assignment problems
scientific article

    Statements

    Treatment of combinatorial optimization problems using selection equations with cost terms. II: NP-hard three-dimensional assignment problems (English)
    0 references
    0 references
    6 December 1999
    0 references
    selection equations
    0 references
    penalty methods
    0 references
    \({\mathcal N} {\mathcal P}\)-hard
    0 references
    three-dimensional assignment problem
    0 references
    combinatorial optimization
    0 references
    0 references
    0 references
    0 references

    Identifiers