Motion planning with pulley, rope, and baskets (Q385498): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00224-013-9445-4 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2151847882 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bin packing with divisible item sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: When the Greedy Solution Solves a Class of Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization and separation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The polynomial-time hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the equal-subset-sum problem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00224-013-9445-4 / rank
 
Normal rank

Latest revision as of 16:59, 9 December 2024

scientific article
Language Label Description Also known as
English
Motion planning with pulley, rope, and baskets
scientific article

    Statements

    Motion planning with pulley, rope, and baskets (English)
    0 references
    2 December 2013
    0 references
    planning and scheduling
    0 references
    computational complexity
    0 references
    polynomial hierarchy
    0 references

    Identifiers