Journal: Computers and Operations Research

Found 2748 papers in total
Heuristics for cardinality constrained portfolio optimisation
Heuristics for cardinality constrained portfolio optimisation
2000,
In this paper we consider the problem of finding the efficient frontier associated...
An application of zero–one goal programming in project selection and resource planning – a case study from the Woodward Governor Company
An application of zero–one goal programming in project selection and resource planning – a case study from the Woodward Governor Company
2000,
This paper deals with a project for the Aircraft Controls Group but the model is...
A simple heuristic for maximizing service of carousel storage
A simple heuristic for maximizing service of carousel storage
2000,
We consider a system that stores cases of items. Items are removed from storage in...
A comparison of different solution approaches to the vehicle scheduling problem in a practical case
A comparison of different solution approaches to the vehicle scheduling problem in a practical case
2000,
The Vehicle Scheduling Problem (VSP) consists in assigning a set of scheduled trips to...
New lot-sizing formulations for less nervous production schedules
New lot-sizing formulations for less nervous production schedules
2000,
Previously scheduled production plans frequently need to be updated because of demand...
Scheduling concurrent production over a finite planning horizon: Polynomially solvable cases
Scheduling concurrent production over a finite planning horizon: Polynomially solvable cases
2000,
The paper analyzes a manufacturing system made up of one workstation which is able to...
A linearization method for mixed 0–1 polynomial programs
A linearization method for mixed 0–1 polynomial programs
2000,
This paper proposes a concise method for solving mixed 0–1 polynomial...
Two-machine flowshop group scheduling problem
Two-machine flowshop group scheduling problem
2000,
This paper considers a two-machine flowshop group scheduling problem. The jobs are...
Timetable planning using the constraint-based reasoning
Timetable planning using the constraint-based reasoning
2000,
College timetabling is a combinatoric and dynamic problem. In order to solve this...
A heuristic for the pickup and delivery traveling salesman problem
A heuristic for the pickup and delivery traveling salesman problem
2000,
This paper deals with the pickup and delivery traveling salesman problem. First we...
Comparing neuro-dynamic programming alogrithms for the vehicle routing problem with stochastic demands
Comparing neuro-dynamic programming alogrithms for the vehicle routing problem with stochastic demands
2000,
The paper considers a version of the vehicle routing problem where customers' demands...
Inter-company comparison using a modification of the technique for order preference by similarity to ideal solution (TOPSIS) with objective weights
Inter-company comparison using a modification of the technique for order preference by similarity to ideal solution (TOPSIS) with objective weights
2000,
Simultaneous consideration of multiple financial ratios is required to adequately...
Predictable variation and profitable trading of US equities: A trading simulation using neural networks
Predictable variation and profitable trading of US equities: A trading simulation using neural networks
2000,
A switching rule conditioned on out-of-sample one-step-ahead predictions of returns is...
Segmentation-based competitive analysis with MULTICLUS and topology representing networks
Segmentation-based competitive analysis with MULTICLUS and topology representing networks
2000,
Two neural network approaches, Kohonen's self-organizing (feature) map (SOM) and the...
Development of a workforce management system for a customer hotline service
Development of a workforce management system for a customer hotline service
2000,
An integrated workforce management system was developed for a 24-h hotline service. It...
A constrained minimum spanning tree problem
A constrained minimum spanning tree problem
2000,
In this paper, we give an O(n 2 ) algorithm for finding a point on a given line l...
A greedy genetic algorithm for the quadratic assignment problem
A greedy genetic algorithm for the quadratic assignment problem
2000,
The Quadratic Assignment Problem (QAP) is one of the classical combinatorial...
Neural networks in business: Techniques and applications for the operations researcher
Neural networks in business: Techniques and applications for the operations researcher
2000,
This paper presents an overview of the different types of neural network models which...
A bibliography of neural network business applications research: 1994–1998
A bibliography of neural network business applications research: 1994–1998
2000,
The purpose of this paper is to present a comprehensive bibliography of neural network...
Heuristic procedure neural networks for the capacitated minimum spanning tree problem
Heuristic procedure neural networks for the capacitated minimum spanning tree problem
2000,
Combinatorial optimization problems are by nature very difficult to solve, and the...
Experiments with new stochastic global optimization search techniques
Experiments with new stochastic global optimization search techniques
2000,
In this paper several probabilistic search techniques are developed for global...
Analysis of solution space-dependent performance of simulated annealing: The case of the multi-level capacitated lot sizing problem
Analysis of solution space-dependent performance of simulated annealing: The case of the multi-level capacitated lot sizing problem
2000,
This study describes an analysis of different neighbourhood transition schemes and...
Heuristics for finding k-clubs in an undirected graph
Heuristics for finding k-clubs in an undirected graph
2000,
In a graph G , a k -club is a vertex set inducing a subgraph of diameter k . These...
Genetic search and the dynamic layout problem
Genetic search and the dynamic layout problem
2000,
An improved genetic algorithm for the dynamic layout problem is developed and tested...
Papers per page: