Krentel, M. W. 1988. The complexity of optimization problems. J. Comput. System Sci. 36, 490-509.Krentel, M.W.: The complexity of optimization problems. Proceedings of the eighteenth annual ACM symposium on Theory of computing 69- 76 (1986)...
The complexity of optimization problems 喜欢 0 阅读量: 87 作者: MW Krentel 摘要: Many important problems in computer science, such as CLIQUE, COLORING, and TRAVELLING SALESPERSON, arise naturally as optimization problems. Typically one considers these problems as decision procedures, which are often...
These problems are very important subjects of optimization problems. We prove that the complexity result of the sparsity constraint problem and sparse solution problem are all NP-hard in the strong sense and even testing feasibility of the sparsity constraint is NP-complete in the strong sense. ...
nonlinear optimizationobjective functioninfinite feasible sets/ C1180 Optimisation techniques C4240C Computational complexity C1160 Combinatorial mathematicsIn this paper, an algorithm for solving a special convex programming problem (CPP) is proposed. We consider a CPP with an objective function whose ...
source is existing network systems. Network complexity is growing exponentially, but legacy problems in current networks still remain. While the device-centric, manual O&M approach is over, dynamic network scheduling is beyond human capability. Thus, the only solution is a high degree of automation...
Operators also face efficiency and cost challenges. OPEX for maintaining telecom equipment maintenance is about three times higher than CAPEX. Moreover, higher network complexity often means that engineers lack specialist knowledge and capabilities, resulting in 70 percent of major network faults...
In this section, we present attacks on the optimized MPPK/DS scheme that we have discovered up to this date, and provide estimates of the complexity of these attacks. Any attack on MPPK/DS entails selective forgery of the signatures. In other words, the goal of the adversary is to ...
The Quantum Approximate Optimization Algorithm (QAOA) is a variational quantum algorithm for approximately solving discrete combinatorial optimization problems. Since its inception in the seminal work of Farhi, Goldstone, and Gutmann5,12, QAOA has been applied to Maximum Cut (Max-Cut) problems. With ...
Hence imposing lower bounds instead of upper bounds on the out-degrees would lead to equivalent problems. Similarly, the bounds could be imposed on the in-degrees instead of the out-degrees. The question of the complexity of UBBBO can be found in various sources. It is mentioned by Frank ...
In this paper we present a survey of results concerning algorithms, complexity, and applications of the maximum clique problem. We discuss enumerative and exact algorithms, heuristics, and a variety of other proposed methods. An up to date bibliography on the maximum clique and related problems is...