Solving the hub location problem with modular link capacities (Q2387305): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: ABACUS / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: OR-Library / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2139099611 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3147668 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concentrator location in telecommunications networks. / 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: Solving the Hub location problem in telecommunication network design: A local search approach / 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: Topological Design of Two-Level Telecommunication Networks with Modular Switches / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Design Problem of Multitechnology Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological expansion of multiple-ring metropolitan area networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic concentration: Two stage solution construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic concentration for the \(p\)-median: An example demonstrating how and why it works / 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: The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search—Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search—Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:56, 10 June 2024

scientific article
Language Label Description Also known as
English
Solving the hub location problem with modular link capacities
scientific article

    Statements

    Solving the hub location problem with modular link capacities (English)
    0 references
    0 references
    0 references
    2 September 2005
    0 references
    Hub location
    0 references
    Branch and cut
    0 references
    Tabu search
    0 references
    Heuristic concentration
    0 references
    0 references
    0 references

    Identifiers