Optimizing some constructions with bars: new geometric knapsack problems (Q266044): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Geometric Knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering point sets with two disjoint disks or squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal placement of convex polygons to maximize point containment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4229625 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3147657 / rank
 
Normal rank

Revision as of 18:28, 11 July 2024

scientific article
Language Label Description Also known as
English
Optimizing some constructions with bars: new geometric knapsack problems
scientific article

    Statements

    Optimizing some constructions with bars: new geometric knapsack problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    13 April 2016
    0 references
    geometric optimization
    0 references
    combinatorial optimization
    0 references
    inequalities
    0 references
    optimal algorithms
    0 references

    Identifiers