Lower bounds for the quadratic semi-assignment problem (Q1388830): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for a task allocation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial algorithm to optimally schedule tasks on a virtual distributed system under tree-like precedence constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangean decomposition: A model yielding stronger lagrangean bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Methods of Nonlinear 0-1 Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the multiprocessor assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: P-Complete Approximation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3707420 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Allocating programs containing branches and loops within a multiple processor system / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Recognition of Series Parallel Digraphs / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0377-2217(95)00013-g / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2019426691 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:08, 30 July 2024

scientific article
Language Label Description Also known as
English
Lower bounds for the quadratic semi-assignment problem
scientific article

    Statements

    Identifiers