An efficient model for the multiple allocation hub maximal covering problem (Q6078427): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Modeling fuzzy capacitated p-hub center problem and a genetic algorithm solution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ambulance location and relocation models. / 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: Hub Location and the <i>p</i>-Hub Median Problem / 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: The tree of hubs location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for the uncapacitated single allocation planar hub location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving large single allocation \(p\)-hub problems with two or three hubs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The capacitated multiple allocation hub location problem: Formulations and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uncapacitated single and multiple allocation \(p\)-hub center problems / 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: The simple plant location problem: Survey and synthesis / 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: On the single-assignment \(p\)-hub center 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: Bicriteria <i>p</i>-Hub Location Problems and Evolutionary Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The capacitated \(p\)-hub median problem with integral constraints: an application to a Chinese air cargo network / rank
 
Normal rank
Property / cites work
 
Property / cites work: The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations / 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: New formulations for the uncapacitated multiple allocation hub location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Maximum Coverage Location Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(p\)-hub center allocation 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: The Boolean quadratic polytope: Some characteristics, facets and relatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path relinking approach for multiple allocation hub maximal covering 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: Solving a capacitated hub location problem / 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: Dual-based approach for a hub network design problem under non-restrictive policy / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact solution procedure for a cluster hub location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model formulations for hub covering problems / rank
 
Normal rank

Latest revision as of 01:23, 3 August 2024

scientific article; zbMATH DE number 7742847
Language Label Description Also known as
English
An efficient model for the multiple allocation hub maximal covering problem
scientific article; zbMATH DE number 7742847

    Statements

    An efficient model for the multiple allocation hub maximal covering problem (English)
    0 references
    0 references
    0 references
    0 references
    27 September 2023
    0 references
    hub location problem
    0 references
    branch and bound
    0 references
    transportation
    0 references
    valid cuts
    0 references

    Identifiers