Strong formulations and cutting planes for designing digital data service networks.
Youngho LeeLu LuYuping QiuFred W. GloverPublished in: Telecommun. Syst. (1993)
Keyphrases
- digital data
- cutting plane
- mixed integer linear programming
- valid inequalities
- data collection
- integer programming
- integer programming problems
- lower bound
- digital images
- big data
- column generation
- digital content
- mixed integer
- digital media
- knapsack problem
- integer program
- network structure
- social networks
- databases
- network flow
- traveling salesman problem
- information processing