Lower and upper bounds for a two-level hierarchical location problem in computer networks (Q2462545): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Roberto Diéguez Galvão / rank
Normal rank
 
Property / author
 
Property / author: Roberto Diéguez Galvão / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CPLEX / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Tabu search / rank
 
Normal rank
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.cor.2006.10.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2078279808 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selecting hierarchical facilities in a service-operations environment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper and lower bounds for the two-level simple plant location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological design of telecommunication networks --- local access design methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cost-optimal topology planning of hierarchical access networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locational analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Overview of Representative Problems in Location Research / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for distribution network design in telecommunication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological design of computer communication networks -- the overall design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of optimal methods for local access uncapacitated network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: INTEGER PROGRAMMING MODEL AND EXACT SOLUTION FOR CONCENTRATOR LOCATION PROBLEM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal design of a distributed network with a two-level hierarchical structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for Two-Level Hierarchical Transportation Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4229631 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization of resource location in hierarchical computer networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for the capacitated concentrator location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for the Fixed-Charge Assigning Users to Sources Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangian relaxation for the star-star concentrator location problem: Approximation algorithm and bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the hub location problem with modular link capacities / 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: Capacitated location-allocation problems on a line / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the capacitated concentrator location problem: a reformulation by discretization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacitated facility location problem with general setup cost / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for the Design of Multitype Concentrator Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Price Algorithm for the Generalized Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Validation of subgradient optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Lagrangian Relaxation Method for Solving Integer Programming Problems / 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: The tabu search metaheuristic: How we used it / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:48, 27 June 2024

scientific article
Language Label Description Also known as
English
Lower and upper bounds for a two-level hierarchical location problem in computer networks
scientific article

    Statements

    Lower and upper bounds for a two-level hierarchical location problem in computer networks (English)
    0 references
    30 November 2007
    0 references
    hierarchical location problems
    0 references
    design of computer networks
    0 references
    Lagrangean relaxation
    0 references
    tabu search
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers