scientific article; zbMATH DE number 3378707
From MaRDI portal
zbMath0238.90045MaRDI QIDQ5650510
Publication date: 1968
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Solving the \(p\)-median problem on regular and lattice networks, An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs, On a class of subadditive duals for the uncapacitated facility location problem, Complexity evaluation of benchmark instances for the \(p\)-median problem, Branch and peg algorithms for the simple plant location problem., The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds, Data aggregation for \(p\)-median problems, Berge-acyclic multilinear 0-1 optimization problems, Fast bounding procedures for large instances of the simple plant location problem, Pseudo-Boolean optimization, Branch and peg algorithms for the simple plant location problem, Equivalent instances of the simple plant location problem, The simple plant location problem: Survey and synthesis
