Some new perspectives for solving 0--1 integer programming problems using balas method
From MaRDI portal
Publication:2051155
DOI10.1007/s10287-021-00389-6OpenAlexW3136517660MaRDI QIDQ2051155
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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
- An Automatic Method of Solving Discrete Programming Problems
- Generalized best-first search strategies and the optimality of A*
- Theoretical comparisons of search strategies in branch-and-bound algorithms
- An Additive Algorithm for Solving Linear Programs with Zero-One Variables
- Branch-and-Bound Methods: A Survey
- A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
- Integer Programming by Implicit Enumeration and Balas’ Method
- Technical Note—A Flexible Tree-Search Method for Integer Programming Problems
This page was built for publication: Some new perspectives for solving 0--1 integer programming problems using balas method
