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.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
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
Property / cites work
 
Property / cites work: Q4252288 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness of Approximating Flow and Job Shop Scheduling Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic algorithm for cube packing with time schedule / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Application of Bin-Packing to Multiprocessor Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3170340 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Maximal-Space Algorithm for the Container Loading Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Best packing of rods into boxes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general framework for bounds for higher-dimensional orthogonal packing problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Algorithm for Higher-Dimensional Orthogonal Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for orthogonal packing problems for hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5150973 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3778751 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002474 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3966120 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5297301 / rank
 
Normal rank

Latest revision as of 05:47, 7 July 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