Extremal problems for convex polygons (Q2460117): Difference between revisions

From MaRDI portal
Changed an Item
Normalize DOI.
 
(10 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10898-006-9065-5 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: COPS / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: LANCELOT / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SNOPT / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: filterSQP / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: DONLP2 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MINOS / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: LOQO / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10898-006-9065-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2002285779 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and cut algorithm for nonconvex quadratically constrained quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The small octagon with longest perimeter / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum diameter octagon with unit-length sides: Vincze's wife's octagon is suboptimal / rank
 
Normal rank
Property / cites work
 
Property / cites work: The largest small octagon / rank
 
Normal rank
Property / cites work
 
Property / cites work: On convex polygons of maximal width / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Isoperimetric Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023146 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unsolved problems in geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: A discrete isoperimetric problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Sets of Distances of n Points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über eine Punktverteilung auf der Kugel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4274003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The largest small hexagon / rank
 
Normal rank
Property / cites work
 
Property / cites work: The largest small \(n\)-dimensional polytope with \(n+3\) vertices. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A correction to ``The largest small \(n\)-dimensional polytope with \(n+3\) vertices'' [J. Combin. Theory Ser. A 102 (2003) 401-409] / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithme d'encadrement de l'optimum global d'une fonction différentiable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3679825 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic global optimization using interval constraint propagation techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4520756 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5566070 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A $1 Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isodiametric problems for polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the sum of distances under a diameter constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: On extremal point disributions in the Euclidean plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040272 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Case studies in evolutionary experimentation and computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A reformulation-linearization technique for solving discrete and continuous nonconvex problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new reformulation-linearization technique for bilinear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Optimization in Geometry — Circle Packing into the Square / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3800655 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5839836 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5795816 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Averaging distances in real quasihypermetric Banach spaces of finite dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5615942 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10898-006-9065-5 / rank
 
Normal rank

Latest revision as of 18:50, 18 December 2024

scientific article
Language Label Description Also known as
English
Extremal problems for convex polygons
scientific article

    Statements

    Extremal problems for convex polygons (English)
    0 references
    0 references
    0 references
    0 references
    14 November 2007
    0 references
    Polygon
    0 references
    Perimeter
    0 references
    Diameter
    0 references
    Area
    0 references
    Sum of distances
    0 references
    Width
    0 references
    Isoperimeter problem
    0 references
    Isodiametric problem
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers