"Infinite linear programming and online searching with turn cost."

Spyros Angelopoulos, Diogo Arsénio, Christoph Dürr (2017)

> Home

Details and statistics

DOI: 10.1016/J.TCS.2017.01.013

access: closed

type: Journal Article

metadata version: 2020-10-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/tcs/AngelopoulosAD17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/AngelopoulosAD17
Spyros Angelopoulos, Diogo Arsénio, Christoph Dürr:
Infinite linear programming and online searching with turn cost. Theor. Comput. Sci. 670: 11-22 (2017)

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.