Novel formulations and VNS-based heuristics for single and multiple allocation \(p\)-hub maximal covering problems (Q1698283): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network hub location problems: The state of the art / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hub covering network design problem for cargo applications in Turkey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Obtaining test problems via Internet / rank
 
Normal rank
Property / cites work
 
Property / cites work: The generalized maximal covering location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The gradual covering decay location problem on a network. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A basic variable neighborhood search heuristic for the uncapacitated multiple allocation \(p\)-hub center problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer programming formulations of discrete hub location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search for minimum sum-of-squares clustering on networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variable neighborhood search based matheuristic for nurse rostering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New heuristic algorithms for solving the planar \(p\)-median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub 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: Variable neighbourhood search: methods and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search: basics and variants / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The single-assignment hub covering problem: Models and linearizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A maximal covering location model in the presence of partial coverage / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 2-phase algorithm for solving the single allocation \(p\)-hub center problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two phase variable neighborhood search for the multi-product inventory routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two level general variable neighborhood search for attractive traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quadratic integer program for the location of interacting hub facilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search for the stochastic and dynamic vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub Median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model formulations for hub covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Allocation strategies in hub networks / rank
 
Normal rank

Latest revision as of 04:28, 15 July 2024

scientific article
Language Label Description Also known as
English
Novel formulations and VNS-based heuristics for single and multiple allocation \(p\)-hub maximal covering problems
scientific article

    Statements

    Novel formulations and VNS-based heuristics for single and multiple allocation \(p\)-hub maximal covering problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    15 February 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    \(p\)-hub maximal covering problem
    0 references
    binary and partial coverage
    0 references
    mixed integer programming
    0 references
    variable neighborhood search
    0 references
    0 references
    0 references