Solving a capacitated hub location problem (Q2384615): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Network Design Using Cut Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Designing cost-effective content distribution networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning procedures for solving mixed-variables programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition approach for an equipment selection and multiple product routing problem incorporating environmental factors / 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: A survey on Benders decomposition applied to fixed-charge network design 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: Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact solution of multicommodity network optimization problems with general step cost functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dioïds and semirings: Links to fuzzy sets and other applications / 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: Variable neighborhood search: Principles and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of max flow—min cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact solution methods for uncapacitated location problems with convex transportation costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tailoring Benders decomposition for uncapacitated network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria / rank
 
Normal rank
Property / cites work
 
Property / cites work: HubLocator: An exact solution method for the multiple allocation hub location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hub network design with single and multiple allocation: A computational study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benders-and-cut algorithm for fixed-charge capacitated network design 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: A demand-shifting feasibility algorithm for Benders decomposition. / rank
 
Normal rank

Revision as of 09:43, 27 June 2024

scientific article
Language Label Description Also known as
English
Solving a capacitated hub location problem
scientific article

    Statements

    Solving a capacitated hub location problem (English)
    0 references
    10 October 2007
    0 references
    network design
    0 references
    telecommunication
    0 references
    capacitated hub location problem
    0 references
    Benders decomposition
    0 references
    branch-and-cut algorithm
    0 references

    Identifiers