Research Article

Some Experimental and Theoretical Results on Test Case Generators for the Maximum Clique Problem

Pages:87–102

Published Online:May 1, 1996

https://doi.org/10.1287/ijoc.8.2.87

Application of an Annealed Neural Network to a Timetabling Problem

Pages:103–117

Published Online:May 1, 1996

https://doi.org/10.1287/ijoc.8.2.103

A Self-Organizing Approach to Managerial Nonlinear Discriminant Analysis: A Hybrid Method of Linear Discriminant Analysis and Neural Networks

Pages:118–124

Published Online:May 1, 1996

https://doi.org/10.1287/ijoc.8.2.118

Perturbation: An Efficient Technique for the Solution of Very Large Instances of the Euclidean TSP

Pages:125–133

Published Online:May 1, 1996

https://doi.org/10.1287/ijoc.8.2.125

A Fast Composite Heuristic for the Symmetric Traveling Salesman Problem

Pages:134–143

Published Online:May 1, 1996

https://doi.org/10.1287/ijoc.8.2.134

Constraint Propagation Based Scheduling of Job Shops

Pages:144–157

Published Online:May 1, 1996

https://doi.org/10.1287/ijoc.8.2.144

The Vehicle Routing Problem with Time Windows Part I: Tabu Search

Pages:158–164

Published Online:May 1, 1996

https://doi.org/10.1287/ijoc.8.2.158

The Vehicle Routing Problem with Time Windows Part II: Genetic Search

Pages:165–172

Published Online:May 1, 1996

https://doi.org/10.1287/ijoc.8.2.165

Adaptive Penalty Methods for Genetic Optimization of Constrained Combinatorial Problems

Pages:173–182

Published Online:May 1, 1996

https://doi.org/10.1287/ijoc.8.2.173

Stopping Criteria for Finite Length Genetic Algorithms

Pages:183–191

Published Online:May 1, 1996

https://doi.org/10.1287/ijoc.8.2.183

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.