Operations Research

Công bố khoa học tiêu biểu

* Dữ liệu chỉ mang tính chất tham khảo

Sắp xếp:  
Stochastic Network Interdiction
Operations Research - Tập 46 Số 2 - Trang 184-197 - 1998
Kelly J. Cormican, David P. Morton, R. Kevin Wood
Using limited assets, an interdictor attempts to destroy parts of a capacitated network through which an adversary will subsequently maximize flow. We formulate and solve a stochastic version of the interdictor's problem: Minimize the expected maximum flow through the network when interdiction successes are binary random variables. Extensions are made to handle uncertain arc capacities an...... hiện toàn bộ
Bounds on the Effect of Aggregating Variables in Linear Programs
Operations Research - Tập 28 Số 2 - Trang 403-418 - 1980
Paul Zipkin
This paper explores the effects of aggregating variables in large linear programs. We define a reasonable criterion for the resulting loss in accuracy, and derive bounds on this quantity. A posteriori bounds may be calculated after solving the aggregated problem, and a priori bounds before. Also, we show that standard iterative methods can be used to improve the accuracy of a given aggreg...... hiện toàn bộ
Jointly Optimal Inventory and Maintenance Policies for Stochastically Failing Equipment
Operations Research - Tập 16 Số 3 - Trang 587-601 - 1968
Charles H. Falkner
A dynamic programming problem is formulated to find the inventory, x, of a spare component and a sequence of maintenance intervals r= (r1,…,rx + 1) that minimize the expected cost of operating an equipment for a finite planning horizon, T. It is assumed that the component fails according to a life distribution function, F(⋯), with an increasing ha...... hiện toàn bộ
Coordinating Clearance Markdown Sales of Seasonal Products in Retail Chains
Operations Research - Tập 46 Số 5 - Trang 609-624 - 1998
Gabriel R. Bitran, René Caldentey, Susana Mondschein
In this paper we propose a methodology to set prices of perishable items in the context of a retail chain with coordinated prices among its stores and compare its performance with actual practice in a real case study. We formulate a stochastic dynamic programming problem and develop heuristic solutions that approximate optimal solutions satisfactorily. To compare this methodology with cur...... hiện toàn bộ
Distribution Strategies that Minimize Transportation and Inventory Costs
Operations Research - Tập 33 Số 3 - Trang 469-490 - 1985
Lawrence D. Burns, Randolph W. Hall, Dennis E. Blumenfeld, Carlos F. Daganzo
This paper develops an analytic method for minimizing the cost of distributing freight by truck from a supplier to many customers. It derives formulas for transportation and inventory costs, and determines the optimal trade-off between these costs. The paper analyzes and compares two distribution strategies: direct shipping (i.e., shipping separate loads to each customer) and peddling (i....... hiện toàn bộ
Letter to the Editor—Optimum Locations on Graphs with Correlated Normal Demands
Operations Research - Tập 15 Số 3 - Trang 552-557 - 1967
H. Frank
The traffic demands at the stations of a traffic network are assumed to be random variables with a joint normal distribution. The location of optimum points on the linear graph model of the network is discussed. Techniques to locate these points are given.
Bounds and Transformations for Discounted Finite Markov Decision Chains
Operations Research - Tập 23 Số 4 - Trang 761-784 - 1975
Evan L. Porteus
This paper develops new improved bounds on the optimal return function in finite state and action, infinite horizon, discounted stationary Markov decision chains. The bounds are obtained by solving a single-constraint, bounded-variable linear program. They can be used for algorithmic termination criteria and improved tests for suboptimal decisions. We show how to implement these tests so ...... hiện toàn bộ
A Faster Strongly Polynomial Minimum Cost Flow Algorithm
Operations Research - Tập 41 Số 2 - Trang 338-350 - 1993
James B. Orlin
In this paper, we present a new strongly polynomial time algorithm for the minimum cost flow problem, based on a refinement of the Edmonds-Karp scaling technique. Our algorithm solves the uncapacitated minimum cost flow problem as a sequence of O(n log n) shortest path problems on networks with n nodes and m arcs and runs in O(n log n(m + n log n)) time. Using a standard transformation, t...... hiện toàn bộ
Network Design and Allocation Mechanisms for Carrier Alliances in Liner Shipping
Operations Research - Tập 58 Số 6 - Trang 1726-1742 - 2010
Richa Agarwal, Özlem Ergün
Many real-world systems operate in a decentralized manner, where individual operators interact with varying degrees of cooperation and self motive. In this paper, we study transportation networks that operate as an alliance among different carriers. In particular, we study alliance formation among carriers in liner shipping. We address tactical problems such as the design of large-scale n...... hiện toàn bộ
Application of the Branch and Bound Technique to Some Flow-Shop Scheduling Problems
Operations Research - Tập 13 Số 3 - Trang 400-412 - 1965
Edward Ignall, Linus Schrage
The branch-and-bound technique of Little, et al. and Land and Doig is presented and then applied to two flow-shop scheduling problems. Computational results for up to 9 jobs are given for the 2-machine problem when the objective is minimizing the mean completion time. This problem was previously untreated. Results for up to 10 jobs, including comparisons with other techniques, are given f...... hiện toàn bộ
Tổng số: 154   
  • 1
  • 2
  • 3
  • 4
  • 5
  • 6
  • 10