Solving the minimum convex partition of point sets with integer programming (Q824341): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q5241193 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of edges of many faces in a line segment arrangement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-Price: Column Generation for Solving Huge Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge insertion for optimal triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arc-based integer programming formulations for three variants of proportional symbol maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangulations. Structures for algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing nonsimple polygons of minimum perimeter / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing maxmin edge length triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum convex partition of a constrained point set / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Integer Programming Approach to the Vehicle Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2970453 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ellipsoid method and its consequences in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for the Minimum Convex Partition Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selected Topics in Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using the primal-dual interior point algorithm within the branch-price-and-cut method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on convex decompositions of a set of points in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the geometric firefighter routing problem via integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum convex partition of point sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The nature and meaning of perturbations in geometric computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fixed parameter algorithm for optimal convex partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 966 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4354953 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4254875 / rank
 
Normal rank

Revision as of 12:31, 27 July 2024

scientific article
Language Label Description Also known as
English
Solving the minimum convex partition of point sets with integer programming
scientific article

    Statements

    Solving the minimum convex partition of point sets with integer programming (English)
    0 references
    0 references
    0 references
    0 references
    15 December 2021
    0 references
    computational geometry
    0 references
    combinatorial optimization
    0 references
    minimum convex partition
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers