Dantzig

Results: 56



#Item
11SOME HISTORY OF STOCHASTIC PROGRAMMING Early 1950’s: in applications of Linear Programming – unknown values of coefficients: demands, technological coefficients, yields, etc. QUOTATION – Dantzig, Interfaces 20,1990

SOME HISTORY OF STOCHASTIC PROGRAMMING Early 1950’s: in applications of Linear Programming – unknown values of coefficients: demands, technological coefficients, yields, etc. QUOTATION – Dantzig, Interfaces 20,1990

Add to Reading List

Source URL: www.karlin.mff.cuni.cz

Language: English - Date: 2008-04-27 02:30:28
    12The Dantzig selector: statistical estimation when p is much larger than n Emmanuel Candes† and Terence Tao] † Applied and Computational Mathematics, Caltech, Pasadena, CADepartment of Mathematics, University

    The Dantzig selector: statistical estimation when p is much larger than n Emmanuel Candes† and Terence Tao] † Applied and Computational Mathematics, Caltech, Pasadena, CADepartment of Mathematics, University

    Add to Reading List

    Source URL: statweb.stanford.edu

    Language: English - Date: 2007-01-25 20:27:20
      13Submitted to the Annals of Statistics REJOINDER: THE DANTZIG SELECTOR: STATISTICAL ESTIMATION WHEN P IS MUCH LARGER THAN N `s∗ and Terence Tao By Emmanuel J. Cande

      Submitted to the Annals of Statistics REJOINDER: THE DANTZIG SELECTOR: STATISTICAL ESTIMATION WHEN P IS MUCH LARGER THAN N `s∗ and Terence Tao By Emmanuel J. Cande

      Add to Reading List

      Source URL: statweb.stanford.edu

      Language: English - Date: 2007-10-08 18:47:20
        14Decomposition and Dynamic Cut Generation in Integer Programming: Theory and Algorithms T.K. Ralphs∗ M.V. Galati†

        Decomposition and Dynamic Cut Generation in Integer Programming: Theory and Algorithms T.K. Ralphs∗ M.V. Galati†

        Add to Reading List

        Source URL: coral.ie.lehigh.edu

        Language: English - Date: 2010-06-19 14:25:51
        15Computational Experience with Hypergraph-based Methods for Automatic Decomposition in Discrete Optimization Jiadong Wang and Ted Ralphs Department of Industrial and Systems Engineering, Lehigh University, USA

        Computational Experience with Hypergraph-based Methods for Automatic Decomposition in Discrete Optimization Jiadong Wang and Ted Ralphs Department of Industrial and Systems Engineering, Lehigh University, USA

        Add to Reading List

        Source URL: coral.ie.lehigh.edu

        Language: English - Date: 2012-12-26 15:36:44
        16Decomposition and Dynamic Cut Generation in Integer Linear Programming T.K. Ralphs∗ M.V. Galati†

        Decomposition and Dynamic Cut Generation in Integer Linear Programming T.K. Ralphs∗ M.V. Galati†

        Add to Reading List

        Source URL: coral.ie.lehigh.edu

        Language: English - Date: 2010-06-19 14:25:52
        17Microsoft Word - WADS0403.doc

        Microsoft Word - WADS0403.doc

        Add to Reading List

        Source URL: mcs.open.ac.uk

        Language: English - Date: 2005-03-01 07:12:32
        18Computational Experience with Generic Decomposition using the DIP Framework M.V. Galati∗ T.K. Ralphs†

        Computational Experience with Generic Decomposition using the DIP Framework M.V. Galati∗ T.K. Ralphs†

        Add to Reading List

        Source URL: coral.ie.lehigh.edu

        Language: English - Date: 2012-09-15 17:55:19
        19Computation Reuse for Rigid-body Dynamics竄ｬ

        Computation Reuse for Rigid-body Dynamics竄ｬ

        Add to Reading List

        Source URL: www.ists.dartmouth.edu

        Language: English - Date: 2008-09-11 13:40:06
        20Proceedings Third IEEE International Conference on Engineering of Complex Systems, Como, Italy, September 8-12, 1997, pagesProblem Complexity Michael Jackson Independent Consultant 101 Hamilton Terrace, London

        Proceedings Third IEEE International Conference on Engineering of Complex Systems, Como, Italy, September 8-12, 1997, pagesProblem Complexity Michael Jackson Independent Consultant 101 Hamilton Terrace, London

        Add to Reading List

        Source URL: mcs.open.ac.uk

        Language: English - Date: 2002-05-03 11:26:12