B. KALANTARI and A. BAGCHI. An algorithm for quadratic zero-one programs. Naval Research Logistics, 37: 527--538, 1990. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Solving Quadratic (0,1)-Problems by Semidefinite Programs and .. - Helmberg, Rendl (1995) (Correct)
....to the results reported in [3] even though the approaches are completely unrelated. The method works well, if some sort of diagonal dominance holds for the cost function, or if the problem is very sparse. It seems to fail on dense problems of quite modest size (n = 50) Kalantari and Bagchi [24] propose a Branch and Bound scheme where they bound (QP) by a linear convex envelope from below. Computational results on small problems (n 50) indicate that again the efficiency of the approach deteriorates quickly with increasing problem size. There exist several older computational studies ....
B. KALANTARI and A. BAGCHI. An algorithm for quadratic zero-one programs. Naval Research Logistics, 37: 527--538, 1990.
Heuristic Algorithms for the Unconstrained Binary Quadratic.. - Beasley (1998) (4 citations) (Correct)
....results were presented for problems of various sizes up to n=40. Helmberg and Rendl [22] presented a tree search algorithm combining cutting planes and a bound based upon semidefinite relaxation. Computational results were presented for problems of various sizes up to n=450. Kalantari and Bagchi [23] presented a tree search algorithm based on transforming the problem into an equivalent concave optimisation problem which can be tackled using an algorithm due to Kalantari and Rosen [24] Computational results were presented for problems of various sizes up to n=50. Palubeckis [32] presented a ....
B. Kalantari and A. Bagchi, An algorithm for quadratic zero-one programs. Naval Research Logistics 37 (1990) 527-538.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC