Inviting an author to review:
Find an author and click ‘Invite to review selected article’ near their name.
Search for authorsSearch for similar articles
18
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: not found
      • Article: not found

      A Dynamic Near-Optimal Algorithm for Online Linear Programming

      , ,
      Operations Research
      Institute for Operations Research and the Management Sciences (INFORMS)

      Read this article at

      ScienceOpenPublisher
      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Related collections

          Most cited references17

          • Record: found
          • Abstract: not found
          • Book: not found

          Weak Convergence and Empirical Processes

            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            Optimal Dynamic Pricing of Inventories with Stochastic Demand over Finite Horizons

              Bookmark
              • Record: found
              • Abstract: not found
              • Book: not found

              Linear Programming and Extensions

                Bookmark

                Author and article information

                Journal
                Operations Research
                Operations Research
                Institute for Operations Research and the Management Sciences (INFORMS)
                0030-364X
                1526-5463
                August 2014
                August 2014
                : 62
                : 4
                : 876-890
                Article
                10.1287/opre.2014.1289
                b787c90a-7b42-44ba-a02e-4e0d895b4035
                © 2014
                History

                Comments

                Comment on this article