Subject
Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering
Reference34 articles.
1. A branch & cut algorithm for the asymmetric traveling salesman problem with precedence constraints;Ascheuer;Computational Optimization and Applications,2000
2. Edge-disjoint in- and out-branchings in tournaments and related path problems;Bang-Jensen;Journal of Combinatorial Theory - Series B,1991
3. A linear-time algorithm to find a pair of arc-disjoint spanning in-arborescence and out-arborescence in a directed acyclic graph;Bérczi;Information Processing Letters,2009
4. An algorithm to construct a minimum directed spanning tree in a directed network;Bock;Developments in Operations Research,1971
5. Towards de novo identification of metabolites by analyzing tandem mass spectra;Böcker,2008
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献