Optimal volume subintervals with k points and star discrepancy via integer programming.
Eric ThiémardPublished in: Math. Methods Oper. Res. (2001)
Keyphrases
- integer programming
- np hard
- network flow
- lagrangian relaxation
- facility location
- column generation
- optimal solution
- set covering
- cutting plane algorithm
- ai planning
- constraint programming
- linear programming
- inference problems
- production planning
- cutting plane
- integer program
- valid inequalities
- crew scheduling
- dynamic programming
- set covering problem
- set partitioning
- dantzig wolfe decomposition
- network design problem
- branch and bound algorithm
- data points
- special case