Integer programming approach for directed minimum spanning tree problem on temporal graphs.
Takuto IkutaTakuya AkibaPublished in: NDA@SIGMOD (2016)
Keyphrases
- integer programming
- np hard
- linear programming
- constraint programming
- column generation
- set covering
- ai planning
- lagrangian relaxation
- set covering problem
- cutting plane
- facility location
- cutting plane algorithm
- crew scheduling
- temporal information
- integer program
- integer programming formulations
- valid inequalities
- production planning
- network flow
- vehicle routing problem with time windows
- inference problems
- constraint satisfaction
- dynamic programming
- lower bound
- dantzig wolfe decomposition
- bayesian networks