Login / Signup
A branch and bound algorithm for a single item nonconvex dynamic lot sizing problem with capacity constraints.
S. Selçuk Erengüç
Yasemin Aksoy
Published in:
Comput. Oper. Res. (1990)
Keyphrases
</>
branch and bound algorithm
capacity constraints
single item
upper bound
lower bound
lot sizing
setup cost
lagrangian relaxation
branch and bound
lead time
objective function
precedence constraints
infinite horizon
optimization problems
multi item
worst case
optimal solution
np hard
multistage
combinatorial optimization
single machine scheduling problem
long run
holding cost
special case
finite horizon
search algorithm
combinatorial auctions
cost function
mixed integer programming
processing times
resource allocation
evolutionary algorithm
optimal policy
linear programming