The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems-Reference-Cited by-同舟云学术

The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems

Published:2016-12-10 Issue:3 Volume:68 Page:601-622
ISSN:0925-5001
Container-title:Journal of Global Optimization
language:en
Short-container-title:J Glob Optim

Author:

Turkensteen Marcel,Malyshev Dmitry,Goldengorin Boris,Pardalos Panos M.

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Management Science and Operations Research,Control and Optimization,Computer Science Applications

Link

http://link.springer.com/article/10.1007/s10898-016-0486-5/fulltext.html

Reference54 articles.

1. Achterberg, T., Koch, T., Martin, A.: Branching rules revisited. Oper. Res. Lett. 33(1), 42–54 (2004)

2. Almoustafa, S., Hanafi, S., Mladenovic, N.: New exact method for large asymmetric distance-constrained vehicle routing problem. Eur. J. Oper. Res. 226, 386–394 (2013)

3. Balas, E., Toth, P.: Branch and bound methods. In: Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B. (eds.) Chapter 10 of the Traveling Salesman Problem, pp. 361–401. Wiley, Chichester (1985)

4. Batsyn, M., Goldengorin, B.I., Kocheturov, A., Pardalos, P.M.: Tolerance-based versus cost-based branching for the asymmetric capacitated vehicle routing problem. In: Goldengorin, B.I. et al. (eds.) Models, Algorithms, and Technologies for Network Analysis. Proceedings in Mathematics and Statistics, vol. 59, Springer, Berlin (2013)

5. Bekker, H., Braad, E.P., Goldengorin, B.: Using bipartite and multidimensional matching to select the roots of a system of polynomial equations. Lect. Notes Comput. Sci. 3483, 397–406 (2005)

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

1. Knowledge granularity reduction for decision tables;International Journal of Machine Learning and Cybernetics;2021-01-14