Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"On the Complexity of a Cutting Plane Algorithm for Solving Combinatorial ..."

E. Andrew Boyd (1996)

> Home

Details and statistics

DOI: 10.1137/S089548019325900X

access: closed

type: Journal Article

metadata version: 2020-04-25

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/siamdm/Boyd96
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamdm/Boyd96
E. Andrew Boyd:
On the Complexity of a Cutting Plane Algorithm for Solving Combinatorial Linear Programs. SIAM J. Discret. Math. 9(3): 365-376 (1996)

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.