Author:
Armstrong Derek E.,Jacobson Sheldon H.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Management Science and Operations Research,Control and Optimization,Computer Science Applications
Reference21 articles.
1. Aarts E., Lenstra J.K. ed. (1997), Local Search in Combinatorial Optimization. John Wiley & Sons, Chichester
2. Armstrong D.E. (2002), A local search algorithm approach to analyzing the complexity of discrete optimization problems, Ph.D. Dissertation, University of Illinois, Urbana, IL
3. Armstrong D.E., Jacobson S.H. (2005), Data independent neighborhood functions and strict local optima. Discrete Applied Mathematics 143, 272–284
4. Armstrong D.E., Jacobson S.H. (2003), Studying the complexity of global verification for NP-hard discrete optimization problems. Journal of Global Optimization 27, 83–96
5. Ausiello G., D’Atri A., Protasi M. (1980), Structure preserving reductions among convex optimization problems. Journal of Computer and System Sciences 21, 136–153
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献