An efficient matheuristic for the robust multiple allocation \(p\)-hub median problem under polyhedral demand uncertainty (Q1652700): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q129884562, #quickstatements; #temporary_batch_1724809781087
 
(7 intermediate revisions by 6 users not shown)
Property / author
 
Property / author: Nader Ghaffari-Nasab / rank
Normal rank
 
Property / author
 
Property / author: Nader Ghaffari-Nasab / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: R / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cor.2018.04.021 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2802557590 / 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: Preprocessing and cutting for multiple allocation hub location problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust optimization approach to capacitated single and multiple allocation hub location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu-search based heuristic for the hub covering problem over incomplete hub networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Location and allocation for distribution systems with transshipments and transportion economies of scale / 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: Hub Location and the <i>p</i>-Hub Median Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic uncapacitated hub location / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid outer-approximation/Benders decomposition algorithm for the single allocation hub location problem under congestion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benders decomposition applied to a robust multiple allocation incomplete hub location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for the uncapacitated single allocation p-hub 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: Solution algorithms for the capacitated single allocation hub location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integrating matheuristics and metaheuristics for timetabling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hub interdiction problem variants: models and metaheuristic solution algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient simulated annealing based solution approaches to the competitive single and multiple allocation hub location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Future paths for integer programming and links to artificial intelligence / rank
 
Normal rank
Property / cites work
 
Property / cites work: A matheuristic based on large neighborhood search for the vehicle routing problem with cross-docking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adapting polyhedral properties from facility to hub location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simulated annealing-based heuristic for the single allocation maximal covering hub location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matheuristics for the single-path design-balanced service network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A competitive hub location and pricing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matheuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Location models for airline hubs behaving as \(M/D/c\) queues. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Location of hubs in a competitive environment / rank
 
Normal rank
Property / cites work
 
Property / cites work: A capacitated hub location problem under hose demand uncertainty / 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: New simple and efficient heuristics for the uncapacitated single allocation hub location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu search heuristic for the uncapacitated single allocation \(p\)-hub maximal covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The stochastic \(p\)-hub center problem with service-level constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: On tabu search for the location of interacting hub facilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight linear programming relaxations of uncapacitated \(p\)-hub median problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matheuristics for the capacitated p‐median problem / 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: Solving the uncapacitated hub location problem using genetic algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic air freight hub location and flight routes planning / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129884562 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:55, 28 August 2024

scientific article
Language Label Description Also known as
English
An efficient matheuristic for the robust multiple allocation \(p\)-hub median problem under polyhedral demand uncertainty
scientific article

    Statements

    An efficient matheuristic for the robust multiple allocation \(p\)-hub median problem under polyhedral demand uncertainty (English)
    0 references
    11 July 2018
    0 references
    hub location
    0 references
    polyhedral uncertainty
    0 references
    mathematical formulation
    0 references
    matheuristics
    0 references
    tabu search
    0 references
    0 references

    Identifiers

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