Skip to content
VuFind
    • English
    • Deutsch
    • Español
    • Français
    • Italiano
    • 日本語
    • Nederlands
    • Português
    • Português (Brasil)
    • 中文(简体)
    • 中文(繁體)
    • Türkçe
    • עברית
    • Gaeilge
    • Cymraeg
    • Ελληνικά
    • Català
    • Euskara
    • Русский
    • Čeština
    • Suomi
    • Svenska
    • polski
    • Dansk
    • slovenščina
    • اللغة العربية
    • বাংলা
    • Galego
    • Tiếng Việt
    • Hrvatski
    • हिंदी
    • Հայերէն
    • Українська
    • Sámegiella
    • Монгол
Advanced
  • A central limit theorem for th...
  • Cite this
  • Text this
  • Email this
  • Print
  • Export Record
    • Export to RefWorks
    • Export to EndNoteWeb
    • Export to EndNote
  • Permanent link
A central limit theorem for the exodic tree and exodic matching in geometrical probability

A central limit theorem for the exodic tree and exodic matching in geometrical probability

Includes bibliographical references (p. 16-17).

Bibliographic Details
Other Authors: Bertsimas, Dimitris
Language:eng
Published: Alfred p. Sloan School of Management, Massachusetts Institute of Technology 2003
Subjects:
HD28 .M414 no.3313-, 91
Online Access:http://hdl.handle.net/1721.1/2363
  • Holdings
  • Description
  • Similar Items
  • Staff View

Internet

http://hdl.handle.net/1721.1/2363

Similar Items

  • An analytic approach for demonstrating the benefits of limited flexibility
    Published: (2003)
  • An asymptotic determination of the minimum spanning tree and minimum matching constants in geometrical probability
    Published: (2003)
  • A perspective on information technology in the process-oriented organization
    Published: (2003)
  • A technique for speeding up the solution of the Lagrangean dual
    Published: (2003)
  • Flexibility and performance : a literature critique and strategic framework
    Published: (2003)

Search Options

  • Search History
  • Advanced Search

Find More

  • Browse the Catalog
  • Browse Alphabetically
  • Explore Channels
  • Course Reserves
  • New Items

Need Help?

  • Search Tips
  • Ask a Librarian
  • FAQs