Confidentiality preserving integer programming for global routing.
Hamid ShojaeiAzadeh DavoodiParmeswaran RamanathanPublished in: DAC (2012)
Keyphrases
- integer programming
- np hard
- linear programming
- ai planning
- set covering
- network flow
- cutting plane algorithm
- set covering problem
- facility location
- valid inequalities
- cutting plane
- production planning
- column generation
- lagrangian relaxation
- integer program
- linear programming relaxation
- constraint programming
- inference problems
- routing problem
- routing algorithm
- set partitioning
- multicast routing
- reinforcement learning
- integer programming formulations
- vehicle routing problem with time windows
- wireless networks
- search space
- objective function