Some new perspectives for solving 0--1 integer programming problems using balas method
type: Item
instance of: scholarly article
title: Some new perspectives for solving 0--1 integer programming problems using balas method
author: Yanyan Li
published in: Computational Management Science
publication date: 2021-11-24T00:00:00Z
Mathematics Subject Classification ID: 90Bxx
zbMATH DE Number: 7432765
zbMATH Keywords: branch and bound
zbMATH Keywords: integer programming
zbMATH Keywords: implicit enumeration
zbMATH Keywords: balas method
MaRDI profile type: Publication
full work available at URL: s10287-021-00389-6
OpenAlex ID: W3136517660
cites work: An Additive Algorithm for Solving Linear Programs with Zero-One Variables
cites work: Generalized best-first search strategies and the optimality of A*
cites work: Integer Programming by Implicit Enumeration and Balas’ Method
cites work: A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
cites work: Theoretical comparisons of search strategies in branch-and-bound algorithms
cites work: An Automatic Method of Solving Discrete Programming Problems
cites work: Branch-and-Bound Methods: A Survey
cites work: Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
cites work: Q4310697
cites work: Q4040221
cites work: Q4077727
cites work: Technical Note—A Flexible Tree-Search Method for Integer Programming Problems
cites work: Q3998259
DOI: 10.1007/S10287-021-00389-6
description: scientific article; zbMATH DE number 7432765