Locating an obnoxious plane (Q2496077): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2005.02.048 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2095186281 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The overlay of lower envelopes and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the sum of squares of cell complexities in hyperplane arrangements / rank
 
Normal rank
Property / cites work
 
Property / cites work: OBNOXIOUS FACILITY LOCATION: COMPLETE SERVICE WITH MINIMAL HARM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Facility Location in Three Dimensions—Models and Solution Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: The K-dense corridor problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Widest empty L-shaped corridor / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE LARGEST EMPTY ANNULUS PROBLEM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Continuous location of dimensional structures. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3772828 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topologically sweeping an arrangement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing a Largest Empty Anchored Cylinder, and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Red-Blue Separability Problems in 3D / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the width of a set / rank
 
Normal rank
Property / cites work
 
Property / cites work: The power of geometric duality revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric complexity of some location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing circular separability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4325546 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The widest k-dense corridor problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locating lines and hyperplanes. Theory and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing largest empty circles with location constraints / rank
 
Normal rank

Latest revision as of 16:49, 24 June 2024

scientific article
Language Label Description Also known as
English
Locating an obnoxious plane
scientific article

    Statements

    Locating an obnoxious plane (English)
    0 references
    0 references
    0 references
    30 June 2006
    0 references
    location
    0 references
    computational geometry
    0 references
    maximin
    0 references
    duality
    0 references

    Identifiers