Upper and lower bounds for the single source capacitated location problem. (Q1410616): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Lagrangean heuristics applied to a variety of large capacitated plant location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic lagrangean algorithm for the capacitated plant location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangean heuristics for location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4184789 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangian Relaxation and the Single-Source Capacitated Facility-Location Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An all Zero-One Algorithm for a Certain Class of Transportation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dual-Based Procedure for Uncapacitated Facility Location / rank
 
Normal rank
Property / cites work
 
Property / cites work: Future paths for integer programming and links to artificial intelligence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4354785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Traveling-Salesman Problem and Minimum Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling-salesman problem and minimum spanning trees: Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient solution of large scale, single-source, capacitated plant location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the capacitated facility location problems with single sourcing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for the Fixed-Charge Assigning Users to Sources Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Algorithm for the Capacitated Facility Location Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for the capacitated concentrator location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangian heuristic for the capacitated plant location problem with single source constraints / rank
 
Normal rank

Latest revision as of 10:47, 6 June 2024

scientific article
Language Label Description Also known as
English
Upper and lower bounds for the single source capacitated location problem.
scientific article

    Statements

    Upper and lower bounds for the single source capacitated location problem. (English)
    0 references
    14 October 2003
    0 references
    Capacitated facility location
    0 references
    Lagrangean heuristics
    0 references
    Tabu search
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers