The Experts below are selected from a list of 32520 Experts worldwide ranked by ideXlab platform
Nathan Linial - One of the best experts on this subject based on the ideXlab platform.
-
Are stable instances easy
Combinatorics Probability and Computing, 2012Co-Authors: Yonatan Bilu, Nathan LinialAbstract:We introduce the notion of a stable instance for a discrete optimization Problem, and argue that in many practical situations only sufficiently stable instances are of interest. The question then arises whether stable instances of NP-hard Problems are easier to solve, and in particular, whether there exist algorithms that solve in polynomial time all sufficiently stable instances of some NP-hard Problem. The paper focuses on the Max-Cut Problem, for which we show that this is indeed the case.
-
Are stable instances easy
arXiv: Computational Complexity, 2009Co-Authors: Yonatan Bilu, Nathan LinialAbstract:We introduce the notion of a stable instance for a discrete optimization Problem, and argue that in many practical situations only sufficiently stable instances are of interest. The question then arises whether stable instances of NP--hard Problems are easier to solve. In particular, whether there exist algorithms that solve correctly and in polynomial time all sufficiently stable instances of some NP--hard Problem. The paper focuses on the Max--Cut Problem, for which we show that this is indeed the case.
Yonatan Bilu - One of the best experts on this subject based on the ideXlab platform.
-
Are stable instances easy
Combinatorics Probability and Computing, 2012Co-Authors: Yonatan Bilu, Nathan LinialAbstract:We introduce the notion of a stable instance for a discrete optimization Problem, and argue that in many practical situations only sufficiently stable instances are of interest. The question then arises whether stable instances of NP-hard Problems are easier to solve, and in particular, whether there exist algorithms that solve in polynomial time all sufficiently stable instances of some NP-hard Problem. The paper focuses on the Max-Cut Problem, for which we show that this is indeed the case.
-
Are stable instances easy
arXiv: Computational Complexity, 2009Co-Authors: Yonatan Bilu, Nathan LinialAbstract:We introduce the notion of a stable instance for a discrete optimization Problem, and argue that in many practical situations only sufficiently stable instances are of interest. The question then arises whether stable instances of NP--hard Problems are easier to solve. In particular, whether there exist algorithms that solve correctly and in polynomial time all sufficiently stable instances of some NP--hard Problem. The paper focuses on the Max--Cut Problem, for which we show that this is indeed the case.
Petre Stoica - One of the best experts on this subject based on the ideXlab platform.
-
merit a monotonically error bound improving technique for unimodular quadratic programming
International Conference on Acoustics Speech and Signal Processing, 2014Co-Authors: Mojtaba Soltanalian, Petre StoicaAbstract:The NP-hard Problem of optimizing a quadratic form over the unimodular vector set arises in radar code design scenarios as well as other active sensing and communication applications. To tackle thi ...
Christine Strauss - One of the best experts on this subject based on the ideXlab platform.
-
an ant colony optimization approach for the single machine total tardiness Problem
Congress on Evolutionary Computation, 1999Co-Authors: Andreas Bauer, Bernd Bullnheimer, Richard F Hartl, Christine StraussAbstract:Machine scheduling is a central task in production planning. In general it means the Problem of scheduling job operations on a given number of available machines. We consider a machine scheduling Problem with one machine, the Single Machine Total Tardiness Problem. To solve this NP hard Problem, we apply the ant colony optimization metaphor, a recently developed meta-heuristic that has proven its potential for various other combinatorial optimization Problems. We test our algorithm using 125 benchmark Problems and present computational results.
Garimella Rama Murthy - One of the best experts on this subject based on the ideXlab platform.
-
Optimization of Quadratic Forms: NP Hard Problems: Neural Networks
2013 International Symposium on Computational and Business Intelligence, 2013Co-Authors: Garimella Rama MurthyAbstract:In this research paper, the Problem of optimization of a quadratic form over the convex hull generated by the corners of hypercube is attempted and solved. It is reasoned that under some conditions, the optimum occurs at the corners of hypercube. Some results related to the computation of global optimum stable state (an NP hard Problem) are discussed. A heuristic algorithm is proposed. It is hoped that the results shed light on resolving the P ≠ NP Problem.
-
Optimization of Quadratic Forms: NP Hard Problems : Neural Networks
arXiv: Computational Complexity, 2012Co-Authors: Garimella Rama MurthyAbstract:In this research paper, the Problem of optimization of a quadratic form over the convex hull generated by the corners of hypercube is attempted and solved. Some results related to stable states/vectors, anti-stable states/vectors (over the hypercube) are discussed. Some results related to the computation of global optimum stable state (an NP hard Problem) are discussed. It is hoped that the results shed light on resolving the P \neq NP Problem.
