Optimal traffic assignment in a SS/TDMA frame : a new approach by set covering and column generation
From MaRDI portal
Publication:3748070
Recommendations
- A branch and price algorithm for the SS/TDMA problem with cardinality constraint
- Time-slot assignment for TDMA-systems
- A note on SS/TDMA satellite communication
- A heuristic for decomposing traffic matrices in TDMA satellite communication
- New bounds for optimum traffic assignment in satellite communication.
Cited in
(11)- Algorithms for large scale set covering problems
- On combined minmax-minsum optimization
- New bounds for optimum traffic assignment in satellite communication.
- An optimal column-generation-with-ranking algorithm for very large scale set partitioning problems in traffic assignment
- Solving combinatorial problems with combined min-max-min-sum objective and applications
- A branch and price algorithm for the SS/TDMA problem with cardinality constraint
- A heuristic for decomposing traffic matrices in TDMA satellite communication
- Column-Generation in Integer Linear Programming
- Comparison of column generation models for channel assignment in cellular networks
- An integer programming approach to the time slot assignment problem in SS/TDMA systems with intersatellite links
- Minimum deviation and balanced optimization: A unified approach
This page was built for publication: Optimal traffic assignment in a SS/TDMA frame : a new approach by set covering and column generation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3748070)