Approximated closed-form minimum-cost solutions to the (S - 1, S) policy with complete backordering.
Marcello BragliaDavide CastellanoMarco FrosoliniPublished in: Int. J. Math. Oper. Res. (2016)
Keyphrases
- closed form
- minimum cost
- closed form solutions
- np hard
- network flow problem
- approximation algorithms
- network flow
- spanning tree
- capacity constraints
- optimal solution
- network simplex algorithm
- point correspondences
- iterative procedure
- optimal policy
- linear combination
- minimum cost flow
- natural image matting
- state space
- moving objects