Branching from the largest upper bound. Folklore and facts
type: Item
instance of: scholarly article
title: Branching from the largest upper bound. Folklore and facts
zbMATH Open document ID: 0381.90075
DOI: 10.1016/0377-2217(78)90092-9
published in: European Journal of Operational Research
publication date: 1978-01-01T00:00:00Z
full work available at URL: erasmus095.pdf
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 3593316
author: Bennett L. Fox
author: Jan Karel Lenstra
author: Alexander H. G. Rinnooy Kan
author: Linus Schrage
MaRDI profile type: Publication
OpenAlex ID: W2084904294
cites work: Q4773298
cites work: Experiments in mixed-integer linear programming
cites work: Shortest-Route Methods: 2. Group Knapsacks, Expanded Networks, and Branch-and-Bound
cites work: Accelerating List Processing in Discrete Programming
cites work: Q3214706
cites work: An Improved Implicit Enumeration Approach for Integer Programming
cites work: Branch-and-Bound Methods: A Survey
description: scientific article; zbMATH DE number 3593316