Continuous Variables - Variables can attain any value between lower and upper bound
Discrete - Variables with particular values - Size, Binary, Set of values
Ref - Link1
Branch-and-Bound (BB) method. – the framework for almost all commercial software for solving
mixed integer linear programs. Basis of all modern MILP codes.
Algo ref
Branch and Cut - Pure cutting plane algorithms. Ineffective for large Mixed Integer Linear Programming.
Ref - Link 2
Notes
If the given problem is a discrete optimization problem, a branch and bound is a good choice.
Branch and bound work efficiently on the combinatory optimization problems
Ref - Link
Papers
- Combining regression models and metaheuristics to optimize space allocation in the retail industry
- AN INVESTIGATION OF AUTOMATED PLANOGRAMS USING A SIMULATED
- ANNEALING BASED HYPER-HEURISTIC
- A Heuristic Approach for a Shelf Space Allocation Problem
- Layout Optimization and Promotional Strategies Design in a Retail Store based on a Market Basket Analysis
- A New Hybrid Optimization Algorithm for the Optimal Allocation of Goods in Shop Shelves
- Shelf Space Allocation: A Critical Review and a Model with Price Changes and Adjustable Shelf Heights
- Optimization Algorithms for the Shelf Space Allocation Problem
- Interaction Between Shelf Layout and Marketing Effectiveness and its Impact on Optimizing
- Shelf Arrangements
- An Implementation of the Branch-and-Price Algorithm Applied to Opportunistic Maintenance PlanningBranch and Cut: An Empirical Study
Keep Exploring!!!
No comments:
Post a Comment