"Relaxation, New Combinatorial and Polynomial Algorithms for the Linear ..."

Ulrich Betke (2004)

> Home

Details and statistics

DOI: 10.1007/S00454-004-2878-4

access: open

type: Journal Article

metadata version: 2023-07-27

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dcg/Betke04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dcg/Betke04
Ulrich Betke:
Relaxation, New Combinatorial and Polynomial Algorithms for the Linear Feasibility Problem. Discret. Comput. Geom. 32(3): 317-338 (2004)

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.