Journal: Computers and Operations Research

Found 2748 papers in total
On the circle closest to a set of points
On the circle closest to a set of points
2002,
The objective of this paper is to find a circle whose circumference is as close as...
Fast heuristics for large scale covering-location problems
Fast heuristics for large scale covering-location problems
2002,
We propose fast heuristics for large-scale covering-location problems in which the set...
Supply facility and input/output point locations in the presence of barriers
Supply facility and input/output point locations in the presence of barriers
2002,
This paper studies a facility location model in which two-dimensional Euclidean space...
HubLocator: An exact solution method for the multiple allocation hub location problem
HubLocator: An exact solution method for the multiple allocation hub location problem
2002,
HubLocator is a new branch-and-bound procedure for the uncapacitated multiple...
On the use of genetic algorithms to solve location problems
On the use of genetic algorithms to solve location problems
2002,
This paper seeks to evaluate the performance of genetic algorithms (GA) as an...
Optimal construction of airline individual crew pairings
Optimal construction of airline individual crew pairings
2002,
In this paper we develop eight scheduling models to minimize crew costs and to plan...
A heuristic for the location of a rapid transit line
A heuristic for the location of a rapid transit line
2002,
This article presents a mathematical model and a two-phase heuristic for the location...
Combined bus and driver scheduling
Combined bus and driver scheduling
2002,
The daily bus and driver scheduling, for all bus companies that operate a non-fixed...
A branch-and-price algorithm for the Steiner tree packing problem
A branch-and-price algorithm for the Steiner tree packing problem
2002,
This paper deals with the Steiner tree packing problem. For a given undirected graph G...
Defining tabu list size and aspiration criterion within tabu search methods
Defining tabu list size and aspiration criterion within tabu search methods
2002,
An investigation to explicitly define two key elements in tabu search methods is...
An efficient network flow code for finding all minimum cost s–t cutsets
An efficient network flow code for finding all minimum cost s–t cutsets
2002,
Cutset algorithms have been well documented in the operations research literature. A...
A direct search variant of the simulated annealing algorithm for optimization involving continuous variables
A direct search variant of the simulated annealing algorithm for optimization involving continuous variables
2002,
A memory-based simulated annealing algorithm is proposed which fundamentally differs...
Simulation-based optimization using simulated annealing with ranking and selection
Simulation-based optimization using simulated annealing with ranking and selection
2002,
In this paper, we present a new iterative method that combines the simulated annealing...
An efficient search direction for linear programming problems
An efficient search direction for linear programming problems
2002,
In this paper, we present an auxiliary algorithm, in terms of the speed of obtaining...
Solving linear systems in interior-point methods
Solving linear systems in interior-point methods
2002,
There are two approaches to solve the linear systems in interior-point methods: the...
Extension of a hybrid genetic algorithm for nonlinear programming problems with equality and inequality constraints
Extension of a hybrid genetic algorithm for nonlinear programming problems with equality and inequality constraints
2002,
As an extension of the hybrid Genetic Algorithm-HGA proposed by Tang et al. , this...
Average waiting time of customers in a priority M/D/k queue with finite buffers
Average waiting time of customers in a priority M/D/k queue with finite buffers
2002,
Analysis of priority multiserver queues is known to be a difficult problem. In this...
A new method for solving capacitated location problems based on a set partitioning approach
A new method for solving capacitated location problems based on a set partitioning approach
2002,
We consider the capacitated p -median problem (CPMP) in which a set of n customers...
Buffer allocation in flow-shop-type production systems with general arrival and service patterns
Buffer allocation in flow-shop-type production systems with general arrival and service patterns
2002,
This study investigates the buffer allocation strategy of a flow-shop-type production...
Local search heuristics for two-stage flow shop problems with secondary criterion
Local search heuristics for two-stage flow shop problems with secondary criterion
2002,
This paper develops and compares different local search heuristics for the two-stage...
Fast parallel heuristics for the job shop scheduling problem
Fast parallel heuristics for the job shop scheduling problem
2002,
The paper is dealing with parallelized versions of simulated annealing-based...
Minimizing makespan in a two-machine flowshop with dynamic arrivals allowed
Minimizing makespan in a two-machine flowshop with dynamic arrivals allowed
2002,
This paper considers a scheduling problem for a two-machine flowshop where a discrete...
Scheduling parallel machines with a single server: Some solvable cases and heuristics
Scheduling parallel machines with a single server: Some solvable cases and heuristics
2002,
This paper considers the problem of scheduling two identical parallel machines with a...
Performance evaluation of continue after interruption and repeat after interruption transmission modes in a GI-G-1 queue
Performance evaluation of continue after interruption and repeat after interruption transmission modes in a GI-G-1 queue
2001,
In this paper, a discrete-time single-server queue is considered with an uncorrelated...
Papers per page: