Efficient algorithms for the capacitated concentrator location problem

DOI10.1016/0305-0548(87)90022-0zbMath0617.90019OpenAlexW2070759324MaRDI QIDQ1088878

Hasan Pirkul

Publication date: 1987

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(87)90022-0

zbMATH Keywords

Lagrangian relaxationheuristiccomputer communication networkscapacitated concentrator location problemTopological design

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Inventory, storage, reservoirs (90B05)

Related Items (56)

Efficient algorithms for the capacitated concentrator location problem ⋮ A heuristic for BILP problems: the single source capacitated facility location problem ⋮ A branch-and-price algorithm for the capacitated facility location problem ⋮ An exact algorithm for the capacitated facility location problems with single sourcing ⋮ A mixed-integer approach to Core-Edge design of storage area networks ⋮ A matheuristic for large-scale capacitated clustering ⋮ A cut-and-solve based algorithm for the single-source capacitated facility location problem ⋮ Combined capacity planning and concentrator location in computer communications networks ⋮ Matheuristics: survey and synthesis ⋮ Solving the bi‐objective capacitated p‐median problem with multilevel capacities using compromise programming and VNS ⋮ Optimizing a multi-echelon location-inventory problem with joint replenishment: a Lipschitz \(\epsilon\)-optimal approach using Lagrangian relaxation ⋮ A hypergraph multi-exchange heuristic for the single-source capacitated facility location problem ⋮ Locating Satellite Yards in Forestry Operations ⋮ Relaxation techniques applied to some loading problems ⋮ A multi-commodity, multi-plant, capacitated facility location problem: Formulation and efficient heuristic solution. ⋮ Upper and lower bounds for the single source capacitated location problem. ⋮ The capacitated maximal covering location problem with backup service ⋮ A multiperiod planning model for the capacitated minimal spanning tree problem ⋮ An effective VNS for the capacitated \(p\)-median problem ⋮ Topological design of telecommunication networks --- local access design methods ⋮ Scatter search for the single source capacitated facility location problem ⋮ Topological Design of Centralized Computer Networks ⋮ Lower and upper bounds for a two-level hierarchical location problem in computer networks ⋮ An improved cut-and-solve algorithm for the single-source capacitated facility location problem ⋮ A dual RAMP algorithm for single source capacitated facility location problems ⋮ The \(K\)-coverage concentrator location problem ⋮ Locating concentrators in centralized computer networks ⋮ Star \(p\)-hub median problem with modular arc capacities ⋮ Capacitated emergency facility siting with multiple levels of backup ⋮ Optimal design of a distributed network with a two-level hierarchical structure ⋮ A cut and branch approach for the capacitated \(p\)-median problem based on Fenchel cutting planes ⋮ Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem ⋮ Facility location models for distribution system design ⋮ A coordinated planning model for the design of a distributed database system ⋮ On the capacitated concentrator location problem: a reformulation by discretization ⋮ Benders decomposition, Lagrangean relaxation and metaheuristic design ⋮ Outbound supply chain network design with mode selection, lead times and capacitated vehicle distribution centers ⋮ Optimal locations of switches and interconnections for ATM LANs ⋮ A new extended formulation with valid inequalities for the capacitated concentrator location problem ⋮ Model-based capacitated clustering with posterior regularization ⋮ A new method for solving capacitated location problems based on a set partitioning approach ⋮ Two-level vehicle routing with cross-docking in a three-echelon supply chain: a genetic algorithm approach ⋮ Lagrangean heuristics for location problems ⋮ Auxiliary tool allocation in flexible manufacturing systems ⋮ A computational evaluation of a general branch-and-price framework for capacitated network location problems ⋮ An exact method for the two-echelon, single-source, capacitated facility location problem ⋮ Lagrangian heuristics for the two-echelon, single-source, capacitated facility location problem ⋮ Matheuristics for the capacitated p‐median problem ⋮ A scatter search heuristic for the capacitated clustering problem ⋮ Hybrid scatter search and path relinking for the capacitated \(p\)-median problem ⋮ Lagrangean Relaxation-Based Techniques for Solving Facility Location Problems ⋮ An integrated approach for planning the adoption of client/server systems ⋮ A multiplier adjustment technique for the capacitated concentrator location problem ⋮ On a cost allocation problem arising from a capacitated concentrator covering problem ⋮ A simulated annealing methodology to distribution network design and management ⋮ A repeated matching heuristic for the single-source capacitated facility location problem

Cites Work

• Unnamed Item
• A heuristic lagrangean algorithm for the capacitated plant location problem
• An integer programming model for the allocation of databases in a distributed computer system
• Efficient algorithms for the capacitated concentrator location problem
• A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality
• A direct dual method for the mixed plant location problem with some side constraints
• An Algorithm for the Fixed-Charge Assigning Users to Sources Problem
• Lagrangian relaxation for the star-star concentrator location problem: Approximation algorithm and bounds
• A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints
• Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
• A Dual-Based Procedure for Uncapacitated Facility Location
• Database Location in Computer Networks
• An Algorithm for Large Zero-One Knapsack Problems
• On Optimal Allocation in a Distributed Processing Environment
• Topological design of centralized computer networks—formulations and algorithms
• A branch and bound algorithm for the generalized assignment problem
• An Efficient Algorithm for the 0-1 Knapsack Problem
• An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem
• Large-Scale Network Topological Optimization
• NEWCLUST: An Algorithm for the Topological Design of Two-Level, Multidrop Teleprocessing Networks
• An Improved Algorithm for the Capacitated Facility Location Problem
• Validation of subgradient optimization
• The Traveling-Salesman Problem and Minimum Spanning Trees

This page was built for publication: Efficient algorithms for the capacitated concentrator location problem