Some new perspectives for solving 0--1 integer programming problems using balas method

DOI10.1007/S10287-021-00389-6MaRDI QIDQ2051155zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 24 November 2021

Published in Computational Management Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10287-021-00389-6

zbMATH Keywords

balas methodbranch and boundimplicit enumerationinteger programming

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Recommendations

• Resolution search and dynamic branch-and-bound
• A heuristic 0-1 integer programming method
• Implicit Enumeration for the Pure Integer 0/1 Minimax Programming Problem
• Resolution search
• scientific article; zbMATH DE number 3906237

Cites work

• A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
• An Additive Algorithm for Solving Linear Programs with Zero-One Variables
• An Automatic Method of Solving Discrete Programming Problems
• Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
• Branch-and-Bound Methods: A Survey
• Generalized best-first search strategies and the optimality of A*
• scientific article; zbMATH DE number 49472 (Why is no real title available?)
• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• scientific article; zbMATH DE number 3495856 (Why is no real title available?)
• scientific article; zbMATH DE number 680244 (Why is no real title available?)
• Integer Programming by Implicit Enumeration and Balas’ Method
• Technical Note—A Flexible Tree-Search Method for Integer Programming Problems
• Theoretical comparisons of search strategies in branch-and-bound algorithms

This page was built for publication: Some new perspectives for solving 0--1 integer programming problems using balas method

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