"Knapsack feasibility as an absolute value equation solvable by successive ..."

O. L. Mangasarian (2009)

> Home

Details and statistics

DOI: 10.1007/S11590-008-0102-9

access: closed

type: Journal Article

metadata version: 2020-07-03

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ol/Mangasarian09a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ol/Mangasarian09a
O. L. Mangasarian:
Knapsack feasibility as an absolute value equation solvable by successive linear programming. Optim. Lett. 3(2): 161-170 (2009)

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.