"Combinatorial optimization with interaction costs: Complexity and solvable ..."

Stefan Lendl, Ante Custic, Abraham P. Punnen (2019)

> Home

Details and statistics

DOI: 10.1016/J.DISOPT.2019.03.004

access: closed

type: Journal Article

metadata version: 2025-01-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/disopt/LendlCP19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/disopt/LendlCP19
Stefan Lendl, Ante Custic, Abraham P. Punnen:
Combinatorial optimization with interaction costs: Complexity and solvable cases. Discret. Optim. 33: 101-117 (2019)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.