Directory UMM :Data Elmu:jurnal:O:Operations Research Letters:Vol27.Issue3.2000:
Teks penuh
Dokumen terkait
As the suggested method is a transportation one (in its nature) the time for solving such partially linear transportation prob- lems (starting from a given initial plan) is
We prove existence, uniqueness and comparison theorems for a class of parabolic semilinear stochastic partial dierential equations with nonlinearities of polynomial growth in the
Carl served in editorial capacities for Operations Research, Naval Research Logistics, Socio-Economic Planning Sciences, Computational Probability, the INFORMS Journal on
The third shows that there exists a linear-time algorithm for constructing the geometric solution to the 2SNPP given the topological solution, and we outline a rudimentary
Queyranne, A combinatorial algorithm for minimizing symmetric submodular functions, Proceedings of the Sixth ACM-SIAM Symposium on Discrete Algorithms, 1995, pp. Vazirani, Finding a
In a recent paper, Chekuri and Bender (Proceedings of IPCO’98, pp. 383–393) derive (among other results) a polynomial-time 6-approximation algorithm for makespan minimization on
However, they prove the existence of stable outcomes and the lattice property of the core for a particular case of this model, which does not include the continuous market as it
This paper presents e $ cient methods for the solution of x nite-horizon multivariate linear rational expectations (MLRE) models, linking the solution of such models to the problem
