A discrete EOQ problem is solvable in \(O(\log n)\) time (Q2482773)

From MaRDI portal
Revision as of 07:18, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
A discrete EOQ problem is solvable in \(O(\log n)\) time
scientific article

    Statements

    A discrete EOQ problem is solvable in \(O(\log n)\) time (English)
    0 references
    0 references
    24 April 2008
    0 references
    EOQ
    0 references
    inventory management
    0 references
    discrete optimization
    0 references

    Identifiers