Some heuristic methods for solving \(p\)-median problems with a coverage constraint (Q1926741): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A Lagrangean relaxation method for the constrained assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest chain subject to side constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective heuristic for large-scale capacitated facility location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational study of large-scale \(p\)-median problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Optimal Diversity Management Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Heuristic Method for the Set Covering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangian heuristic algorithm for a real-world train timetabling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiobjective programming and planning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4857376 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicriteria Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching for the Multiplier in One-Constraint Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangean relaxation. (With comments and rejoinder). / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster analysis and mathematical programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithmic Approach to Network Location Problems. II: The<i>p</i>-Medians / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687198 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(p\)-median problem: a survey of metaheuristic approaches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster Analysis: An Application of Lagrangian Relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution methods for thep-median problem: An annotated bibliography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4452897 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid heuristic for the \(p\)-median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid multistart heuristic for the uncapacitated facility location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast swap-based local search procedure for location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed charge transportation problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems / 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 Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution methods for the bi-objective (cost-coverage) unconstrained facility location problem with an illustrative example / rank
 
Normal rank
Property / cites work
 
Property / cites work: The constrained shortest path problem: algorithmic approaches and an algebraic study with generalization / rank
 
Normal rank

Latest revision as of 01:28, 6 July 2024

scientific article
Language Label Description Also known as
English
Some heuristic methods for solving \(p\)-median problems with a coverage constraint
scientific article

    Statements

    Some heuristic methods for solving \(p\)-median problems with a coverage constraint (English)
    0 references
    29 December 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    location
    0 references
    \(p\)-median
    0 references
    coverage constraint
    0 references
    local search
    0 references
    GRASP
    0 references
    Lagrangean relaxation
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references