BibTeX records: Ludo van der Heyden

download as .bib file

@article{DBLP:journals/msom/WuLH08,
  author       = {Yaozhong Wu and
                  Christoph H. Loch and
                  Ludo van der Heyden},
  title        = {A Model of Fair Process and Its Limits},
  journal      = {Manuf. Serv. Oper. Manag.},
  volume       = {10},
  number       = {4},
  pages        = {637--653},
  year         = {2008},
  url          = {https://doi.org/10.1287/msom.1070.0189},
  doi          = {10.1287/MSOM.1070.0189},
  timestamp    = {Thu, 01 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/msom/WuLH08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/DenardoRH04,
  author       = {Eric V. Denardo and
                  Uriel G. Rothblum and
                  Ludo van der Heyden},
  title        = {Index Policies for Stochastic Search in a Forest with an Application
                  to R{\&}D Project Management},
  journal      = {Math. Oper. Res.},
  volume       = {29},
  number       = {1},
  pages        = {162--181},
  year         = {2004},
  url          = {https://doi.org/10.1287/moor.1030.0072},
  doi          = {10.1287/MOOR.1030.0072},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mor/DenardoRH04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/WhiteCH85,
  author       = {Philip M. White and
                  Andrew S. Caplin and
                  Ludo van der Heyden},
  title        = {Scarf's Procedure for Integer Programming and a Dual Simplex Algorithm},
  journal      = {Math. Oper. Res.},
  volume       = {10},
  number       = {3},
  pages        = {439--449},
  year         = {1985},
  url          = {https://doi.org/10.1287/moor.10.3.439},
  doi          = {10.1287/MOOR.10.3.439},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mor/WhiteCH85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/Heyden82,
  author       = {Ludo van der Heyden},
  title        = {A Refinement Procedure for Computing Fixed Points Using Scarf's Primitive
                  Sets},
  journal      = {Math. Oper. Res.},
  volume       = {7},
  number       = {2},
  pages        = {295--313},
  year         = {1982},
  url          = {https://doi.org/10.1287/moor.7.2.295},
  doi          = {10.1287/MOOR.7.2.295},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mor/Heyden82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/Heyden82a,
  author       = {Ludo van der Heyden},
  title        = {Restricted Primitive Sets and Simplicial Subdivisions with Arbitrary
                  Refinement Factors},
  journal      = {Math. Oper. Res.},
  volume       = {7},
  number       = {3},
  pages        = {383--400},
  year         = {1982},
  url          = {https://doi.org/10.1287/moor.7.3.383},
  doi          = {10.1287/MOOR.7.3.383},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mor/Heyden82a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/Heyden81,
  author       = {Ludo van der Heyden},
  title        = {Scheduling Jobs with Exponential Processing and Arrival Times on Identical
                  Processors so as to Minimize the Expected Makespan},
  journal      = {Math. Oper. Res.},
  volume       = {6},
  number       = {2},
  pages        = {305--312},
  year         = {1981},
  url          = {https://doi.org/10.1287/moor.6.2.305},
  doi          = {10.1287/MOOR.6.2.305},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mor/Heyden81.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Heyden80,
  author       = {Ludo van der Heyden},
  title        = {A variable dimension algorithm for the linear complementarity problem},
  journal      = {Math. Program.},
  volume       = {19},
  number       = {1},
  pages        = {328--346},
  year         = {1980},
  url          = {https://doi.org/10.1007/BF01581652},
  doi          = {10.1007/BF01581652},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/Heyden80.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics