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

DOI10.1016/J.COR.2012.08.010zbMath1349.90079OpenAlexW2049946341MaRDI QIDQ340262

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

zbMATH Keywords

combinatorial optimizationSS/TDMAsatellite communicationsbranch and price

Mathematics Subject Classification ID

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

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