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

DOI10.1016/J.ORL.2022.04.008OpenAlexW4281395103MaRDI QIDQ2083992FDOQ2083992

Authors 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

lot-sizinglower boundbranch-and-bound

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Recommendations

• Lower bounds on the size of general branch-and-bound trees
• Lot-trees: A unifying view and efficient implementation of forward procedures for the dynamic lot-size problem
• Bounds on the size of branch-and-bound proofs for integer knapsacks
• Lot-sizing on a tree
• A branch and bound algorithm for a single item nonconvex dynamic lot sizing problem with capacity constraints

Cites work

• scientific article; zbMATH DE number 4202031 (Why is no real title available?)
• scientific article; zbMATH DE number 7561762 (Why is no real title available?)
• A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time
• An Automatic Method of Solving Discrete Programming Problems
• Approximate extended formulations
• Approximating polyhedra with sparse inequalities
• Basis reduction and the complexity of branch-and-bound
• Dynamic version of the economic lot size model
• Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case
• Hard Knapsack Problems
• Improved Algorithms for Economic Lot Size Problems
• Multivariable Branching: A 0-1 Knapsack Problem Case Study
• Production Planning by Mixed Integer Programming
• Trivial integer programs unsolvable by branch-and-bound
• Uncapacitated lot-sizing: The convex hull of solutions

Cited in

(2)

• Lower bound on size of branch-and-bound trees for solving lot-sizing problem
• Estimating the Size of Branch-and-Bound Trees

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2083992)