Journal: Operations Research

Found 2096 papers in total
Close-point spatial tests and their application to random number generators
Close-point spatial tests and their application to random number generators
2000,
We study statistical tests of uniformity based on the L p -distances between the m...
An assurance interval for the non-Archimedean epsilon in data envelopment analysis (DEA) models
An assurance interval for the non-Archimedean epsilon in data envelopment analysis (DEA) models
2000,
This paper clarifies the role of non-Archimedean infinitesimal ε in DEA models so...
Operations research at Bell Laboratories through the 1970s: Part I
Operations research at Bell Laboratories through the 1970s: Part I
2000,
This historical account of operations research at Bell Laboratories was drafted in the...
Operations research at Bell Laboratories through the 1970s: Part II
Operations research at Bell Laboratories through the 1970s: Part II
2000,
This historical account of operations research at Bell Laboratories was drafted in the...
Using branch-and-price-and-cut to solve origin–destination integer multicommodity flow problems
Using branch-and-price-and-cut to solve origin–destination integer multicommodity flow problems
2000,
We present a column-generation model and branch-and-price-and-cut algorithm for...
A dynamic network flow problem with uncertain arc capacities: Formulation and problem structure
A dynamic network flow problem with uncertain arc capacities: Formulation and problem structure
2000,
We consider a dynamic network flow problem where the arc capacities are random...
Restless bandits, linear programming relaxations, and a primal–dual index heuristic
Restless bandits, linear programming relaxations, and a primal–dual index heuristic
2000,
We develop a mathematical programming approach for the classical PSPACE-hard restless...
Probabilistic analysis of renewal cycles: An application to a non-Markovian inventory problem with multiple objectives
Probabilistic analysis of renewal cycles: An application to a non-Markovian inventory problem with multiple objectives
2000,
Many stochastic optimization problems are solved using the renewal reward theorem...
Finite horizon stochastic knapsacks with applications to yield management
Finite horizon stochastic knapsacks with applications to yield management
2000,
The finite horizon stochastic knapsack combines a secretary problem with an integer...
Optimality of myopic ordering policies for inventory model with stochastic supply
Optimality of myopic ordering policies for inventory model with stochastic supply
2000,
This paper addresses a discrete time inventory model where the maximum amount of...
Monotone optimal policies for a transient queueing staffing problem
Monotone optimal policies for a transient queueing staffing problem
2000,
We consider the problem of determining the optimal policy for staffing a queueing...
On Dantzig–Wolfe decomposition in integer programming and ways to perform branching in a branch-and-price algorithm
On Dantzig–Wolfe decomposition in integer programming and ways to perform branching in a branch-and-price algorithm
2000,
Dantzig–Wolfe decomposition as applied to an integer program is a specific form...
A Lagrangian heuristic based branch-and-bound approach for the capacitated network design problem
A Lagrangian heuristic based branch-and-bound approach for the capacitated network design problem
2000,
The capacitated network design problem is a multicommodity minimal cost network flow...
Optimizing over the efficient set using a top–down search of faces
Optimizing over the efficient set using a top–down search of faces
2000,
The problem of optimizing a linear function over the efficient set of a multiple...
Pure strategy asymmetric rendezvous on the line with an unknown initial distance
Pure strategy asymmetric rendezvous on the line with an unknown initial distance
2000,
Suppose two blind agents with unit speed are placed a distance H apart on an infinite...
On a queueing network model for cellular mobile telecommunications networks
On a queueing network model for cellular mobile telecommunications networks
2000,
This paper presesnts a queueing network description of a cellular mobile...
Marketable pollution permits in oligopolistic markets with transaction costs
Marketable pollution permits in oligopolistic markets with transaction costs
2000,
In this paper, we present a variational inequality framework for the modeling,...
Incorporating fuel constraints and electricity spot prices into the stochastic unit commitment problem
Incorporating fuel constraints and electricity spot prices into the stochastic unit commitment problem
2000,
The electric power industry is going through deregulation. As a result, the load on...
Inferring balking behavior from transactional data
Inferring balking behavior from transactional data
1999,
Balking is the act of not joining a queue because the prospective arriving customer...
Optimal commonality in component design
Optimal commonality in component design
2000,
Increased competition and more demanding customers have forced companies to offer a...
Aggregation error bounds for a class of location models
Aggregation error bounds for a class of location models
2000,
Many location models involve distances and demand points in their objective function....
Improvements and comparison of heuristics for solving the uncapacitated multisource Weber problem
Improvements and comparison of heuristics for solving the uncapacitated multisource Weber problem
2000,
The multisource Weber problem is to locate simultaneously m facilities in the...
Development of a rapid-response supply chain at Caterpillar
Development of a rapid-response supply chain at Caterpillar
2000,
As part of its growth strategy, Caterpillar Inc. is launching a new P2000 product line...
The stochastic economic lot scheduling problem: Heavy traffic analysis of dynamic cyclic policies
The stochastic economic lot scheduling problem: Heavy traffic analysis of dynamic cyclic policies
2000,
We consider two queueing control problems that are stochastic versions of the economic...
Papers per page: