scientific article; zbMATH DE number 3211377
From MaRDI portal
Publication:5338603
zbMath0129.34201MaRDI QIDQ5338603
Publication date: 1963
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Lagrangean relaxation for a lower bound to a set partitioning problem with side constraints: Properties and algorithms, Unnamed Item, Set partitioning mit linearen Randbedingungen, Classical cuts for mixed-integer programming and branch-and-cut, Enhancing an algorithm for set covering problems, Branch and bound, integer, and non-integer programming, Using cutting planes to solve the symmetric Travelling Salesman problem, Gomory cuts revisited
