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

DOI10.1287/OPRE.19.1.115MaRDI QIDQ5620475zbMATH OpenOpenAlexFDO

Authors 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)

Cited in

(4)

• Some new perspectives for solving 0--1 integer programming problems using balas method
• Methods for a class of discrete location problems
• Reliability optimization of a series system with active and standby redundancy
• 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

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