Combinatorial optimization problems in wireless switch design

DOI10.1007/s10288-006-0025-1zbMath1160.90645OpenAlexW2080098127MaRDI QIDQ926564

Renaud Sirdey

Publication date: 20 May 2008

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10288-006-0025-1

zbMATH Keywords

combinatorial optimizationOR in telecommunications

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Communication networks in operations research (90B18) Combinatorial optimization (90C27)

Related Items

Approximation schemes for the generalized extensible bin packing problem, Models and algorithms for the reconfiguration of distributed wireless switching systems

Uses Software

• Knapsack

Cites Work

• Unnamed Item
• Unnamed Item
• A 13/12 approximation algorithm for bin packing with extendable bins
• Geometric algorithms and combinatorial optimization
• Approximation algorithms for partitioning small items in unequal bins to minimize the total size
• Combinatorial Optimization. Polyhedra and efficiency. CD-ROM
• On a resource-constrained scheduling problem with application to distributed systems reconfiguration
• The Power of Dominance Relations in Branch-and-Bound Algorithms
• On the Max-Min 0-1 Knapsack Problem with Robust Optimization Applications
• Combinatorial optimization. Theory and algorithms