BibTeX records: Farin Mohammadi

download as .bib file

@article{DBLP:journals/coap/KenningtonM97a,
  author       = {Jeffery L. Kennington and
                  Farin Mohammadi},
  title        = {A Truncated Exponential Algorithm for the Lightly Constrained Assignment
                  Problem},
  journal      = {Comput. Optim. Appl.},
  volume       = {8},
  number       = {3},
  pages        = {287--299},
  year         = {1997},
  url          = {https://doi.org/10.1023/A:1008679623419},
  doi          = {10.1023/A:1008679623419},
  timestamp    = {Tue, 14 Jul 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/coap/KenningtonM97a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/coap/KenningtonM95,
  author       = {Jeffery L. Kennington and
                  Farin Mohammadi},
  title        = {The singly constrained assignment problem: An {AP} basis algorithm},
  journal      = {Comput. Optim. Appl.},
  volume       = {4},
  number       = {4},
  pages        = {347--374},
  year         = {1995},
  url          = {https://doi.org/10.1007/BF01300862},
  doi          = {10.1007/BF01300862},
  timestamp    = {Tue, 14 Jul 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/coap/KenningtonM95.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/coap/KenningtonM94,
  author       = {Jeffery L. Kennington and
                  Farin Mohammadi},
  title        = {The singly constrained assignment problem: {A} Lagrangian relaxation
                  heuristic algorithm},
  journal      = {Comput. Optim. Appl.},
  volume       = {3},
  number       = {1},
  pages        = {7--26},
  year         = {1994},
  url          = {https://doi.org/10.1007/BF01299389},
  doi          = {10.1007/BF01299389},
  timestamp    = {Tue, 14 Jul 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/coap/KenningtonM94.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics