Showing 1 - 10 results of 10 for search '[Cambridge, Mass.] : Sloan School of Management, Massachusetts Institute of Technology', query time: 0.06s Refine Results
  1. 1
    The probabilistic minimum spanning tree problem : Part I--complexity and combinatorial properties

    The probabilistic minimum spanning tree problem : Part I--complexity and combinatorial properties by Bertsimas, Dimitris

    Published 2009
    “…Cambridge, Mass. : Sloan School of Management, Massachusetts Institute of Technology…”
    Get full text
    Working Paper
  2. 2
    Conservation laws, extended polymatroids and multi-armed bandit problems : a unified approach to indexable systems

    Conservation laws, extended polymatroids and multi-armed bandit problems : a unified approach to indexable systems by Bertsimas, Dimitris., Nio-Mora, Jose

    Published 2009
    “…Cambridge, Mass. : Alfred P. Sloan School of Management, Massachusetts Institute of Technology…”
    Get full text
    Working Paper
  3. 3
    Decomposition algorithms for analyzing transient phenomena in multi-class queuing networks in air transportation

    Decomposition algorithms for analyzing transient phenomena in multi-class queuing networks in air transportation by Bertsimas, Dimitris., Odoni, Amedeo R., Peterson, Michael Downes

    Published 2009
    “…Cambridge, Mass. : Alfred P. Sloan School of Management, Massachusetts Institute of Technology…”
    Get full text
    Working Paper
  4. 4
    On central limit theorems in geometrical probability

    On central limit theorems in geometrical probability by Avram, Florin., Bertsimas, Dimitris

    Published 2009
    “…Cambridge, Mass. : Alfred P. Sloan School of Management, Massachusetts Institute of Technology…”
    Get full text
    Working Paper
  5. 5
    On the spacefilling curve heuristic for the Eculidean traveling salesman problem

    On the spacefilling curve heuristic for the Eculidean traveling salesman problem by Bertsimas, Dimitris., Grigni, Michelangelo

    Published 2009
    “…Cambridge, Mass. : Alfred P. Sloan School of Management, Massachusetts Institute of Technology…”
    Get full text
    Working Paper
  6. 6
    The parsimonious property of cut covering problems and its applications

    The parsimonious property of cut covering problems and its applications by Bertsimas, Dimitris, Teo, Chungpiaw

    Published 2009
    “…Cambridge, Mass. : Alfred P. Sloan School of Management, Massachusetts Institute of Technology…”
    Get full text
    Working Paper
  7. 7
    Probabilistic analysis of the 1-tree relaxation for the Eculidean traveling salesman problem

    Probabilistic analysis of the 1-tree relaxation for the Eculidean traveling salesman problem by Goemans, Michel X., Bertsimas, Dimitris

    Published 2009
    “…Cambridge, Mass. : Alfred P. Sloan School of Management, Massachusetts Institute of Technology…”
    Get full text
    Working Paper
  8. 8
    A unified method to analyze overtake free queueing systems

    A unified method to analyze overtake free queueing systems by Bertsimas, Dimitris, Mourtzinou, Georgia

    Published 2009
    “…Cambridge, Mass. : Alfred P. Sloan School of Management, Massachusetts Institute of Technology, 1992…”
    Get full text
    Working Paper
  9. 9
    Transient and busy period analysis of the GI/G/1 Queue : Part I, the method of stages

    Transient and busy period analysis of the GI/G/1 Queue : Part I, the method of stages by Bertsimas, Dimitris., Nakazato, Daisuke

    Published 2009
    “…Cambridge, Mass. : Center for Computational Research in Economics and Management Science, Sloan School of Management, Massachusetts Institute of Technology…”
    Get full text
    Working Paper
  10. 10
    Transient and busy period analysis of the GI/G/1 queue : Part II, solution as a Hilbert problem

    Transient and busy period analysis of the GI/G/1 queue : Part II, solution as a Hilbert problem by Bertsimas, Dimitris

    Published 2009
    “…Cambridge, Mass. : Center for Computational Research in Economics and Management Science, Sloan School of Management, Massachusetts Institute of Technology…”
    Get full text
    Working Paper

Search Tools: