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

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(7 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10878-014-9816-z / rank
Normal rank
 
Property / author
 
Property / author: José-Miguel Díaz-Báñez / rank
Normal rank
 
Property / author
 
Property / author: David Flores-Peñaloza / rank
Normal rank
 
Property / author
 
Property / author: Sergey Bereg / rank
Normal rank
 
Property / author
 
Property / author: Jorge Urrutia / rank
Normal rank
 
Property / author
 
Property / author: José-Miguel Díaz-Báñez / rank
 
Normal rank
Property / author
 
Property / author: David Flores-Peñaloza / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2036438899 / rank
 
Normal rank
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
Property / DOI
 
Property / DOI: 10.1007/S10878-014-9816-Z / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:55, 9 December 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