Author:
Huang Liqin,Tong Weitian,Goebel Randy,Liu Tian,Lin Guohui
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications
Reference19 articles.
1. Anstee RP (1987) A polynomial algorithm for $$b$$ b -matching: an alternative approach. Inf Process Lett 24:153–157
2. Arkin EM, Hassin R (1998) On local search for weighted packing problems. Math Oper Res 23:640–648
3. Babayev DA, Bell GI, Nuriyev UG (2009) The bandpass problem: combinatorial optimization and library of problems. J Comb Optim 18:151–172
4. Bell GI, Babayev DA (2004) Bandpass problem. In: Annual INFORMS meeting, Denver, CO, USA, October 2004
5. Chandra B, Halldórsson MM (1999) Greedy local improvement and weighted set packing approximation. In: ACM–SIAM proceedings of the tenth annual symposium on discrete algorithms (SODA’99), pp 169–176
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. ON THE COMPLEXITY OF THE BANDPASS PROBLEM;Turkic World Mathematical Society (TWMS) Journal of Pure and Applied Mathematics;2023
2. The band collocation problem;Journal of Combinatorial Optimization;2020-06-01
3. New heuristics and meta-heuristics for the Bandpass problem;Engineering Science and Technology, an International Journal;2017-12