"A strongly polynomial algorithm for line search in submodular polyhedra."

Kiyohito Nagano (2007)

> Home

Details and statistics

DOI: 10.1016/J.DISOPT.2007.09.002

access: open

type: Journal Article

metadata version: 2021-02-12

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/disopt/Nagano07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/disopt/Nagano07
Kiyohito Nagano:
A strongly polynomial algorithm for line search in submodular polyhedra. Discret. Optim. 4(3-4): 349-359 (2007)

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.