Integer programming approach to optimal smoothing of two-state Markov sequences.
Katsuji UosakiPublished in: ICASSP (1986)
Keyphrases
- integer programming
- np hard
- linear programming
- optimal solution
- cutting plane algorithm
- ai planning
- column generation
- constraint programming
- state space
- lagrangian relaxation
- set covering problem
- production planning
- cutting plane
- set covering
- network flow
- valid inequalities
- facility location
- vehicle routing problem with time windows
- dynamic programming
- crew scheduling
- dantzig wolfe decomposition
- set partitioning
- inference problems
- integer program
- minimum cost
- search algorithm