Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"A fully polynomial epsilon approximation cutting plane algorithm for ..."

E. Andrew Boyd (1997)

> Home

Details and statistics

DOI: 10.1016/S0167-6377(96)00048-X

access: closed

type: Journal Article

metadata version: 2017-05-27

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/orl/Boyd97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/orl/Boyd97
E. Andrew Boyd:
A fully polynomial epsilon approximation cutting plane algorithm for solving combinatorial linear programs containing a sufficiently large ball. Oper. Res. Lett. 20(2): 59-63 (1997)

a service of

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.