Combinatorial optimization with interaction costs: Complexity and solvable cases (bibtex)

by Stefan Lendl, Ante Ćustić and Abraham P Punnen

Reference:

Stefan Lendl, Ante Ćustić and Abraham P Punnen, Combinatorial optimization with interaction costs: Complexity and solvable cases, Discrete optimization, 33, 101–117, (2019).

Bibtex Entry:

@Article{LendlEtAl2019,
  arxiv       = {1707.02428},
  author      = {Lendl, Stefan and {\'C}usti{\'c}, Ante and Punnen, Abraham P},
  journal     = {Discrete optimization},
  title       = {Combinatorial optimization with interaction costs: Complexity and solvable cases},
  year        = {2019},
  pages       = {101--117},
  volume      = {33},
  doi         = {10.1016/j.disopt.2019.03.004},
  groups      = {Project07 (Klinz), MultipleStudents, Student, External},
  mrnumber    = {3991447},
  xxpublisher = {Elsevier},
}