Maximal covering code multiplexing access telecommunication networks

DOI10.1016/S0377-2217(03)00381-3MaRDI QIDQ1876173zbMATH OpenOpenAlexFDO

Authors Javier Barbas, Angel 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

Lagrangian decompositionTelecommunicationsInteger programmingBranch and boundLarge scale optimizationGeneralized assignment problemSet covering problemCode division multiplexing access systems

Mathematics Subject Classification ID

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

Recommendations

• A multi-period network design problem for cellular telecommunication systems
• Robust tower location for code division multiple access networks
• A Decomposition Algorithm for Local Access Telecommunications Network Expansion Planning
• scientific article; zbMATH DE number 5173825
• Model and heuristic for a generalized access network design problem

Cites work

• scientific article; zbMATH DE number 44281 (Why is no real title available?)
• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 1253041 (Why is no real title available?)
• scientific article; zbMATH DE number 821272 (Why is no real title available?)
• A Lagrangean decomposition solution to a single line multiproduct scheduling problem
• A Multiplier Adjustment Method for the Generalized Assignment Problem
• A Rigorous Computational Comparison of Alternative Solution Methods for the Generalized Assignment Problem
• 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
• Facility location and capacity acquisition: An integrated approach
• Lagrangean decomposition: A model yielding stronger lagrangean bounds
• Lagrangean/surrogate relaxation for generalized assignment problems
• Rationalizing Tool Selection in a Flexible Manufacturing System for Sheet-Metal Products
• Solving large scale generalized assignment problems. --- An aggregation/disaggregation approach
• Strategic facility location: A review
• The stochastic generalised assignment problem with Bernoulli demands

Cited in

(3)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1876173)