A branch and price algorithm for the SS/TDMA problem with cardinality constraint

DOI10.1016/J.COR.2012.08.010zbMATH Open1349.90079OpenAlexW2049946341MaRDI QIDQ340262FDOQ340262

Fabio Colombo, Marco Trubian

Publication date: 14 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2012.08.010

Recommendations

• Optimal traffic assignment in a SS/TDMA frame : a new approach by set covering and column generation
• SS/TDMA Satellite Communications withk-Permutation Switching Modes
• A note on SS/TDMA satellite communication
• A Polynomial Time Optimal Algorithm for Satellite-Switched Time-Division Multiple Access Satellite Communications with General Switching Modes
• New bounds for optimum traffic assignment in satellite communication.

zbMATH Keywords

combinatorial optimizationbranch and pricesatellite communicationsSS/TDMA

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06)

Cited In (6)

• New bounds for optimum traffic assignment in satellite communication.
• Quasi-optimal resource allocation in multispot MFTDMA satellite networks
• An integer programming approach to the time slot assignment problem in SS/TDMA systems with intersatellite links
• SS/TDMA Satellite Communications withk-Permutation Switching Modes
• A heuristic for decomposing traffic matrices in TDMA satellite communication
• Optimal traffic assignment in a SS/TDMA frame : a new approach by set covering and column generation

This page was built for publication: A branch and price algorithm for the SS/TDMA problem with cardinality constraint

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