Journal: Computers and Operations Research

Found 2748 papers in total
On the distribution of the number of successes in fourth- or lower-order Markovian trials
On the distribution of the number of successes in fourth- or lower-order Markovian trials
2000,
This paper presents an algorithm which may be used to compute the distribution of the...
Heuristics for the multi-vehicle covering tour problem
Heuristics for the multi-vehicle covering tour problem
2000,
The multi-vehicle covering tour problem is defined on a graph G = ( V ∪ W, E ),...
Heuristics for the mixed rural postman problem
Heuristics for the mixed rural postman problem
2000,
The Rural Postman Problem on a mixed graph (MRPP) consists of finding a minimum cost...
The multi-hour bandwidth packing problem
The multi-hour bandwidth packing problem
2000,
We study the multi-hour bandwidth packing problem arising from telecommunications...
A parameter set design procedure for the simulated annealing algorithm under the computational time constraint
A parameter set design procedure for the simulated annealing algorithm under the computational time constraint
1999,
In this research, a design procedure is developed to specify the parameter set for the...
Convergence aspects of adaptive clustering in variable aggregation
Convergence aspects of adaptive clustering in variable aggregation
1999,
A convergent iterative aggregation procedure is described. The procedure makes use of...
An interior point method in Dantzig–Wolfe decomposition
An interior point method in Dantzig–Wolfe decomposition
1999,
This paper studies the application of interior point methods in Dantzig–Wolfe...
Localization of the optimal solution and a posteriori bounds for aggregation
Localization of the optimal solution and a posteriori bounds for aggregation
1999,
After an aggregated problem has been solved, it is often desirable to estimate the...
Error bound comparisons for aggregation/disaggregation techniques applied to the transportation problem
Error bound comparisons for aggregation/disaggregation techniques applied to the transportation problem
1999,
A priori and a posteriori error bounds for a transportation problem model at different...
Heuristics for the traveling salesman problem with pickup and delivery
Heuristics for the traveling salesman problem with pickup and delivery
1999,
We consider the Traveling Salesman Problem with Pickup and Delivery (TSPPD), an...
Nonlinear regression: A hybrid model
Nonlinear regression: A hybrid model
1999,
Using traditional parametric methods of regression analysis, one must make...
An investigation of aggregate variable time series forecast strategies with specific subaggregate time series statistical correlation
An investigation of aggregate variable time series forecast strategies with specific subaggregate time series statistical correlation
1999,
In order to meet demand for family-based forecasting systems, firms such as IBM and...
Choosing the best approach to matrix exponentiation
Choosing the best approach to matrix exponentiation
1999,
There is no ideal single approach to matrix exponentiation; an application may have...
An O(mn) Algorithm for the 1-maximin problem on a network
An O(mn) Algorithm for the 1-maximin problem on a network
1999,
This paper addresses the problem of locating a point on a general network with n...
An interactive bi-objective shortest path approach: Searching for unsupported nondominated solutions
An interactive bi-objective shortest path approach: Searching for unsupported nondominated solutions
1999,
In many network routing problems several conflicting objectives must be considered....
Parallel algorithms for solving aggregated shortest-path problems
Parallel algorithms for solving aggregated shortest-path problems
1999,
We consider the problem of computing in parallel all pairs of shortest paths in a...
Optimizing budget spendings for software implementation and testing
Optimizing budget spendings for software implementation and testing
1999,
This article considers the problem of optimal allocation of the financial budget to a...
Improved solutions for the Chinese postman problem on mixed networks
Improved solutions for the Chinese postman problem on mixed networks
1999,
The Chinese postman problem (CPP) is that of finding the shortest postman tour...
A tabu search heuristic for the heterogeneous fleet vehicle routing problem
A tabu search heuristic for the heterogeneous fleet vehicle routing problem
1999,
The Heterogeneous Fleet Vehicle Routing Problem (HVRP) is a variant of the classical...
A military reserve manpower planning model
A military reserve manpower planning model
1999,
A multiple objective model for manpower planning in a company sized, 100 person,...
Predicting the success of nations at the Summer Olympics using neural networks
Predicting the success of nations at the Summer Olympics using neural networks
1999,
In this paper, we construct several models that try to predict a country's success at...
On the selection of hub airports for an airline hub-and-spoke system
On the selection of hub airports for an airline hub-and-spoke system
1999,
We consider the 1-stop multiple allocation p -hub median problem. We formulate the...
Clustering techniques for stock location and order-picking in a distribution center
Clustering techniques for stock location and order-picking in a distribution center
1999,
In this paper, the stock location and order-picking problems in a distribution center...
Analysis of aggregation errors for the p-median problem
Analysis of aggregation errors for the p-median problem
1999,
Data aggregation in location problems is a common issue which, on one hand, reduces...
Papers per page: