Combinatorial optimization problems in wireless switch design
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- A 13/12 approximation algorithm for bin packing with extendable bins
- Approximation algorithms for partitioning small items in unequal bins to minimize the total size
- Combinatorial Optimization. Polyhedra and efficiency. CD-ROM
- Combinatorial optimization. Theory and algorithms
- Geometric algorithms and combinatorial optimization
- On a resource-constrained scheduling problem with application to distributed systems reconfiguration
- On the Max-Min 0-1 Knapsack Problem with Robust Optimization Applications
- The Power of Dominance Relations in Branch-and-Bound Algorithms
Cited in
(6)- scientific article; zbMATH DE number 2050768 (Why is no real title available?)
- Approximation schemes for the generalized extensible bin packing problem
- Combinatorial Optimization Problems with Soft and Hard Requirements
- Combinatorial optimization algorithms for radio network planning
- Combinatorial optimization in system configuration design
- Models and algorithms for the reconfiguration of distributed wireless switching systems
This page was built for publication: Combinatorial optimization problems in wireless switch design
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q926564)