Publicidad

Publicidad

becas.universia.netBiblioteca.Net

Buscar recursos:

Buscador Google

rss_1.0 Recursos de colección

DSpace at MIT (35.359 recursos)
This site is a university repository providing access to the publication output of the institution. Registered users can set up email alerts to notify them of newly added relevant content. A certain level of encryption and security is embedded in the site which may cause some users accessibility problems.

Mostrando recursos 1 - 20 de 360

1. Deducing Queue Statistics from Transactional Data - Larson, Richard C., 1943-
Revised May 1988

2. A Dual Ascent Procedure for Large Scale Uncapacitated Network Design - Balakrishnan, Anantaram; Magnanti, Thomas L.; Wong, Richard T.
The fixed-charge network design problem arises in a variety of problem contexts including transportation, communication, and production scheduling.We develop a family of dual ascent algorithms for this problem. This approach generalizes known ascent procedures for solving shortest path, plant location,Steiner network and directed spanning tree problems. Our computational results for several classes of test problems with up to 500 integer and 1.98 million continuous variables and constraints shows that the dual ascent procedure and an associated drop-add heuristic generates solutions that, in almost all cases, are guaranteed to be within 1 to 3 percent of optimality. Moreover, the procedure requires...

3. A faster strongly polynomial minimum cost flow algorithm
Also issued as: Working Paper (Sloan School of Management) ; WP 2042-88

4. New scaling algorithms for the assignment for minimum cycle mean problems
Also issued as: Working paper (Sloan School of Management) ; WP 2019-88.

5. An optimal multigrid algorithm for continuous state discrete time stochastic control
Chee-Seng Chow, John N. Tsitsiklis.

6. Pup Matching: Model Formulations and Solution Approaches - Bossert, John M.; Magnanti, Thomas L.
We model Pup Matching, the logistics problem of matching or pairing semitrailers known as pups to cabs that are able to tow one or two of the pups simultaneously, as an AfP-complete version of the Network Loading Problem (NLP). We examine a branch and bound solution approach tailored to the NLP formulation through the use of three families of cutting planes and four heuristic procedures. Theoretically, we specify facet defining conditions for a cut family that we refer to as odd flow inequalities and show that each heuristic yields a 2-approximation. Computationally, the cheapest of the four heuristic values achieved...

7. The probabilistic minimum spanning tree problem : Part I--complexity and combinatorial properties
Includes bibliographical references.

8. The theory of cyclic transfers
Includes bibliographical references (p. 29-31).

9. Hypercube model with multiple-unit dispatches and police patrol-initiated activities
Includes bibliographical references (p. 36).

10. Improved primal simplex algorithms for shortest path, assignment and minimum cost flow problems
"November 1988."

11. Due-date setting and priority sequencing in a multiclass M/G/1 queue
Includes bibliographical references (leaves 26-28).

12. Mathematical programming models and methods for production planning and scheduling
Includes bibliographical references (p. 106-112).

13. Models for planning the evolution of local telecommunication networks
Includes bibliographical references.

14. Equilibration operators for the solution of constrained matrix problems
Includes bibliographical references (p. 24-28).

15. The application of variational inequality theory to the study of spatial equilibrium and disequilibrium
Includes bibliographical references (p. 26-29).

16. Routing in Point-to-Point Delivery Systems - Leung, Janny M. Y.; Magnanti, Thomas L.; Singhal, Vijay
This paper was also printed as a Working Paper at the Yale School of Organization and Management, Series B, No. 103.

17. The departure process from a GI/G/1 queue and its applications to the analysis of tandem queues
"September 1990."

18. A decomposition algorithm for local access telecommunications network expansion planning
Includes bibliographical references.

19. On the characteristic equation of general queueing systems
"September 1990."

20. Computation of Minimum Volume Covering Ellipsoids - Sun, Peng; Freund, Robert M.
We present a practical algorithm for computing the minimum volume n-dimensional ellipsoid that must contain m given points al,...,am C Rn . This convex constrained problem arises in a variety of applied computational settings, particularly in data mining and robust statistics. Its structure makes it particularly amenable to solution by interior-point methods, and it has been the subject of much theoretical complexity analysis. Here we focus on computation. We present a combined interior-point and active-set method for solving this problem. Our computational results demonstrate that our method solves very large problem instances (m = 30, 000 and n = 30)...

Página de resultados:
2  3  4  5  6  7  8  9  10  Siguiente