N. Karmarkar, M.G.C. Resende, and K.G. Ramakrishnan. An interior point approach to the maximum independent set problem in dense random graphs. In Proceedings of the XIII Latin American Conference on Informatics, volume 1, pages 241--260, Santiago, Chile, July 1989. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
The Maximum Clique Problem - Bomze, Budinich, Pardalos, Pelillo (1999) (30 citations) (Correct)
....of all possible graphs one can exploit the characteristics of the given subset to obtain sharper bounds. A much studied case is that of randomly generated graphs. For these graphs there exists a well established theory [53] and research proceeds in several directions; for example see [55] 123] [194], 230] and [237] for eigenvalues of random graphs. In the specific field of maximum cliques a well known result, due to Matula, accurately predicts the size of the maximum clique when the number of vertices n is sufficiently large [231] In particular Matula was able to prove that the probability ....
N. Karmarkar, K.G. Ramakrishnan and M.G.C. Resende, An interior point approach to the maximum independent set problem in dense random graphs, Proc. XV Latin American Conference on Informatics, Santiago, Chile, I: 241--260, 1989.
Interior Point Methods for Combinatorial Optimization - Mitchell, Pardalos, al. (1998) (4 citations) Self-citation (Resende) (Correct)
....altering the trajectory followed by the algorithm. Most combinatorial optimization problems have very natural equivalent integer and quadratic programming formulations [113] The algorithms described in this section have been applied to a variety of problems, including maximum independent set [78], set covering [77] satisfiability [71, 134] inductive inference [69, 70] and frequency assignment in cellular telephone systems [143] 8 A lower bounding technique A lower bound for the globally optimal solution of the quadratic program min q(x) 1 2 x T Qx c T x (92) subject to ....
N. Karmarkar, M.G.C. Resende, and K.G. Ramakrishnan. An interior point approach to the maximum independent set problem in dense random graphs. In Proceedings of the XIII Latin American Conference on Informatics, volume 1, pages 241--260, Santiago, Chile, July 1989.
A Continuous Approach to Inductive Inference - Kamath (1992) (18 citations) Self-citation (Karmarkar Resende Ramakrishnan) (Correct)
....minima and hence do not correspond to the solution of the original problem. In [10] Karmarkar describes a class of potential functions with good topological properties, such as having connected level sets, which has led to successful interior point methods for several problems, e.g. 12] 9] [13], 18] Guided by these results, we investigate the application of a similar approach for inductive inference. For related work, see e.g. 2] 5] and [25] Before we continue, we require some definitions. Consider the Boolean function F : f0; 1g n f0; 1g. An element of the domain of F is ....
N.K. Karmarkar, M.G.C. Resende, and K.G. Ramakrishnan. An interior-point approach to the maximum independent set problem in dense random graphs. In Proceedings of the XV Latin American Conference on Informatics, pages 241--260, July 1989.
Interior Point Methods For Global Optimization - Pardalos, Resende (1996) (1 citation) Self-citation (Resende) (Correct)
....altering the trajectory followed by the algorithm. Most combinatorial optimization problems have very natural equivalent integer and quadratic programming formulations [26] The algorithms described in this section have been applied to a variety of problems, including maximum independent set [16], set covering [15] satisfiability [13, 30] inductive inference [11, 12] and frequency assignment in cellular telephone systems [34] 4. Affine scaling algorithm for general quadratic programming. The affine scaling algorithm for linear programming, introduced by Dikin [3] and rediscovered ....
N. Karmarkar, M.G.C. Resende, and K.G. Ramakrishnan. An interior point approach to the maximum independent set problem in dense random graphs. In Proceedings of the XIII Latin American Conference on Informatics, volume 1, pages 241--260, Santiago, Chile, July 1989.
Interior Point Methods for Combinatorial Optimization - Mitchell, Pardalos, Resende (1998) (4 citations) Self-citation (Resende) (Correct)
....altering the trajectory followed by the algorithm. Most combinatorial optimization problems have very natural equivalent integer and quadratic programming formulations [113] The algorithms described in this section have been applied to a variety of problems, including maximum independent set [78], set covering [77] satisfiability [71, 134] inductive inference [69, 70] and frequency assignment in cellular telephone systems [143] 8. A LOWER BOUNDING TECHNIQUE A lower bound for the globally optimal solution of the quadratic program min q(x) 1 2 x T Qx c T x (92) subject to x ....
N. Karmarkar, M.G.C. Resende, and K.G. Ramakrishnan. An interior point approach to the maximum independent set problem in dense random graphs. In Proceedings of the XIII Latin American Conference on Informatics, volume 1, pages 241--260, Santiago, Chile, July 1989.
Experimental Analyses of the Life Span Method for the Maximum .. - Fujisawa, Kubo (1995) (Correct)
No context found.
N. K. Karmarkar, K. G. Ramakrishnan, and M. G. C. Resende. An interior point approach to the maximum independent set problem in dense random graphs. In Proceedings of the XV Latin American Conference on Informatics I, pages 241--260, 1989.
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