Author:
Deı˘neko Vladimir G.,Woeginger Gerhard J.
Subject
Applied Mathematics,Industrial and Manufacturing Engineering,Management Science and Operations Research,Software
Reference8 articles.
1. H. Aissi, C. Bazgan, D. Vanderpooten, Complexity of the min–max and min–max regret assignment problems, Oper. Res. Lett. (2005), to appear.
2. Exact arborescences, matchings, and cycles;Barahona;Discrete Appl. Math.,1987
3. A.V. Karzanov, Maximum matching of given weight in complete and complete bipartite graphs, Cybernetics 23 (1987) 8–13; translation from Kibernetika 1 (1987) 7–11.
4. Robust Discrete Optimization and its Applications;Kouvelis,1997
5. M. Leclerc, Polynomial time algorithms for exact matching problems, Master's Thesis, University of Waterloo, Waterloo, 1986.
Cited by
24 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献