Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Journal: Computers and Operations Research
Found
2748 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
A genetic algorithm for flowshop sequencing
1995,
Reeves Colin R.
The basic concepts of genetic algorithms are described, following which a genetic...
A genetic algorithm for the job shop problem
1995,
Tadei Roberto
In this paper the authors introduce a genetic algorithm whose peculiarities are the...
Evolution based learning in a job shop scheduling environment
1995,
Pesch Erwin
A class of approximation algorithms is described for solving the minimum makespan...
A genetic approach to the quadratic assignment problem
1995,
Tate David M.
The quadratic assignment problem (QAP) is a well-known combinatorial optimization...
Scheduling in a sequence dependent setup environment with genetic search
1995,
Rubin Paul A.
Work on scheduling in the presence of sequence dependent setup times has generally...
Genetic algorithms and tabu search: Hybrids for optimization
1995,
Glover Fred
Genetic algorithms and tabu search have a number of significant differences. They also...
Genetic algorithm crossover operations for ordering applications
1995,
Poon P.W.
In this paper, the authors compare the performance of several crossover operators,...
An analysis of an embedded crossover scheme on a GA-hard problem
1995,
Venkatachalam A.R.
This paper analyzes the effect of an embedded crossover scheme on the performance of a...
Uncertainty and the acquisition of capacity: A competitive analysis
1994,
Gaimon Cheryl
Motivated by experience with the telecommunications industry, analysis of a dynamic...
Decomposition with simulated division for efficiently generated random numbers
1994,
Kao Chiang
Most portable implementations of the prime modulus multiplicative congruential random...
Algorithms for the Windy Postman Problem
1994,
Pearn Wen Lea
The Windy Postman Problem (WPP), is an interesting generalization of the classical...
Extensions of a tabu search adaptation to the Quadratic Assignment Problem
1994,
Skorin-Kapov J.
The adaptation of tabu search to the Quadratic Assignment Problem (QAP) is refined by...
Tabu search performance on the symmetric traveling salesman problem
1994,
Knox J.
This paper describes tabu search and its application to the symmetric TSP, which is a...
A study of diversification strategies for the quadratic assignment problem
1994,
Glover F.
Diversification strategies can be used to enhance general heuristic search procedures...
New heuristic solution procedures for the uniform graph partitioning problem: Extensions and evaluation
1994,
Pirkul H.
The uniform graph partitioning problem can be described as partitioning the nodes of a...
Genetic search with dynamic operating disciplines
1994,
Yeralan S.
This study extends the idea of genetic search to include the selection of specific...
A comparison of p-dispersion heuristics
1994,
Erkut Erhan
The objective of the p- dispersion problem is to choose p out of n given points, such...
Analytical computation of Markov chain using Padé approximations
1994,
Amindavar Hamidreza
The transient analysis of finite-state, continuous-time Markov chains is determined...
Parametric max flow problems in a class of networks with series-parallel structure
1994,
Sung C.S.
This paper considers a parametric max flow network problem where arc capacities are...
Optimization by ghost image processes in neural networks
1994,
Glover F.
The paper identifies processes for structuring neural networks by reference to two...
A priority measure in interval methods for constrained global optimization
1994,
Zhang Jianzhong
The interval method is a common approach for global optimization. Some interval...
A block principal pivoting algorithm for large-scale strictly monotone linear complementarity problems
1994,
Judice Joaquim J.
In this paper a finite block principal pivoting algorithm for the solution of strictly...
A note on a maximum distance problem
1994,
Proll L.G.
In this paper the authors consider the problem of finding the maximum Chebyshev...
Simulated annealing and tabu search: Lessons from a line search
1994,
Woodruff D.L.
Two prominent techniques for finding near optimal solutions to hard combinatorial...
First Page
96
97
98
99
100
Last Page
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers