BibTeX records: Eissa Nematollahi

• > Home > Persons > Eissa Nematollahi

@article{DBLP:journals/candie/GzaraND14,
  author       = {Fatma Gzara and
                  Eissa Nematollahi and
                  Abdullah Dasci},
  title        = {Linear location-inventory models for service parts logistics network
                  design},
  journal      = {Comput. Ind. Eng.},
  volume       = {69},
  pages        = {53--63},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.cie.2013.12.014},
  doi          = {10.1016/J.CIE.2013.12.014},
  timestamp    = {Thu, 20 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/candie/GzaraND14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/DezaNT08,
  author       = {Antoine Deza and
                  Eissa Nematollahi and
                  Tam{\'{a}}s Terlaky},
  title        = {How good are interior point methods? Klee-Minty cubes tighten iteration-complexity
                  bounds},
  journal      = {Math. Program.},
  volume       = {113},
  number       = {1},
  pages        = {1--14},
  year         = {2008},
  url          = {https://doi.org/10.1007/s10107-006-0044-x},
  doi          = {10.1007/S10107-006-0044-X},
  timestamp    = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/DezaNT08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ol/NematollahiT08,
  author       = {Eissa Nematollahi and
                  Tam{\'{a}}s Terlaky},
  title        = {A simpler and tighter redundant Klee-Minty construction},
  journal      = {Optim. Lett.},
  volume       = {2},
  number       = {3},
  pages        = {403--414},
  year         = {2008},
  url          = {https://doi.org/10.1007/s11590-007-0068-z},
  doi          = {10.1007/S11590-007-0068-Z},
  timestamp    = {Fri, 03 Jul 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ol/NematollahiT08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/orl/NematollahiT08,
  author       = {Eissa Nematollahi and
                  Tam{\'{a}}s Terlaky},
  title        = {A redundant Klee-Minty construction with all the redundant constraints
                  touching the feasible region},
  journal      = {Oper. Res. Lett.},
  volume       = {36},
  number       = {4},
  pages        = {414--418},
  year         = {2008},
  url          = {https://doi.org/10.1016/j.orl.2008.02.004},
  doi          = {10.1016/J.ORL.2008.02.004},
  timestamp    = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/orl/NematollahiT08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/oms/DezaNPT06,
  author       = {Antoine Deza and
                  Eissa Nematollahi and
                  M. Reza Peyghami and
                  Tam{\'{a}}s Terlaky},
  title        = {The central path visits all the vertices of the Klee-Minty cube},
  journal      = {Optim. Methods Softw.},
  volume       = {21},
  number       = {5},
  pages        = {851--865},
  year         = {2006},
  url          = {https://doi.org/10.1080/10556780500407725},
  doi          = {10.1080/10556780500407725},
  timestamp    = {Thu, 24 Sep 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/oms/DezaNPT06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}