共查询到20条相似文献,搜索用时 15 毫秒
1.
Consider a sports competition among various teams playing against each other in pairs (matches) according to a previously determined schedule. At some stage of the competition one may ask whether a particular team still has a (theoretical) chance to win the competition. The computational complexity of this question depends on the way scores are allocated according to the outcome of a match. For competitions with at most 3 different outcomes of a match the complexity is already known. In practice there are many competitions in which more than 3 outcomes are possible. We determine the complexity of the above problem for competitions with an arbitrary number of different outcomes. Our model also includes competitions that are asymmetric in the sense that away playing teams possibly receive other scores than home playing teams. 相似文献
2.
3.
ONTHECOMPUTATIONALCOMPLEXITYOFTHEMAXIMUMTRADEPROBLEMZ.-Q.Luo;D.L.PARNAS(CommunicationsResearchLaboratocyDepartmentofElectrica... 相似文献
4.
Anthony Mansfield 《Discrete Applied Mathematics》1983,5(1):119-122
A problem arising from the work of C.A.R. Hoare on parallel programming is that of deciding whether a given string ? is a “merge” of two other given strings σ and τ. We describe a polynomial time algorithm for this problem. This algorithm can easily be extended to check, in polynomial time, whether ? is a merge of any fixed number of strings. The problem for an arbitrary number of strings is shown to be NP-complete and so is unlikely to have a polynomial time algorithm. 相似文献
5.
A. V. Eremeev 《Journal of Applied and Industrial Mathematics》2017,11(4):500-505
Under consideration is the electric power flow optimization problem for an electric power system which typically arises in calculation of electrical power auctions in the “day-ahead” and balancing markets. It was established that the problem of finding a feasible flow in the balancing market is NP-hard in the strong sense even in case of one generator. The problem of finding an optimal flow in the day-ahead market is proved to be NP-hard even with one generator and without controlled cuts. 相似文献
6.
The pooling problem is a well-studied global optimization problem with applications in oil refining and petrochemical industry. Despite the strong NP-hardness of the problem, which is proved formally in this paper, most instances from the literature have recently been solved efficiently by use of strong formulations. The main contribution from this paper is a new formulation that proves to be stronger than other formulations based on proportion variables. Moreover, we propose a promising branching strategy for the new formulation and provide computational experiments confirming the strength of the new formulation and the effectiveness of the branching strategy. 相似文献
7.
The concept of evolutionarily stable strategies (ESS) has been central to applications of game theory in evolutionary biology, and it has also had an influence on the modern
development of game theory. A regular ESS is an important refinement the ESS concept. Although there is a substantial literature on computing evolutionarily stable
strategies, the precise computational complexity of determining the existence of an ESS in a symmetric two-player strategic
form game has remained open, though it has been speculated that the problem is -hard. In this paper we show that determining the existence of an ESS is both -hard and -hard, and that the problem is contained in , the second level of the polynomial time hierarchy. We also show that determining the existence of a regular ESS is indeed
-complete. Our upper bounds also yield algorithms for computing a (regular) ESS, if one exists, with the same complexities. 相似文献
8.
In bilevel optimization problems there are two decision makers, the leader and the follower, who act in a hierarchy. Each
decision maker has his own objective function, but there are common constraints. This paper deals with bilevel assignment
problems where each decision maker controls a subset of edges and each edge has a leader’s and a follower’s weight. The edges
selected by the leader and by the follower need to form a perfect matching. The task is to determine which edges the leader
should choose such that his objective value which depends on the follower’s optimal reaction is maximized. We consider sum-
and bottleneck objective functions for the leader and follower. Moreover, if not all optimal reactions of the follower lead
to the same leader’s objective value, then the follower either chooses an optimal reaction which is best (optimistic rule)
or worst (pessimistic rule) for the leader. We show that all the variants arising if the leader’s and follower’s objective
functions are sum or bottleneck functions are NP-hard if the pessimistic rule is applied. In case of the optimistic rule the problem is shown to be NP-hard if at least one of the decision makers has a sum objective function. 相似文献
9.
Charles Blair 《Annals of Operations Research》1992,34(1):13-19
We show that (L+1)-level linear programs are as difficult as levelL of the polynomial-time hierarchy, even if one only considers problems with unique optimal solutions.Dedicated to Robert Jeroslow (1942–1988) 相似文献
10.
11.
Klaus Aehlig 《Annals of Pure and Applied Logic》2010,161(6):711-736
Using appropriate notation systems for proofs, cut-reduction can often be rendered feasible on these notations. Explicit bounds can be given. Developing a suitable notation system for Bounded Arithmetic, and applying these bounds, all the known results on definable functions of certain such theories can be reobtained in a uniform way. 相似文献
12.
This paper proposes a method of estimating computational complexity of problem through analyzing its input condition for N-vehicle exploration problem. The N-vehicle problem is firstly formulated to determine the optimal replacement in the set of permutations of 1 to N. The complexity of the problem is factorial of N (input scale of problem). To balance accuracy and efficiency of general algorithms, this paper mentions a new systematic algorithm design and discusses correspondence between complexity of problem and its input condition, other than just putting forward a uniform approximation algorithm as usual. This is a new technique for analyzing computation of NP problems. The method of corresponding is then presented. We finally carry out a simulation to verify the advantages of the method: 1) to decrease computation in enumeration; 2) to efficiently obtain computational complexity for any N-vehicle case; 3) to guide an algorithm design for any N-vehicle case according to its complexity estimated by the method. 相似文献
13.
Akshay Gupte Shabbir Ahmed Santanu S. Dey Myun Seok Cheon 《Journal of Global Optimization》2017,67(3):631-669
The pooling problem is a folklore NP-hard global optimization problem that finds applications in industries such as petrochemical refining, wastewater treatment and mining. This paper assimilates the vast literature on this problem that is dispersed over different areas and gives new insights on prevalent techniques. We also present new ideas for computing dual bounds on the global optimum by solving high-dimensional linear programs. Finally, we propose discretization methods for inner approximating the feasible region and obtaining good primal bounds. Valid inequalities are derived for the discretized models, which are formulated as mixed integer linear programs. The strength of our relaxations and usefulness of our discretizations is empirically validated on random test instances. We report best known primal bounds on some of the large-scale instances. 相似文献
14.
The stochastic pooling problem is a type of stochastic mixed-integer bilinear program arising in the integrated design and operation of various important industrial networks, such as gasoline blending, natural gas production and transportation, water treatment, etc. This paper presents a rigorous decomposition method for the stochastic pooling problem, which guarantees finding an ${\epsilon}$ -optimal solution with a finite number of iterations. By convexification of the bilinear terms, the stochastic pooling problem is relaxed into a lower bounding problem that is a potentially large-scale mixed-integer linear program (MILP). Solution of this lower bounding problem is then decomposed into a sequence of relaxed master problems, which are MILPs with much smaller sizes, and primal bounding problems, which are linear programs. The solutions of the relaxed master problems yield a sequence of nondecreasing lower bounds on the optimal objective value, and they also generate a sequence of integer realizations defining the primal problems which yield a sequence of nonincreasing upper bounds on the optimal objective value. The decomposition algorithm terminates finitely when the lower and upper bounds coincide (or are close enough), or infeasibility of the problem is indicated. Case studies involving two example problems and two industrial problems demonstrate the dramatic computational advantage of the proposed decomposition method over both a state-of-the-art branch-and-reduce global optimization method and explicit enumeration of integer realizations, particularly for large-scale problems. 相似文献
15.
Natashia Boland Thomas Kalinowski Fabian Rigterink 《Journal of Global Optimization》2017,67(3):621-630
Answering a question of Haugland, we show that the pooling problem with one pool and a bounded number of inputs can be solved in polynomial time by solving a polynomial number of linear programs of polynomial size. We also give an overview of known complexity results and remaining open problems to further characterize the border between (strongly) NP-hard and polynomially solvable cases of the pooling problem. 相似文献
16.
《Journal of Algorithms in Cognition, Informatics and Logic》1989,10(1):86-108
We study the problem of routing and broadcasting messages in a network, in which messages are generated at processors at arbitrary times and each message must reach its destination by a specific deadline. We present distributed and global routing algorithms for some restricted continuous routing problems on arrays of processors. We show that distributed algorithms are unlikely to exist in more general situations by giving an NP-hardness proof for their corresponding feasibility problem; i.e., the problem of determining whether all messages can be routed without violating the constraints of the network. We also present a distributed algorithm for the continuous broadcasting problem. 相似文献
17.
Given a graph G and an integer k≥0, the NP-complete Induced Matching problem asks whether there exists an edge subset M of size at least k such that M is a matching and no two edges of M are joined by an edge of G. The complexity of this problem on general graphs, as well as on many restricted graph classes has been studied intensively. However, other than the fact that the problem is W[1]-hard on general graphs, little is known about the parameterized complexity of the problem in restricted graph classes. In this work, we provide first-time fixed-parameter tractability results for planar graphs, bounded-degree graphs, graphs with girth at least six, bipartite graphs, line graphs, and graphs of bounded treewidth. In particular, we give a linear-size problem kernel for planar graphs. 相似文献
18.
In this paper we consider the computational complexity of uniformizing a domain with a given computable boundary. We give
nontrivial upper and lower bounds in two settings: when the approximation of the boundary is given either as a list of pixels,
or by a Turing machine. 相似文献
19.
Ian Agol Joel Hass William Thurston 《Transactions of the American Mathematical Society》2006,358(9):3821-3850
We show that the problem of deciding whether a polygonal knot in a closed three-dimensional manifold bounds a surface of genus at most is NP-complete. We also show that the problem of deciding whether a curve in a PL manifold bounds a surface of area less than a given constant is NP-hard.