Maximal covering code multiplexing access telecommunication networks

DOI10.1016/S0377-2217(03)00381-3zbMath1065.90007OpenAlexW2076423439MaRDI QIDQ1876173

Javier Barbas, ángel G. Marín

Publication date: 16 August 2004

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(03)00381-3

zbMATH Keywords

Integer programmingLagrangian decompositionBranch and boundSet covering problemTelecommunicationsLarge scale optimizationGeneralized assignment problemCode division multiplexing access systems

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Communication networks in operations research (90B18) Communication theory (94A05)

Related Items (3)

A Survey of the Generalized Assignment Problem and Its Applications ⋮ Fuzzy covering location problems with different aggregation operators ⋮ Variable-fixing then subgradient optimization guided very large scale neighborhood search for the generalized assignment problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving large scale generalized assignment problems. --- An aggregation/disaggregation approach
• A comparison of heuristics and relaxations for the capacitated plant location problem
• A new Lagrangian relaxation approach to the generalized assignment problem
• A survey of algorithms for the generalized assignment problem
• Constrained multi-project planning problems: A Lagrangean decomposition approach
• A Lagrangean decomposition solution to a single line multiproduct scheduling problem
• Strategic facility location: A review
• Lagrangean/surrogate relaxation for generalized assignment problems
• A Multiplier Adjustment Method for the Generalized Assignment Problem
• Lagrangean decomposition: A model yielding stronger lagrangean bounds
• A Rigorous Computational Comparison of Alternative Solution Methods for the Generalized Assignment Problem
• Facility location and capacity acquisition: An integrated approach
• Rationalizing Tool Selection in a Flexible Manufacturing System for Sheet-Metal Products
• The stochastic generalised assignment problem with Bernoulli demands

This page was built for publication: Maximal covering code multiplexing access telecommunication networks