Lower bound on size of branch-and-bound trees for solving lot-sizing problem

DOI10.1016/j.orl.2022.04.008OpenAlexW4281395103MaRDI QIDQ2083992

Santanu S. Dey, Prachi Shah

Publication date: 17 October 2022

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2112.03965

zbMATH Keywords

branch-and-boundlower boundlot-sizing

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximating polyhedra with sparse inequalities
• Approximate extended formulations
• Dynamic Version of the Economic Lot Size Model
• An Automatic Method of Solving Discrete Programming Problems
• Uncapacitated lot-sizing: The convex hull of solutions
• Hard Knapsack Problems
• A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time
• Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case
• Improved Algorithms for Economic Lot Size Problems
• Trivial integer programs unsolvable by branch-and-bound
• Multivariable Branching: A 0-1 Knapsack Problem Case Study
• Production Planning by Mixed Integer Programming

This page was built for publication: Lower bound on size of branch-and-bound trees for solving lot-sizing problem