Discretized formulations for capacitated location problems with modular distribution costs

Mathematics

• Location Problem 91%
• Costs 58%
• Formulation 50%
• Linear Programming Relaxation 33%
• Model 26%
• Network Design 11%
• Facility Location Problem 11%
• Context 11%
• Valid Inequalities 10%
• Knapsack Problem 10%
• Reformulation 9%
• Intuitive 8%
• Computational Results 8%
• Convex Hull 8%
• Variable Coefficients 8%
• Objective function 7%
• Discretization 6%
• Integer 4%

Business & Economics

• Distribution Costs 100%
• Location Problem 92%
• Linear Programming 24%
• Convex Hull 13%
• Knapsack Problem 11%
• Discretization 11%
• Network Design 10%
• Facility Location 10%
• Costs 10%
• Integer 8%
• Objective Function 8%
• Coefficients 6%

Engineering & Materials Science

• Costs 30%
• Relaxation 24%
• Linear programming 24%