Generating optimal drawings of physically realizable symbol maps with integer programming.
Guilherme KunigamiPedro J. de RezendeCid C. de SouzaTallys H. YunesPublished in: Vis. Comput. (2012)
Keyphrases
- integer programming
- np hard
- linear programming
- ai planning
- production planning
- symbol recognition
- lagrangian relaxation
- integer program
- constraint programming
- column generation
- optimal solution
- cutting plane
- network flow
- facility location
- set covering problem
- inference problems
- vehicle routing problem with time windows
- set covering
- dynamic programming
- cutting plane algorithm
- worst case
- dantzig wolfe decomposition
- linear programming relaxation
- minimum cost
- knapsack problem
- particle swarm optimization
- upper bound