A discretizing algorithm for location problems (Q1129969): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Q585667 / rank
Normal rank
 
Property / author
 
Property / author: Q585696 / rank
Normal rank
 
Property / author
 
Property / author: Emilio Carrizosa / rank
 
Normal rank
Property / author
 
Property / author: Justo Puerto / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3932576 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Asymmetric Distance Location Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometrical properties of the Fermat-Weber problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Minimal Center-Median Convex Combination (Cent-Dian) of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3929509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Location Theory, Dominance, and Convexity: Some Further Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Minisum and Minimax Location Problems Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing a unimodal function of two integer variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3778514 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal-dual algorithm for the fermat-weber problem involving mixed gauges / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the uniqueness of optimal solutions in continuous location theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving general continuous single facility location problems by cutting planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A destination optimality in asymmetric distance Fermat-Weber problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:52, 28 May 2024

scientific article
Language Label Description Also known as
English
A discretizing algorithm for location problems
scientific article

    Statements

    A discretizing algorithm for location problems (English)
    0 references
    16 August 1998
    0 references
    0 references
    planar continuous single-facility location
    0 references
    0 references
    0 references