Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Country: United States
Found
17049 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Procedures for finding nondominated solutions for multiple objective network programming problems
2003,
Sun M.
Procedures for finding nondominated solutions for multiple objective network...
Accelerating the profitability of Hewlett-Packard's supply chains
2004,
Billington Corey
Hewlett-Packard (HP) developed a standard and common process analysis coupled with...
Parameter tracking for an inventory model
2003,
Benkherouf Lakdere
This article is an application of Hidden Markov models techniques to partially...
Hybrid backtracking bounded by tree-decomposition of constraint networks
2003,
Jegou P.
We propose a framework for solving CSPs based both on backtracking techniques and on...
A distributed ant algorithm for efficiently patrolling a network
2003,
Bruckstein A.M.
We consider the problem of patrolling, i.e. ongoing exploration of a network by a...
Genetic Algorithms and Fuzzy Multiobjective Optimization
2004,
Zilinskas Antanas
Reformulating linear programs with transportation constraints – with applications to workforce scheduling
2004,
Gnlk Oktay
We study linear programming models that contain transportation constraints in their...
Nu-kote's spreadsheet linear-programming models for optimizing transportation
2004,
LeBlanc Larry J.
Nu-kote International manufactures ink-jet, laser, and toner cartridges; ribbons; and...
Entropic approach to interior point solution of linear programs
2003,
Diasparra M.
We present a maxentropic approach for obtaining interior, suboptimal solutions to a...
Schlumberger optimizes receiver location for automated meter reading
2004,
Gavirneni Srinagesh
In its efforts to provide automated meter-reading services to the utility industry,...
Responding to a one-time-only sales (OTOS) of a product subject to sudden obsolescence
2003,
Joglekar Prafulla
With advancing technologies and shrinking life cycles, today many products are subject...
New bounds for multidimensional packing
2003,
Seiden S.S.
New upper and lower bounds are presented for a multidimensional generalization of bin...
Revenue management in a dynamic network environment
2003,
Bertsimas D.
We investigate dynamic policies for allocating scarce inventory to stochastic demand...
Dynamic programming and pseudo-inverses
2003,
Kalaba R.
Dynamic programming can be used to obtain the generalized inverse of a matrix.
Dynamic programming on the word RAM
2003,
Pisinger D.
Dynamic programming is one of the fundamental techniques for solving optimization...
Temporary tasks assignment resolved
2003,
Azar Y.
Among all basic on-line load balancing problems, the only unresolved problem was load...
The minimum range assignment problem on linear radio networks
2003,
Clementi A.E.F.
Given a set S of radio stations located on a line and an integer h ≥ 1, the MIN...
Stochastic Modeling and Optimization
2004,
Modi Jamshed A.
Emerging Optimization Techniques in Production Planning and Control
2004,
Gavirneni Srinagesh
Threshold agent networks: an approach to modelling and simulation
2003,
Voutsadakis G.
Threshold agent networks (TANs), a discretized version of threshold or neural...
Time-dependent, label-constrained shortest path problems with applications
2003,
Sherali Hanif D.
In this paper, we consider a variant of shortest path problems where, in addition to...
A heuristic for Dijkstra's algorithm with many targets and its use in weighted matching algorithms
2003,
Mehlhorn K.
We consider the single-source many-targets shortest-path (SSMTSP) problem in directed...
Performance optimization of continuous-time Markov control processes based on performance potentials
2003,
Tang H.
Average-cost optimization problems for a class of continuous-time Markov control...
Stock valuation along a Markov chain
2003,
Piccardi C.
A novel dividend valuation model is put forward by using a Markov chain. The valuation...
First Page
185
186
187
188
189
Last Page
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers