Computational results of a semidefinite branch-and-bound algorithm for k-cluster
نویسندگان
چکیده
منابع مشابه
Computational results of a semidefinite branch-and-bound algorithm for k-cluster
This computational paper presents a method to solve k-cluster problems exactly by intersecting semidefinite and polyhedral relaxations. Our algorithm uses a generic branch-and-bound method featuring an improved semidefinite bounding procedure. Extensive numerical experiments show that this algorithm outperforms the best known methods both in time and ability to solve large instances. For the fi...
متن کاملImproved semidefinite branch-and-bound algorithm for k-cluster
This paper presents a method to solve k-cluster problems by intersecting semidefinite and polyhedral relaxations. We use a generic branch-and-bound method featuring an improved semidefinite bounding procedure. Extensive numerical experiments show that our algorithm outperforms the best known methods in both time and ability to solve large instances. For the first time, numerical results are rep...
متن کاملA modified branch and bound algorithm for a vague flow-shop scheduling problem
Uncertainty plays a significant role in modeling and optimization of real world systems. Among uncertain approaches, fuzziness describes impreciseness while for ambiguity another definition is required. Vagueness is a probabilistic model of uncertainty being helpful to include ambiguity into modeling different processes especially in industrial systems. In this paper, a vague set based on dista...
متن کاملA Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations
In this paper we present a method for finding exact solutions of the Max-Cut problem maxxLx such that x ∈ {±1}. We use a semidefinite relaxation combined with triangle inequalities, which we solve with the bundle method. This approach is due to Fischer, Gruber, Rendl, and Sotirov [12] and uses Lagrangian duality to get upper bounds with reasonable computational effort. The expensive part of our...
متن کاملA finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
Existing global optimization techniques for nonconvex quadratic programming (QP) branch by recursively partitioning the convex feasible set and thus generate an infinite number of branch-and-bound nodes. An open question of theoretical interest is how to develop a finite branch-and-bound algorithm for nonconvex QP. One idea, which guarantees a finite number of branching decisions, is to enforce...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Operations Research
سال: 2016
ISSN: 0305-0548
DOI: 10.1016/j.cor.2015.07.008