The Skiving Stock Problem and its Application to Cognitive Radio Networks**This work is partly supported by the German Research Foundation (DFG) in the Collaborative Research Center 912 "Highly Adaptive Energy-Efficient Computing".-Reference-Cited by-同舟云学术

The Skiving Stock Problem and its Application to Cognitive Radio Networks**This work is partly supported by the German Research Foundation (DFG) in the Collaborative Research Center 912 "Highly Adaptive Energy-Efficient Computing".

Published:2016 Issue:12 Volume:49 Page:99-104
ISSN:2405-8963
Container-title:IFAC-PapersOnLine
language:en
Short-container-title:IFAC-PapersOnLine

Author:

Martinovic John,Jorswieck Eduard,Scheithauer Guntram

Publisher

Elsevier BV

Subject

Control and Systems Engineering

Reference23 articles.

1. A hybrid improvement heuristic for the one-dimensional bin packing problem;Alvim;Journal of Heuristics,2004

2. On a dual version of the one-dimensional bin packing problem;Assmann;Journal of Algorithms,1984

3. Spectrum bonding and aggregation with guard-band-awareness in cognitive radio networks;Bany Salameh;IEEE Transactions on Mobile Computing,2014

4. A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting;Belov;European Journal of Operational Research,2006

5. Campello, J. (1998). Optimal discrete bit loading for multicarrier modulation systems. In Proceedings of the IEEE International Symposium on Information Theory, pp. 193.

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Two-Phase Pattern Generation and Production Planning Procedure for the Stochastic Skiving Process;Applied Computational Intelligence and Soft Computing;2023-11-06

2. Solution approaches for the bi-objective Skiving Stock Problem;Computers & Industrial Engineering;2023-05

3. A branch-and-price approach to a variant of the cognitive radio resource allocation problem;Ad Hoc Networks;2022-07

4. Dividing Splittable Goods Evenly and With Limited Fragmentation;Algorithmica;2019-10-25

5. An upper bound of Δ(E)<3∕2 for skiving stock instances of the divisible case;Discrete Applied Mathematics;2017-10