K best solutions to combinatorial optimization problems-Reference-Cited by-同舟云学术

K best solutions to combinatorial optimization problems

Published:1985-12 Issue:1 Volume:4 Page:123-143
ISSN:0254-5330
Container-title:Annals of Operations Research
language:en
Short-container-title:Ann Oper Res

Author:

Hamacher H. W.,Queyranne M.

Publisher

Springer Science and Business Media LLC

Subject

Management Science and Operations Research,General Decision Sciences

Link

http://link.springer.com/content/pdf/10.1007/BF02022039.pdf

Reference32 articles.

1. C. Berge,Graphes et Hypergraphes, 2nd Edition (Dunod, Paris, 1973).

2. R.E. Burkard and U. Zimmermann, Combinatorial optimization in linearly ordered semimodules: A survey, in:Modern Applied Mathematics: Optimization and Operations Research, ed. B. Korte (North-Holland, Amsterdam, 1982), p. 391.

3. P.M. Camerini, L. Fratta and F. Maffioli, TheK shortest spanning trees of a graph, Int. Rep. 73–10, IEE-LCE, Politeonico di Milano (1973).

4. P.M. Camerini, L. Fratta and F. Maffioli, Efficient methods for ranking trees,Proc. 3rd Int. Symposium on Network Theory, Split, Yugoslavia (1975) p. 419.

5. P.M. Camerini, L. Fratta and F. Maffioli, Ranking arborescences inO(K m logn) time,Eur. J. Oper. Res. 4(1980)235.

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

1. Everything there is to Know about Stochastically Known Logs;2023 5th International Conference on Process Mining (ICPM);2023-10-23

2. CBSS: A New Approach for Multiagent Combinatorial Path Finding;IEEE Transactions on Robotics;2023-08

3. Heuristic shortest hyperpaths in cell signaling hypergraphs;Algorithms for Molecular Biology;2022-05-26

4. BRANCHING TECHNIQUE FOR A BI-OBJECTIVE TWO-STAGE ASSIGNMENT PROBLEM;The ANZIAM Journal;2022-04

5. The Kth TSP is pseudopolynomial when TSP is polynomial;Discrete Mathematics, Algorithms and Applications;2018-10