default search action
Journal of Heuristics, Volume 7
Volume 7, Number 1, January 2001
- Christine L. Valenzuela:
A Study of Permutation Operators for Minimum Span Frequency Assignment Using an Order Based Representation. 5-21 - Rahul Simha, Weidong Cai, Valentin I. Spitkovsky:
Simulated N-Body: New Particle Physics-Based Heuristics for a Euclidean Location-Allocation Problem. 23-36 - T. Aaron Gulliver, Patric R. J. Östergård:
Improved Bounds for Ternary Linear Codes of Dimension 8 Using Tabu Search. 37-46 - Saïd Hanafi:
On the Convergence of Tabu Search. 47-58 - Tibor Illés, David Pisinger:
Upper Bounds on the Covering Number of Galois-Planes with Small Order. 59-76 - Steven P. Coy, Bruce L. Golden, George C. Runger, Edward A. Wasil:
Using Experimental Design to Find Effective Parameter Settings for Heuristics. 77-97
Volume 7, Number 2, March 2001
- Roberto Cordone, Roberto Wolfler Calvo:
A Heuristic for the Vehicle Routing Problem with Time Windows. 107-129 - Peter L. Hammer, David J. Rader Jr.:
Maximally Disjoint Solutions of the Set Covering Problem. 131-144 - Nesa Ilich, Slobodan P. Simonovic:
An Evolution Program for Non-Linear Transportation Problems. 145-168 - Djangir A. Babayev, George I. Bell:
An Optimization Problem with a Separable Non-Convex Objective Function and a Linear Constraint. 169-184 - Rachel Q. Zhang, Wallace J. Hopp, Chonawee Supatgiat:
Spreadsheet Implementable Inventory Control for a Distribution Center. 185-203
Volume 7, Number 3, May 2001
- Márk Jelasity, Pilar Martínez Ortigosa, Inmaculada García:
UEGO, an Abstract Clustering Technique for Multimodal Global Optimization. 215-233 - Youssef Saab:
A Fast and Effective Algorithm for the Feedback Arc Set Problem. 235-250 - Mike Wright:
Subcost-Guided Search-Experiments with Timetabling Problems. 251-260 - Ronald L. Rardin, Reha Uzsoy:
Experimental Evaluation of Heuristic Optimization Algorithms: A Tutorial. 261-304
Volume 7, Number 4, July 2001
- Erick Cantú-Paz:
Migration Policies, Selection Pressure, and Parallel Evolutionary Algorithms. 311-334 - Pierre Hansen, Nenad Mladenovic, Dionisio Pérez-Brito:
Variable Neighborhood Decomposition Search. 335-350 - Gail W. DePuy, Martin W. P. Savelsbergh, Jane C. Ammons, Leon F. McGinnis:
An Integer Programming Heuristic for Component Allocation in Printed Circuit Card Assembly Systems. 351-369 - Peter Greistorfer, Hans Kellerer:
Bounds and Tabu Search for a Cyclic Max-Min Scheduling Problem. 371-390 - Jacques A. Ferland, Ilham Berrada, Imene Nabli, B. Ahiod, Philippe Michelon, Viviane Gascon, Éric Gagné:
Generalized Assignment Type Goal Programming Problem: Application to Nurse Scheduling. 391-413
Volume 7, Number 5, September 2001
- Mutsunori Yagiura, Toshihide Ibaraki:
Efficient 2 and 3-Flip Neighborhood Search Algorithms for the MAX SAT: Experimental Evaluation. 423-442 - Michel Vasquez, Jin-Kao Hao:
A Heuristic Approach for Antenna Positioning in Cellular Networks. 443-472 - Richard V. Helgason, Jeffery L. Kennington, Karen R. Lewis:
Cruise Missile Mission Planning: A Heuristic Algorithm for Automatic Path Generation. 473-494 - Jiyang Xu, Steve Y. Chiu:
Effective Heuristic Procedures for a Field Technician Scheduling Problem. 495-509
Volume 7, Number 6, November 2001
- Francis Sourd:
Scheduling Tasks on Unrelated Machines: Large Neighborhood Improvement Procedures. 519-531 - Hussain Aziz Saleh, Peter Dare:
Effective Heuristics for the GPS Survey Network of Malta: Simulated Annealing and Tabu Search Techniques. 533-549 - Alan P. French, Andrew C. Robinson, John M. Wilson:
Using a Hybrid Genetic-Algorithm/Branch and Bound Approach to Solve Feasibility and Optimization Integer Programming Problems. 551-564 - Arun Jagota, Laura A. Sanchis:
Adaptive, Restart, Randomized Greedy Heuristics for Maximum Clique. 565-585 - Mohan Krishnamoorthy, Andreas T. Ernst, Yazid M. Sharaiha:
Comparison of Algorithms for the Degree Constrained Minimum Spanning Tree. 587-611
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.