Multivariable Branching: A 0-1 Knapsack Problem Case Study
From MaRDI portal
Publication:5084602
DOI10.1287/ijoc.2020.1052OpenAlexW3127891248MaRDI QIDQ5084602
Natashia Boland, Savelsbergh, Martin W. P., Yu Yang
Publication date: 28 June 2022
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2020.1052
Related Items
Learning generalized strong branching for set covering, set packing, and 0-1 knapsack problems ⋮ Knapsack problems -- an overview of recent advances. I: Single knapsack problems ⋮ An abstract model for branch-and-cut ⋮ A study of lattice reformulations for integer programming ⋮ Compressing branch-and-bound trees ⋮ Lower bound on size of branch-and-bound trees for solving lot-sizing problem
Uses Software
Cites Work
- Unnamed Item
- DASH: dynamic approach for switching heuristics
- Non-standard approaches to integer programming
- Column basis reduction and decomposable knapsack problems
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
- Where are the hard knapsack problems?
- Branching rules revisited
- On learning and branching: a survey
- Integer Programming with a Fixed Number of Variables
- An Automatic Method of Solving Discrete Programming Problems
- Hard Knapsack Problems
- Experiments in mixed-integer linear programming using pseudo-costs
- Branch and Bound Methods for Mathematical Programming Systems
- A Computational Study of Search Strategies for Mixed Integer Programming
- Cloud Branching
- Constraint Integer Programming: A New Approach to Integrate CP and MIP
- Experiments in mixed-integer linear programming
- A Machine Learning-Based Approximation of Strong Branching
- Benchmarking optimization software with performance profiles.
This page was built for publication: Multivariable Branching: A 0-1 Knapsack Problem Case Study
