Metaheuristic methods for solving the Bilevel Uncapacitated Facility Location Problem with Clients' Preferences (Q2840751): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.endm.2012.10.007 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.endm.2012.10.007 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1997982540 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strengthened formulation for the simple plant location problem with order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search: Principles and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: New lower bounds for the facility location problem with clients’ preferences / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.ENDM.2012.10.007 / rank
 
Normal rank

Latest revision as of 01:51, 20 December 2024

scientific article
Language Label Description Also known as
English
Metaheuristic methods for solving the Bilevel Uncapacitated Facility Location Problem with Clients' Preferences
scientific article

    Statements

    Metaheuristic methods for solving the Bilevel Uncapacitated Facility Location Problem with Clients' Preferences (English)
    0 references
    0 references
    0 references
    0 references
    23 July 2013
    0 references
    location problems
    0 references
    discrete optimization
    0 references
    particle swarm optimization
    0 references
    simulated annealing
    0 references
    variable neighborhood search
    0 references

    Identifiers