Author:
Moon Chiung,Kim Jongsoo,Choi Gyunghyun,Seo Yoonho
Subject
Information Systems and Management,Management Science and Operations Research,Modelling and Simulation,General Computer Science,Industrial and Manufacturing Engineering
Reference21 articles.
1. Some new branching and bounding criteria for the asymmetric traveling salesman problem;Carpaneto;Management Science,1980
2. M. Gen, R. Cheng, Interval programming using genetic algorithms, in: Proceedings of the First International Symposium on Soft Computing for Industry, 1996, pp. 113–116
3. Genetic Algorithms and Engineering Design;Gen,1997
4. A travelling salesman problem with allocation time window and precedence constraints an application to ship scheduling;Fagerholt;International Transactions in Operational Research,2000
5. An additive bounding procedure for combinatorial optimization problems;Fischetti;Operations Research,1989
Cited by
149 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献