"A discrete EOQ problem is solvable in O(logn) time."

Alexandr Kovalev, C. T. Ng (2008)

> Home

Details and statistics

DOI: 10.1016/J.EJOR.2006.03.073

access: closed

type: Journal Article

metadata version: 2021-02-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/eor/KovalevN08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eor/KovalevN08
Alexandr Kovalev, C. T. Ng:
A discrete EOQ problem is solvable in O(logn) time. Eur. J. Oper. Res. 189(3): 914-919 (2008)

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.