A new discrete filled function method for finding global minimizer of the integer programming.
Hongwei LinYuping WangLei FanYuelin GaoPublished in: Appl. Math. Comput. (2013)
Keyphrases
- integer programming
- np hard
- linear programming
- constraint programming
- production planning
- set covering problem
- ai planning
- lagrangian relaxation
- cutting plane algorithm
- facility location
- crew scheduling
- set covering
- integer program
- cutting plane
- cost function
- column generation
- sufficient conditions
- network flow
- filled function method
- valid inequalities
- transportation problem
- inference problems
- vehicle routing problem with time windows
- loss function
- reinforcement learning
- integer programming formulations