Author:
Arbib Claudio,Felici Giovanni,Servilio Mara,Ventura Paolo
Publisher
Springer International Publishing
Reference11 articles.
1. Arbib, C., Labbé, M., Servilio, M.: Scheduling two chains of unit jobs on one machine: a polyhedral study. Networks 58(2), 103–113 (2011)
2. Arbib, C., Servilio, M., Ventura, P.: Improved integer linear programming formulations for the 0–1 closest string problem (2015, submitted)
3. Balas, E.: Facets of the knapsack polytope. Math. Program. 8, 146–164 (1975)
4. Chimani, M., Woste, M., Bocker, S.: A closer look at the closest string and closest substring problem. In: Proceedings of the 13th Workshop on Algorithm Engineering and Experiments – ALENE, pp. 13–24 (2011)
5. Della Croce, F., Giarraffa, M.: The selective fixing algorithm for the closest string problem. Comput. Oper. Res. 41, 24–30 (2014)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献