The \(p\)-hub center allocation problem (Q852943): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.ejor.2005.09.024 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2031373052 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid heuristic for the uncapacitated hub location 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: 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: Solution algorithms for the capacitated single allocation hub location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Khachiyan’s algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accumulation Point Location on Tree Networks for Guaranteed Time Distribution / 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 Latest Arrival Hub Location Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial algorithms in linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dual algorithm for the uncapacitated hub location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for solving the conditional covering problem on paths / 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: Tight linear programming relaxations of uncapacitated \(p\)-hub median problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient solution procedure and reduced size formulations for \(p\)-hub location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The generalized <i>P</i>‐forest problem on a tree network / rank
 
Normal rank

Latest revision as of 22:06, 24 June 2024

scientific article
Language Label Description Also known as
English
The \(p\)-hub center allocation problem
scientific article

    Statements

    The \(p\)-hub center allocation problem (English)
    0 references
    0 references
    0 references
    0 references
    15 November 2006
    0 references
    hub location
    0 references
    networks
    0 references
    complexity theory
    0 references

    Identifiers