Lagrangean heuristics for location problems (Q1804069): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Facility location models for distribution planning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic Analysis of a Relaxation for the <i>k</i>-Median Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Relaxations of the Capacitated Warehouse Location Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A partial dual algorithm for the capacitated warehouse location problem / 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: Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on solving large p-median problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for solving large capacitated warehouse location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4735035 / rank
 
Normal rank
Property / cites work
 
Property / cites work: p-Medians and Multi-Medians / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast primal and dual heuristics for the \(p\)-median location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tree search algorithm for the p-median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of heuristics and relaxations for the capacitated plant location problem / 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: Location problems / 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: ADD-heuristics' starting procedures for capacitated plant location models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kapazitätsplanung in Netzwerken. Ein Überblick über neuere Modelle und Verfahren. (Resource-constrained project planning in networks. A survey on new models and methods) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note—Single and Double Vertex Substitution in Heuristic Procedures for the <i>p</i>-Median Problem / 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: The Lagrangian Relaxation Method for Solving Integer Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Multiplier Adjustment Method for the Generalized Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dual-Bounded Algorithm for the <i>p</i>-Median Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method for solving to optimality uncapacitated location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangean dual ascent algorithm for simple plant location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—An Improved Dual Based Algorithm for the Generalized Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of two dual-based procedures for solving the p-median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the use of tree indexing methods in transportation algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for the capacitated plant location model / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new Lagrangian relaxation approach to the generalized assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Principal direction search: A new method of search for unconstrained LP formulations / 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: On the exact solution of large-scale simple plant location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The simple plant location problem: Survey and synthesis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—An Algorithm for the <i>p</i>-Median Problem / 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: Efficient algorithms for the capacitated concentrator location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling Facility Location Problems as Generalized Assignment Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dual simplex algorithm for the canonical representation of the uncapacitated facility location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The capacitated plant location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic Lagrangean algorithm for the capacitated plant location problem - A comment / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Assigning Uses to Sources in a Special Class of Transportation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: State of the Art—Location on Networks: A Survey. Part I: The <i>p</i>-Center and <i>p</i>-Median Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: State of the Art—Location on Networks: A Survey. Part II: Exploiting Tree Network Structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dual-Based Add Heuristic for Uncapacitated Facility Location / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Cross Decomposition Algorithm for Capacitated Facility Location / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems / rank
 
Normal rank

Latest revision as of 16:58, 17 May 2024

scientific article
Language Label Description Also known as
English
Lagrangean heuristics for location problems
scientific article

    Statements

    Lagrangean heuristics for location problems (English)
    0 references
    29 June 1993
    0 references
    Lagrangean heuristics
    0 references
    Lagrangean relaxation
    0 references
    subgradient optimisation
    0 references
    \(p\)-median
    0 references
    uncapacitated warehouse location
    0 references
    capacitated warehouse location
    0 references
    0 references
    0 references
    0 references

    Identifiers