Abstract
We discuss the time slot assignment problem in satellite communication. First we derive an optimal solution of the corresponding mathematical problem which, however, will turn out to be impracticable. Then we consider a modified problem, but this is NP-hard. We describe some heuristics for this modified problem. Then we treat the problem that onboard the satellite the class of switch-modes is fixed. We state an 0(n3) method for solving this problem. Finally we comment on some extensions of switch-modes and on other nonlinear partitioning problems.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
