The bicriterion semi-obnoxious location (BSL) problem solved by an \(\varepsilon\)-approximation (Q1869670): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On locating a semi-desirable facility on the continuous plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: An empirical investigation of some bicriterion shortest path algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4265879 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicriteria optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analytical models for locating undesirable facilities / 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: Q4383637 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4203976 / rank
 
Normal rank
Property / cites work
 
Property / cites work: GBSSS: The generalized big square small square method for planar single- facility location / rank
 
Normal rank
Property / cites work
 
Property / cites work: A label correcting approach for solving bicriterion shortest-path problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3815146 / rank
 
Normal rank

Revision as of 14:34, 5 June 2024

scientific article
Language Label Description Also known as
English
The bicriterion semi-obnoxious location (BSL) problem solved by an \(\varepsilon\)-approximation
scientific article

    Statements

    The bicriterion semi-obnoxious location (BSL) problem solved by an \(\varepsilon\)-approximation (English)
    0 references
    0 references
    0 references
    28 April 2003
    0 references
    Multiple criteria analysis
    0 references
    semi-obnoxious
    0 references
    location
    0 references
    planar networks
    0 references

    Identifiers