Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
Skip header Section
Modern heuristic techniques for combinatorial problemsMay 1993
Publisher:
  • John Wiley & Sons, Inc.
  • 605 Third Ave. New York, NY
  • United States
ISBN:978-0-470-22079-5
Published:05 May 1993
Pages:
315
Skip Bibliometrics Section
Bibliometrics
Abstract

No abstract available.

Skip Table Of Content Section
chapter
Introduction
Pages 1–19
chapter
Simulated annealing
Pages 20–69
chapter
Tabu search
Pages 70–150
chapter
Genetic algorithms
Pages 151–196
chapter
Artificial neural networks
Pages 197–242
chapter
Lagrangian relaxation
Pages 243–303
chapter
Evaluation of heuristic performance
Pages 304–315

Cited By

  1. ACM
    Li W (2024). Optimizing with Attractor: A Tutorial, ACM Computing Surveys, 56:9, (1-41), Online publication date: 31-Oct-2024.
  2. Venieris S, Almeida M, Lee R and Lane N (2024). NAWQ-SR: A Hybrid-Precision NPU Engine for Efficient On-Device Super-Resolution, IEEE Transactions on Mobile Computing, 23:3, (2367-2381), Online publication date: 1-Mar-2024.
  3. ACM
    Antonyshyn L, Silveira J, Givigi S and Marshall J (2023). Multiple Mobile Robot Task and Motion Planning: A Survey, ACM Computing Surveys, 55:10, (1-35), Online publication date: 31-Oct-2023.
  4. Nájera V, Ortega J, Collazos Morales C and Roblero Aguilar S From Selecting Best Algorithm to Explaining Why It is: A General Review, Formal Problem Statement and Guidelines Towards to an Empirical Generalization Computational Science and Its Applications – ICCSA 2023, (694-712)
  5. Keskin M and Triki C (2022). On the periodic hierarchical Chinese postman problem, Soft Computing - A Fusion of Foundations, Methodologies and Applications, 26:2, (709-724), Online publication date: 1-Jan-2022.
  6. Tkach I and Amador S (2021). Towards addressing dynamic multi-agent task allocation in law enforcement, Autonomous Agents and Multi-Agent Systems, 35:1, Online publication date: 1-Apr-2021.
  7. Pradhan D, Wang S, Ali S, Yue T and Liaaen M (2021). CBGA-ES+: A Cluster-Based Genetic Algorithm with Non-Dominated Elitist Selection for Supporting Multi-Objective Test Optimization, IEEE Transactions on Software Engineering, 47:1, (86-107), Online publication date: 1-Jan-2021.
  8. Farsa D and Rahnamayan S Discrete Coordinate Descent (DCD) 2020 IEEE International Conference on Systems, Man, and Cybernetics (SMC), (184-190)
  9. ACM
    Qin Z, Qin Y and Li Y Genetic Algorithm (GA)-Based Detection for Coded Partial-Response Channels Proceedings of the 2020 3rd International Conference on Machine Learning and Machine Intelligence, (95-99)
  10. Shylo V, Glybovets M, Gulayeva N and Nikishchikhina K (2020). Genetic Algorithm of Tournament Crowding Based on Gaussian Mutation, Cybernetics and Systems Analysis, 56:2, (231-242), Online publication date: 1-Mar-2020.
  11. Battaglia F, Cucina D and Rizzo M (2019). Parsimonious periodic autoregressive models for time series with evolving trend and seasonality, Statistics and Computing, 30:1, (77-91), Online publication date: 1-Feb-2020.
  12. ACM
    Venieris S, Kouris A and Bouganis C (2018). Toolflows for Mapping Convolutional Neural Networks on FPGAs, ACM Computing Surveys, 51:3, (1-39), Online publication date: 31-May-2019.
  13. Zhang J, Ding G, Zou Y, Qin S and Fu J (2019). Review of job shop scheduling research and its new perspectives under Industry 4.0, Journal of Intelligent Manufacturing, 30:4, (1809-1830), Online publication date: 1-Apr-2019.
  14. Rodríguez-Molina A, Villarreal-Cervantes M and Aldape-Pérez M (2019). An adaptive control study for the DC motor using meta-heuristic algorithms, Soft Computing - A Fusion of Foundations, Methodologies and Applications, 23:3, (889-906), Online publication date: 1-Feb-2019.
  15. (2019). A hybridised feature selection approach in molecular classification using CSO and GA, International Journal of Computer Applications in Technology, 59:2, (165-174), Online publication date: 1-Jan-2019.
  16. Sourek G, Zelezny F and Keller J (2019). Efficient Extraction of Network Event Types from NetFlows, Security and Communication Networks, 2019, Online publication date: 1-Jan-2019.
  17. ACM
    Sürer Ö, Burke R and Malthouse E Multistakeholder recommendation with provider constraints Proceedings of the 12th ACM Conference on Recommender Systems, (54-62)
  18. Yajnanarayana V, Magnusson K, Brandt R, Dwivedi S and Händel P (2017). Optimal Scheduling for Interference Mitigation by Range Information, IEEE Transactions on Mobile Computing, 16:11, (3167-3181), Online publication date: 1-Nov-2017.
  19. Khari M and Kumar P (2017). Empirical Evaluation of Hill Climbing Algorithm, International Journal of Applied Metaheuristic Computing, 8:4, (27-40), Online publication date: 1-Oct-2017.
  20. Zivan R, Parash T, Cohen L, Peled H and Okamoto S (2017). Balancing exploration and exploitation in incomplete Min/Max-sum inference for distributed constraint optimization, Autonomous Agents and Multi-Agent Systems, 31:5, (1165-1207), Online publication date: 1-Sep-2017.
  21. Spavieri G, Ferreira R, Fernandes R, Lage G, Barbosa D and Oleskovicz M (2017). Particle Swarm Optimization-based approach for parameterization of power capacitor models fed by harmonic voltages, Applied Soft Computing, 56:C, (55-64), Online publication date: 1-Jul-2017.
  22. Amador Nelke S and Zivan R Incentivizing Cooperation between Heterogeneous Agents in Dynamic Task Allocation Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, (1082-1090)
  23. Liu C, Huang H, Du H and Jia X (2017). Optimal RSUs placement with delay bounded message dissemination in vehicular networks, Journal of Combinatorial Optimization, 33:4, (1276-1299), Online publication date: 1-May-2017.
  24. Zhang X, Zou J, He K and Sun J (2016). Accelerating Very Deep Convolutional Networks for Classification and Detection, IEEE Transactions on Pattern Analysis and Machine Intelligence, 38:10, (1943-1955), Online publication date: 1-Oct-2016.
  25. Hao D, Zhang L and Mei H (2016). Test-case prioritization, Frontiers of Computer Science: Selected Publications from Chinese Universities, 10:5, (769-777), Online publication date: 1-Oct-2016.
  26. Weskida M and Michalski R Evolutionary algorithm for seed selection in social influence process Proceedings of the 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, (1189-1196)
  27. Erbeyoğlu G and Bilge Ü (2016). PSO-based and SA-based metaheuristics for bilinear programming problems, Journal of Heuristics, 22:2, (147-179), Online publication date: 1-Apr-2016.
  28. Furuhata M, Daniel K, Koenig S, Ordonez F, Dessouky M, Brunet M, Cohen L and Xiaoqing Wang (2015). Online Cost-Sharing Mechanism Design for Demand-Responsive Transport Systems, IEEE Transactions on Intelligent Transportation Systems, 16:2, (692-707), Online publication date: 1-Apr-2015.
  29. Bodenstein C and Zimmermann A TimeNET optimization environment Proceedings of the 8th International Conference on Performance Evaluation Methodologies and Tools, (129-133)
  30. Wu G, Lin T, Huang H, Chu C and Beerel P Asynchronous circuit placement by lagrangian relaxation Proceedings of the 2014 IEEE/ACM International Conference on Computer-Aided Design, (641-646)
  31. Tsai C, Lai C and Vasilakos A (2014). Future Internet of Things, Wireless Networks, 20:8, (2201-2217), Online publication date: 1-Nov-2014.
  32. Lau H, Ho G, Chan T and Tsui W (2014). An innovation approach for achieving cost optimization in supply chain management, Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology, 26:1, (173-192), Online publication date: 1-Jan-2014.
  33. Nowodzinski A, Koszalka L, Pozniak-Koszalka I and Kasprzak A Exploding Balls Principle as a Method of Global Optimization Proceedings of the 5th International Conference on Computational Collective Intelligence. Technologies and Applications - Volume 8083, (388-398)
  34. ACM
    Mars J and Tang L (2013). Whare-map, ACM SIGARCH Computer Architecture News, 41:3, (619-630), Online publication date: 26-Jun-2013.
  35. ACM
    Mars J and Tang L Whare-map Proceedings of the 40th Annual International Symposium on Computer Architecture, (619-630)
  36. de Oliveira R, Carminati A and Starke R (2013). On using adversary simulators to evaluate global fixed-priority and FPZL scheduling of multiprocessors, Journal of Systems and Software, 86:2, (403-411), Online publication date: 1-Feb-2013.
  37. Blum C Hybrid metaheuristics in combinatorial optimization Proceedings of the First international conference on Theory and Practice of Natural Computing, (1-10)
  38. ACM
    Izosimov V, Pop P, Eles P and Peng Z (2012). Scheduling and Optimization of Fault-Tolerant Embedded Systems with Transparency/Performance Trade-Offs, ACM Transactions on Embedded Computing Systems, 11:3, (1-35), Online publication date: 1-Sep-2012.
  39. ACM
    de Oliveira R, Carminati A and Starke R On using adversary simulators to obtain tight lower bounds for response times Proceedings of the 27th Annual ACM Symposium on Applied Computing, (1573-1579)
  40. Gallego L, Rider M, Lavorato M and Paldilha-Feltrin A (2012). An enhanced genetic algorithm to solve the static and multistage transmission network expansion planning, Journal of Electrical and Computer Engineering, 2012, (5-5), Online publication date: 1-Jan-2012.
  41. Blum C, Puchinger J, Raidl G and Roli A (2011). Hybrid metaheuristics in combinatorial optimization, Applied Soft Computing, 11:6, (4135-4151), Online publication date: 1-Sep-2011.
  42. ACM
    da Luz A, da Costa E and de Aguiar M Exploring the use of heuristic-based algorithms for the ordering and partitioning of coefficients for power efficient fir filters realization Proceedings of the 24th symposium on Integrated circuits and systems design, (91-96)
  43. Raveaux R, Adam S, Héroux P and Trupin í (2011). Learning graph prototypes for shape recognition, Computer Vision and Image Understanding, 115:7, (905-918), Online publication date: 1-Jul-2011.
  44. Cruz-Reyes L, Gómez-Santillán C, Schaeffer S, Quiroz-Castellanos M, Alvarez-Hernández V and Pérez-Rosas V Enhancing accuracy of hybrid packing systems through general-purpose characterization Proceedings of the 6th international conference on Hybrid artificial intelligent systems - Volume Part II, (26-33)
  45. RäIhä O (2010). Survey, Computer Science Review, 4:4, (203-249), Online publication date: 1-Nov-2010.
  46. ACM
    Lifa A, Eles P, Peng Z and Izosimov V Hardware/software optimization of error detection implementation for real-time embedded systems Proceedings of the eighth IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis, (41-50)
  47. Tenorio E, Gómez-Ruiz J, Peláez J and Doña J A genetic algorithm to design industrial materials Proceedings of the 14th international conference on Knowledge-based and intelligent information and engineering systems: Part III, (445-454)
  48. ACM
    da Luz A, da Costa E and de Aguiar M Ordering and partitioning of coefficients based on heuristic algorithms for low power FIR filter realization Proceedings of the 23rd symposium on Integrated circuits and system design, (180-185)
  49. Xavier A (2010). The hyperbolic smoothing clustering method, Pattern Recognition, 43:3, (731-737), Online publication date: 1-Mar-2010.
  50. Koike-Akino T, Devroye N and Tarokh V (2009). Frequency-domain bit-flipping equalizer for wideband MIMO channels, IEEE Transactions on Wireless Communications, 8:10, (4969-4973), Online publication date: 1-Oct-2009.
  51. Kung L and Chern C (2009). Heuristic factory planning algorithm for advanced planning and scheduling, Computers and Operations Research, 36:9, (2513-2530), Online publication date: 1-Sep-2009.
  52. ACM
    Zhang L, Hou S, Guo C, Xie T and Mei H Time-aware test-case prioritization using integer linear programming Proceedings of the eighteenth international symposium on Software testing and analysis, (213-224)
  53. Patankar R, Xu R, Chen H and Patterson D (2009). Global search algorithm for automated maintenance planning and scheduling of parts requests, Computers and Operations Research, 36:6, (1751-1757), Online publication date: 1-Jun-2009.
  54. Samii S, Cervin A, Eles P and Peng Z Integrated scheduling and synthesis of control applications on distributed embedded systems Proceedings of the Conference on Design, Automation and Test in Europe, (57-62)
  55. Ota J (2009). Goal state optimization algorithm considering computational resource constraints and uncertainty in task execution time, Robotics and Autonomous Systems, 57:4, (403-410), Online publication date: 1-Apr-2009.
  56. Soleimani H, Golmakani H and Salimi M (2009). Markowitz-based portfolio selection with minimum transaction lots, cardinality constraints and regarding sector capitalization using genetic algorithm, Expert Systems with Applications: An International Journal, 36:3, (5058-5063), Online publication date: 1-Apr-2009.
  57. Khorram E and Zarei H (2009). Multi-objective optimization problems with Fuzzy relation equation constraints regarding max-average composition, Mathematical and Computer Modelling: An International Journal, 49:5-6, (856-867), Online publication date: 1-Mar-2009.
  58. Qu R, Burke E, Mccollum B, Merlot L and Lee S (2009). A survey of search methodologies and automated system development for examination timetabling, Journal of Scheduling, 12:1, (55-89), Online publication date: 1-Feb-2009.
  59. Sekozawa T and Fukumoto T (2008). Model of optimal paths design for GMPLS network and evaluation of solution, WSEAS TRANSACTIONS on SYSTEMS, 7:11, (1339-1348), Online publication date: 1-Nov-2008.
  60. England B and Daniels K A partition-based heuristic for translational box covering Proceedings of the 12th WSEAS international conference on Computers, (542-550)
  61. Sekozawa T and Fukumoto T Model of optimal paths design for GMPLS network and algorithm based on Lagrangian relaxation method Proceedings of the 12th WSEAS international conference on Systems, (401-406)
  62. Šeda M Flow shop scheduling and its extension to fuzzy processing times Proceedings of the 9th WSEAS International Conference on Fuzzy Systems, (219-224)
  63. ACM
    Samii S, Rafiliu S, Eles P and Peng Z A simulation methodology for worst-case response time estimation of distributed real-time systems Proceedings of the conference on Design, automation and test in Europe, (556-561)
  64. Zhan Y and Clark J (2008). A search-based framework for automatic testing of MATLAB/Simulink models, Journal of Systems and Software, 81:2, (262-285), Online publication date: 1-Feb-2008.
  65. Magaña E, Lefevre L, Hasan M and Serrat J SNMP-based monitoring agents and heuristic scheduling for large-scale grids Proceedings of the 2007 OTM confederated international conference on On the move to meaningful internet systems: CoopIS, DOA, ODBASE, GADA, and IS - Volume Part II, (1367-1384)
  66. Magaña E, Lefevre L, Hasan M and Serrat J SNMP-Based Monitoring Agents and Heuristic Scheduling for Large-Scale Grids On the Move to Meaningful Internet Systems 2007: CoopIS, DOA, ODBASE, GADA, and IS, (1367-1384)
  67. González F and Belanche L A Thermodynamical Search Algorithm for Feature Subset Selection Neural Information Processing, (683-692)
  68. Anghinolfi D and Paolucci M (2007). Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach, Computers and Operations Research, 34:11, (3471-3490), Online publication date: 1-Nov-2007.
  69. Šeda M An implementation view on job shop scheduling based on CPM Proceedings of the 11th WSEAS International Conference on Computers, (542-547)
  70. Virginas B, Ursu M, Tsang E, Owusu G and Voudouris C Intelligent Resource Allocation---Solutions and Pathways in a Workforce Planning Problem Proceedings of the 1st KES International Symposium on Agent and Multi-Agent Systems: Technologies and Applications, (395-404)
  71. Grunske L, Lindsay P, Bondarev E, Papadopoulos Y and Parker D An outline of an architecture-based method for optimizing dependability attributes of software-intensive systems Architecting dependable systems IV, (188-209)
  72. Quadt D Simulation-based scheduling of parallel wire-bonders with limited clamp&paddles Proceedings of the 38th conference on Winter simulation, (1887-1892)
  73. Charon I and Hudry O (2006). A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments, Discrete Applied Mathematics, 154:15, (2097-2116), Online publication date: 1-Oct-2006.
  74. Kim K, Choi Y and Chung W An electronic brokering process for truckload freight Proceedings of the Second international conference on Advances in Natural Computation - Volume Part II, (829-838)
  75. Tasan A A two step approach for the integrated production and distribution planning of a supply chain Proceedings of the 2006 international conference on Intelligent Computing - Volume Part I, (883-888)
  76. Šeda M Solving resource-constrained project scheduling problem as a sequence of multi-knapsack problems Proceedings of the 10th WSEAS international conference on Computers, (80-86)
  77. ACM
    Zhan Y and Clark J The state problem for test generation in Simulink Proceedings of the 8th annual conference on Genetic and evolutionary computation, (1941-1948)
  78. Geiger C, Uzsoy R and Aytug H (2006). Rapid Modeling and Discovery of Priority Dispatching Rules, Journal of Scheduling, 9:1, (7-34), Online publication date: 1-Feb-2006.
  79. Ferentinos K (2005). Biological engineering applications of feedforward neural networks designed and parameterized by genetic algorithms, Neural Networks, 18:7, (934-950), Online publication date: 1-Sep-2005.
  80. ACM
    Sureka A and Wurman P Applying metaheuristic techniques to search the space of bidding strategies in combinatorial auctions Proceedings of the 7th annual conference on Genetic and evolutionary computation, (2097-2103)
  81. ACM
    Zhan Y and Clark J Search-based mutation testing for Simulink models Proceedings of the 7th annual conference on Genetic and evolutionary computation, (1061-1068)
  82. ACM
    Yoon Y, Kim Y and Moon B An evolutionary lagrangian method for the 0/1 multiple knapsack problem Proceedings of the 7th annual conference on Genetic and evolutionary computation, (629-635)
  83. Mohamed A, Peng Z and Eles P (2005). A wiring-aware approach to minimizing built-in self-test overhead, Journal of Computer Science and Technology, 20:2, (216-223), Online publication date: 1-Mar-2005.
  84. Momenai A and Talebi S A fast evolutionary algorithm in codebook design Proceedings of the 4th WSEAS International Conference on Artificial Intelligence, Knowledge Engineering Data Bases, (1-6)
  85. Bouyssounouse B and Sifakis J Computing platforms Embedded Systems Design, (388-449)
  86. Poranen T (2005). Heuristics for the Maximum Outerplanar Subgraph Problem, Journal of Heuristics, 11:1, (59-88), Online publication date: 1-Jan-2005.
  87. Ying K and Liao C (2004). An ant colony system for permutation flow-shop sequencing, Computers and Operations Research, 31:5, (791-801), Online publication date: 20-Apr-2004.
  88. Hifi M and M'Hallah R (2004). Approximate algorithms for constrained circular cutting problems, Computers and Operations Research, 31:5, (675-694), Online publication date: 20-Apr-2004.
  89. Pop P, Eles P and Peng Z (2004). Schedulability-Driven Communication Synthesis for Time Triggered Embedded Systems, Real-Time Systems, 26:3, (297-325), Online publication date: 1-Apr-2004.
  90. Boryczka U and Boryczka M Multi-cast ant colony system for the bus routing problem Metaheuristics, (91-125)
  91. References Grid resource management, (507-566)
  92. Burke E, Kendall G and Soubeiga E (2003). A Tabu-Search Hyperheuristic for Timetabling and Rostering, Journal of Heuristics, 9:6, (451-470), Online publication date: 1-Dec-2003.
  93. Cochrane E and Beasley J (2003). The co-adaptive neural network approach to the Euclidean travelling salesman problem, Neural Networks, 16:10, (1499-1525), Online publication date: 1-Dec-2003.
  94. Liaw C (2003). An efficient tabu search approach for the two-machine preemptive open shop scheduling problem, Computers and Operations Research, 30:14, (2081-2095), Online publication date: 1-Dec-2003.
  95. Mazzini F, Mateus G and Smith J (2003). Lagrangean based methods for solving large-scale cellular network design problems, Wireless Networks, 9:6, (659-672), Online publication date: 1-Nov-2003.
  96. Chang C and Lee Z (2003). Applying the double side method of weighted residual for solving circle plate large deformation problems, Applied Mathematics and Computation, 141:2-3, (477-490), Online publication date: 5-Sep-2003.
  97. ACM
    Blum C and Roli A (2003). Metaheuristics in combinatorial optimization, ACM Computing Surveys, 35:3, (268-308), Online publication date: 1-Sep-2003.
  98. Challou D, Gini M, Kumar V and Karypis G (2003). Predicting the Performance of Randomized Parallel Search, Journal of Intelligent and Robotic Systems, 38:1, (31-53), Online publication date: 1-Sep-2003.
  99. Christofides S, Christofides A and Christofides N (2003). The design of corporate tax structures, Mathematical Programming: Series A and B, 98:1-3, (493-510), Online publication date: 1-Sep-2003.
  100. Kimbrough S, Lu M, Wood D and Wu D Exploring a two-population genetic algorithm Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI, (1148-1159)
  101. Fleischer M The measure of Pareto optima applications to multi-objective metaheuristics Proceedings of the 2nd international conference on Evolutionary multi-criterion optimization, (519-533)
  102. ACM
    Abdellatif-Kaddour O, Thévenod-Fosse P and Waeselynck H Property-oriented testing Proceedings of the 2003 ACM symposium on Applied computing, (1128-1134)
  103. Chen C, Hung C and Lee Z (2002). Double side approach method to obtain solutions for transient nonlinear heat conduction using genetic algorithms, Applied Mathematics and Computation, 133:2-3, (431-444), Online publication date: 15-Dec-2002.
  104. (2002). Extending an Algebraic Modeling Language to Support Constraint Programming, INFORMS Journal on Computing, 14:4, (322-344), Online publication date: 1-Nov-2002.
  105. Talbi E (2002). A Taxonomy of Hybrid Metaheuristics, Journal of Heuristics, 8:5, (541-564), Online publication date: 1-Sep-2002.
  106. ACM
    Babanov A, Collins J and Gini M Risk and expectations in a-priori time allocation in multi-agent contracting Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 1, (53-60)
  107. Costa M, Hertz A and Mittaz M (2002). Bounds and Heuristics for the Shortest Capacitated Paths Problem, Journal of Heuristics, 8:4, (449-465), Online publication date: 1-Jul-2002.
  108. Trafalis T and Kasap S (2002). A novel metaheuristics approach for continuous global optimization, Journal of Global Optimization, 23:2, (171-190), Online publication date: 1-Jun-2002.
  109. Ferentinos K, Arvanitis K and Sigrimis N (2002). Heuristic optimization methods for motion planning of autonomous agricultural vehicles, Journal of Global Optimization, 23:2, (155-170), Online publication date: 1-Jun-2002.
  110. Alba E and Troya J (2002). Improving flexibility and efficiency by adding parallelism to genetic algorithms, Statistics and Computing, 12:2, (91-114), Online publication date: 1-Apr-2002.
  111. ACM
    Hurley S and Whitaker R An agent based approach to site selection for wireless networks Proceedings of the 2002 ACM symposium on Applied computing, (574-577)
  112. Gupta J, Hennig K and Werner F (2002). Local search heuristics for two-stage flow shop problems with secondary criterion, Computers and Operations Research, 29:2, (123-149), Online publication date: 1-Feb-2002.
  113. Czech Z and Czarnas P Parallel simulated annealing for the vehicle routing problem with time windows Proceedings of the 10th Euromicro conference on Parallel, distributed and network-based processing, (376-383)
  114. Gräf A and McKenney T Ensemble planning for digital audio broadcasting Handbook of wireless networks and mobile computing, (267-288)
  115. Sandalidis H and Stavroulakis P Heuristics for solving fixed-channel assignment problems Handbook of wireless networks and mobile computing, (51-70)
  116. Mérida-Casermeiro E, Galán-Marín G and Muñoz-Pérez J (2001). An Efficient Multivalued Hopfield Network for the Traveling Salesman Problem, Neural Processing Letters, 14:3, (203-216), Online publication date: 1-Dec-2001.
  117. Hopper E and Turton B (2001). A Review of the Application ofMeta-Heuristic Algorithms to 2D Strip Packing Problems, Artificial Intelligence Review, 16:4, (257-300), Online publication date: 1-Dec-2001.
  118. Krishnamoorthy M, Ernst A and Sharaiha Y (2001). Comparison of Algorithms for the Degree Constrained Minimum Spanning Tree, Journal of Heuristics, 7:6, (587-611), Online publication date: 1-Nov-2001.
  119. Saleh H and Dare P (2001). Effective Heuristics for the GPS Survey Network of Malta, Journal of Heuristics, 7:6, (533-549), Online publication date: 1-Nov-2001.
  120. French A, Robinson A and Wilson J (2001). Using a Hybrid Genetic-Algorithm/Branch and Bound Approach to Solve Feasibility and Optimization Integer Programming Problems, Journal of Heuristics, 7:6, (551-564), Online publication date: 1-Nov-2001.
  121. Ulrich D (2001). A Legacy Recalled and a Tradition Continued, Journal of Automated Reasoning, 27:2, (97-122), Online publication date: 1-Aug-2001.
  122. Robertson A (2001). A Set of Greedy Randomized Adaptive Local Search Procedure (GRASP) Implementations for the Multidimensional Assignment Problem, Computational Optimization and Applications, 19:2, (145-164), Online publication date: 1-Jul-2001.
  123. ACM
    Doboli A and Vemuri R Integrated high-level synthesis and power-net routing for digital design under switching noise constraints Proceedings of the 38th annual Design Automation Conference, (629-634)
  124. ACM
    Collins J and Gini M Exploring decision processes in multi-agent automated contracting Proceedings of the fifth international conference on Autonomous agents, (81-82)
  125. Doboli A Integrated hardware-software co-synthesis for design of embedded systems under power and latency constraints Proceedings of the conference on Design, automation and test in Europe, (612-619)
  126. Collins J, Bilot C, Gini M and Mobasher B (2001). Decision Processes in Agent-Based Automated Contracting, IEEE Internet Computing, 5:2, (61-72), Online publication date: 1-Mar-2001.
  127. Coy S, Golden B, Runger G and Wasil E (2001). Using Experimental Design to Find Effective Parameter Settings for Heuristics, Journal of Heuristics, 7:1, (77-97), Online publication date: 1-Jan-2001.
  128. Hanafi S (2001). On the Convergence of Tabu Search, Journal of Heuristics, 7:1, (47-58), Online publication date: 1-Jan-2001.
  129. Sullivan K and Jacobson S (2000). Ordinal Hill Climbing Algorithms for Discrete ManufacturingProcess Design Optimization Problems, Discrete Event Dynamic Systems, 10:4, (307-324), Online publication date: 1-Oct-2000.
  130. ACM
    Záruba G, Chlamtac I and Das S An integrated admission-degradation framework for optimizing real-time call mix in wireless cellular networks Proceedings of the 3rd ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems, (44-51)
  131. Gandibleux X and Freville A (2000). Tabu Search Based Procedure for Solving the 0-1 MultiObjective Knapsack Problem, Journal of Heuristics, 6:3, (361-383), Online publication date: 1-Aug-2000.
  132. ACM
    Collins J, Bilot C and Gini M Mixed-initiative decision support in agent-based automated contracting Proceedings of the fourth international conference on Autonomous agents, (247-254)
  133. Chelouah R and Siarry P (2000). A Continuous Genetic Algorithm Designed for the Global Optimization of Multimodal Functions, Journal of Heuristics, 6:2, (191-213), Online publication date: 1-Jun-2000.
  134. Armony M, Klincewicz J, Luss H and Rosenwein M (2000). Design of Stacked Self-Healing Rings Using a Genetic Algorithm, Journal of Heuristics, 6:1, (85-105), Online publication date: 1-Apr-2000.
  135. Caseau Y and Laburthe F (2000). Solving Various Weighted Matching Problems with Constraints, Constraints, 5:1/2, (141-160), Online publication date: 1-Jan-2000.
  136. Emden-Weinert T and Proksch M (1999). Best Practice Simulated Annealing for the Airline Crew Scheduling Problem, Journal of Heuristics, 5:4, (419-436), Online publication date: 1-Dec-1999.
  137. Pesant G and Gendreau M (1999). A Constraint Programming Framework for Local Search Methods, Journal of Heuristics, 5:3, (255-279), Online publication date: 1-Oct-1999.
  138. Tsang E (1999). A Glimpse of Constraint Satisfaction, Artificial Intelligence Review, 13:3, (215-227), Online publication date: 1-Jun-1999.
  139. Alves J, Ferreira J, Albuquerque C, Oliveira J, Ferreira J and Matos J FAFNER-Accelerating Nesting Problems with FPGAs Proceedings of the Seventh Annual IEEE Symposium on Field-Programmable Custom Computing Machines
  140. ACM
    Collins J, Tsvetovat M, Sundareswara R, van Tonder J, Gini M and Mobasher B Evaluating risk Proceedings of the third annual conference on Autonomous Agents, (350-351)
  141. Mcloone S and Irwin G (1999). A Variable Memory Quasi-Newton Training Algorithm, Neural Processing Letters, 9:1, (77-89), Online publication date: 1-Feb-1999.
  142. ACM
    Nicolici N and Al-Hashimi B Efficient BIST hardware insertion with low test application time for synthesized data paths Proceedings of the conference on Design, automation and test in Europe, (60-es)
  143. Chu P and Beasley J (1998). Constraint Handling in Genetic Algorithms, Journal of Heuristics, 4:4, (323-357), Online publication date: 1-Dec-1998.
  144. Balas E and Niehaus W (1998). Optimized Crossover-Based Genetic Algorithms for the Maximum Cardinality and Maximum Weight Clique Problems, Journal of Heuristics, 4:2, (107-122), Online publication date: 1-Jul-1998.
  145. Chu P and Beasley J (1998). A Genetic Algorithm for the Multidimensional Knapsack Problem, Journal of Heuristics, 4:1, (63-86), Online publication date: 1-Jun-1998.
  146. Steinmetz E, Collins J, Jamison S, Sundareswara R, Mobasher B and Gini M Bid Evaluation and Selection in the MAGNET Automated Contracting System Selected Papers from the First International Workshop on Agent Mediated Electronic Trading on Agent Mediated Electronic Commerce, (105-125)
  147. Vigo D and Maniezzo V (1997). A Genetic/Tabu Thresholding Hybrid Algorithm for the ProcessAllocation Problem, Journal of Heuristics, 3:2, (91-110), Online publication date: 1-Dec-1997.
  148. Poore A and Robertson A (1997). A New Lagrangian Relaxation Based Algorithm for a Class ofMultidimensional Assignment Problems, Computational Optimization and Applications, 8:2, (129-150), Online publication date: 1-Sep-1997.
  149. Aggarwal C, Orlin J and Tai R (1997). Optimized Crossover for the Independent Set Problem, Operations Research, 45:2, (226-234), Online publication date: 1-Apr-1997.
  150. Weinmann U, Bringmann O and Rosenstiel W Device selection for system partitioning Proceedings of the conference on European design automation, (2-7)
  151. Osman I (1995). Heuristics for the generalised assignment problem, OR Spectrum, 17:4, (211-225), Online publication date: 1-Dec-1995.
  152. Verhoeven M and Aarts E (1995). Parallel local search, Journal of Heuristics, 1:1, (43-65), Online publication date: 1-Sep-1995.
  153. Barr R, Golden B, Kelly J, Resende M and Stewart W (1995). Designing and reporting on computational experiments with heuristic methods, Journal of Heuristics, 1:1, (9-32), Online publication date: 1-Sep-1995.
  154. Sycara K and Miyashita K Case-based acquisition of user preferences for solution improvement in ill-structured domains Proceedings of the Twelfth AAAI National Conference on Artificial Intelligence, (44-49)
  155. Aladi J, Wagner C and Garibaldi J A Simplified Method of FOU Design Utlising Simulated Annealing 2015 IEEE International Conference on Systems, Man, and Cybernetics, (2255-2261)
Contributors
  • Coventry University

Recommendations