A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem (Q1577777): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Roberto Diéguez Galvão / rank
Normal rank
 
Property / author
 
Property / author: Roberto Diéguez Galvão / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: OR-Library / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: An adaptation of SH heuristic to the location set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4387250 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent Applications of the Maximal Covering Location Planning (M.C.L.P.) Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rationalizing Tool Selection in a Flexible Manufacturing System for Sheet-Metal Products / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4883162 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for the linear multiple-choice knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact methods for the knapsack problem and its generalizations / 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 Lagrangean heuristic for the maximal covering location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4178782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Surrogate Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Surrogate Constraint Duality in Mathematical Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Surrogate Mathematical Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4401741 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some relationships between lagrangian and surrogate duality in integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A surrogate heuristic for set covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relaxation heuristics for a generalized assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bicriterion Programs and Managerial Location Decisions: Application to the Banking Sector / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4073134 / rank
 
Normal rank

Latest revision as of 13:21, 30 May 2024

scientific article
Language Label Description Also known as
English
A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem
scientific article

    Statements

    A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem (English)
    0 references
    3 September 2001
    0 references
    0 references
    location
    0 references
    heuristics
    0 references
    Lagrangean relaxation
    0 references
    surrogate relaxation
    0 references
    covering problems
    0 references