Benders decomposition applied to a robust multiple allocation incomplete hub location problem (Q1652441): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q57719338, #quickstatements; #temporary_batch_1712286835472
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Network hub location problems: The state of the art / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hub covering network design problem for cargo applications in Turkey / 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: Robust discrete optimization and network flows / 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: Benders decomposition for the uncapacitated multiple allocation 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: Q3147668 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hub Arc Location Problems: Part I—Introduction and Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benders Decomposition for Large-Scale Uncapacitated Hub Location / rank
 
Normal rank
Property / cites work
 
Property / cites work: General network design: a unified view of combined location and network design 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: The Latest Arrival Hub Location 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: An improved Benders decomposition algorithm for the tree of hubs location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and heuristic algorithms for the design of hub networks with multiple lines / rank
 
Normal rank

Revision as of 02:13, 16 July 2024

scientific article
Language Label Description Also known as
English
Benders decomposition applied to a robust multiple allocation incomplete hub location problem
scientific article

    Statements

    Benders decomposition applied to a robust multiple allocation incomplete hub location problem (English)
    0 references
    11 July 2018
    0 references
    hub network design problem
    0 references
    robust optimization
    0 references
    benders decomposition method
    0 references
    demand uncertainty
    0 references
    fixed setup cost uncertainty
    0 references
    ils-vnd heuristic
    0 references

    Identifiers