Technical Note—On Mitten's Axioms for Branch-and-Bound
From MaRDI portal
Publication:4119030
DOI10.1287/opre.24.6.1176zbMath0348.90141OpenAlexW2170423779WikidataQ114598541 ScholiaQ114598541MaRDI QIDQ4119030
Publication date: 1977
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.24.6.1176
Related Items
A PARALLEL BEST-FIRST B&B ALGORITHM AND ITS AXIOMATIZATION ⋮ Optimal dispatching strategy on an airline network after a schedule perturbation ⋮ An effective structured approach to finding optimal partitions of networks ⋮ Unnamed Item ⋮ A hybrid two-stage flowshop with part family, batch production, major and minor set-ups