Technical Note—A Flexible Tree-Search Method for Integer Programming Problems

DOI10.1287/opre.19.1.115zbMath0216.54403OpenAlexW2140196031MaRDI QIDQ5620475

N. P. Tuan

Publication date: 1971

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.19.1.115

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items (4)

Methods for a class of discrete location problems ⋮ Reliability optimization of a series system with active and standby redundancy ⋮ Some new perspectives for solving 0--1 integer programming problems using balas method ⋮ Depth-m search in branch-and-bound algorithms

This page was built for publication: Technical Note—A Flexible Tree-Search Method for Integer Programming Problems