MIT Libraries homeMIT Libraries logoDSpace@MIT

MIT
Browsing Operations Research Center Working Papers by Subject 
  • DSpace@MIT Home
  • Operations Research Center
  • Operations Research Center Working Papers
  • Browsing Operations Research Center Working Papers by Subject
  • DSpace@MIT Home
  • Operations Research Center
  • Operations Research Center Working Papers
  • Browsing Operations Research Center Working Papers by Subject
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browsing Operations Research Center Working Papers by Subject

  • 0-9
  • A
  • B
  • C
  • D
  • E
  • F
  • G
  • H
  • I
  • J
  • K
  • L
  • M
  • N
  • O
  • P
  • Q
  • R
  • S
  • T
  • U
  • V
  • W
  • X
  • Y
  • Z

Order:

Results:

Now showing items 1-20 of 149

  • ascending
  • descending
  • 5
  • 10
  • 20
  • 40
  • 60
  • 80
  • 100
      Subject
      aggregate geometry [1]
      approximation algorithm, LP relaxation, scheduling, online algorithm [1]
      Communication in science [1]
      Complexity of Convex Programming, Conditioning, Pre-conditioners. [1]
      Condition number, convex optimization, conic optimization, duality, sensitivity analysis, perturbation theory. [1]
      control of queues, dynamic programming, submodularity, monotone policies, production/inventory systems. [2]
      Convex hull, Facets, Network design, Capacitated facilities. [1]
      Delivery of goods [1]
      Distribution (Probability theory) [1]
      Dynamic Pricing, Fluid Models. [1]
      Economic Lot-Sizing, Polyhedral Description, Plant Location, Separation. [1]
      economic lot-sizing, sensitivity analysis [1]
      Ellipsoid, Newton's method, interior-point method, barrier method, active set, semidefinite program, data mining. [1]
      Energy policy Argentina [1]
      Energy policy United States Mathematical models [1]
      fork-join networks, heterogeneous customer populations, reflected Brownian motion, [1]
      genetic algorithms [1]
      HD28 .M414 no.3276-, 91 [1]
      HV6419.M3 I54 no.10-74 [1]
      interior-point algorithm, linear program, factorization, fill-in. [1]

        Browse

        All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

        My Account

        Login

        Statistics

        OA StatisticsStatistics by CountryStatistics by Department
        MIT Libraries homeMIT Libraries logo

        Find us on

        Twitter Facebook Instagram YouTube RSS

        MIT Libraries navigation

        SearchHours & locationsBorrow & requestResearch supportAbout us
        PrivacyPermissionsAccessibility
        MIT
        Massachusetts Institute of Technology
        Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.