Mathematical formulations and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem (Q2691195): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disopt.2021.100672 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3212019837 / 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: Network hub location problems: The state of the art / 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
Property / cites work
 
Property / cites work: GRASP for the uncapacitated \(r\)-allocation \(p\)-hub median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Models and solution methods for the uncapacitated <i>r</i>‐allocation <i>p</i>‐hub equitable center 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: A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient genetic algorithm for the Uncapacitated r-allocation p-hub maximal covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Novel formulations and VNS-based heuristics for single and multiple allocation \(p\)-hub maximal covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search / 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 neighbourhood search: methods and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: An annotated bibliography of GRASP – Part I: Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by GRASP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search: basics and variants / rank
 
Normal rank
Property / cites work
 
Property / cites work: General variable neighborhood search for the uncapacitated single allocation \(p\)-hub center problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective VNS for the capacitated \(p\)-median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Less is more: general variable neighborhood search for the capacitated modular hub location problem / 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: A general VNS heuristic for the traveling salesman problem with time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy randomized adaptive search procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reactive Grasp And Tabu Search Based Heuristics For The Single Source Capacitated Plant Location Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Avoiding local optima in the \(p\)-hub location problem using tabu search and GRASP / rank
 
Normal rank
Property / cites work
 
Property / cites work: An annotated bibliography of GRASP-Part II: Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: GRASP with Path Relinking for Three-Index Assignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local search with perturbations for the prize-collecting Steiner tree problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized heuristics for the Max-Cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: GRASP with path relinking for the weighted MAXSAT problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parallel grasp for the Steiner tree problem in graphs using a hybrid local search strategy / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search for the degree-constrained minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A GRASP/VND heuristic for the phylogeny problem using a new neighborhood structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu search based heuristics for multi-floor facility layout / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu search and GRASP for the maximum diversity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527204 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A greedy genetic algorithm for the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design of stacked self-healing rings using a genetic algorithm / 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: Q2753185 / 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: A hub covering model for cargo delivery systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Release Time Scheduling and Hub Location for Next-Day Delivery / 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 2-phase algorithm for solving the single allocation \(p\)-hub center problem / 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: Q4509286 / rank
 
Normal rank

Latest revision as of 19:00, 31 July 2024

scientific article
Language Label Description Also known as
English
Mathematical formulations and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem
scientific article

    Statements

    Mathematical formulations and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    29 March 2023
    0 references
    \(p\)-hub covering problem
    0 references
    \(r\)-allocation
    0 references
    binary and partial coverage
    0 references
    variable neighborhood search
    0 references
    greedy randomized adaptive search procedure
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references