Publication:5650510
From MaRDI portal
zbMath0238.90045MaRDI QIDQ5650510
Publication date: 1968
90C10: Integer programming
Related Items
An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs, Complexity evaluation of benchmark instances for the \(p\)-median problem, Pseudo-Boolean optimization, Equivalent instances of the simple plant location problem, The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds, Branch and peg algorithms for the simple plant location problem., Fast bounding procedures for large instances of the simple plant location problem, Branch and peg algorithms for the simple plant location problem, The simple plant location problem: Survey and synthesis