On the weak computability of a four dimensional orthogonal packing and time scheduling problem (Q391303): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2013.07.023 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2013483504 / rank
 
Normal rank

Revision as of 20:28, 19 March 2024

scientific article
Language Label Description Also known as
English
On the weak computability of a four dimensional orthogonal packing and time scheduling problem
scientific article

    Statements

    On the weak computability of a four dimensional orthogonal packing and time scheduling problem (English)
    0 references
    0 references
    0 references
    10 January 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    computability
    0 references
    exact algorithm
    0 references
    scheduling
    0 references
    higher dimensional packing
    0 references
    real parameters
    0 references
    0 references