Branching from the largest upper bound. Folklore and facts (Q1247917): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Bennett L. Fox / rank
 
Normal rank
Property / author
 
Property / author: Jan Karel Lenstra / rank
 
Normal rank
Property / author
 
Property / author: Alexander H. G. Rinnooy Kan / rank
 
Normal rank
Property / author
 
Property / author: Linus Schrage / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2084904294 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4773298 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experiments in mixed-integer linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest-Route Methods: 2. Group Knapsacks, Expanded Networks, and Branch-and-Bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerating List Processing in Discrete Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3214706 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Implicit Enumeration Approach for Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-Bound Methods: A Survey / rank
 
Normal rank

Latest revision as of 23:46, 12 June 2024

scientific article
Language Label Description Also known as
English
Branching from the largest upper bound. Folklore and facts
scientific article

    Statements