The multi-spreader crane scheduling problem: partitions and supersequences (Q2217473): 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.dam.2020.10.012 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3094413683 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Loading Time Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restricted Common Superstring and Restricted Common Supersequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: The constrained shortest common supersequence problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and algorithms for plan merging / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4858904 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Approximation of Shortest Common Supersequences and Longest Common Subsequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing dual-spreader crane operations: mathematical formulation and heuristic algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Some Problems on Subsequences and Supersequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: More on the complexity of common superstring and supersequence problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2715768 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximate \(A^{\ast}\) algorithm and its application to the SCS problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The shortest common supersequence problem over binary alphabet is NP- complete / rank
 
Normal rank

Latest revision as of 07:00, 24 July 2024

scientific article
Language Label Description Also known as
English
The multi-spreader crane scheduling problem: partitions and supersequences
scientific article

    Statements

    The multi-spreader crane scheduling problem: partitions and supersequences (English)
    0 references
    0 references
    0 references
    0 references
    29 December 2020
    0 references
    0 references
    0 references
    0 references
    0 references
    crane scheduling
    0 references
    partitions
    0 references
    supersequences
    0 references
    0 references