全文获取类型
收费全文 | 13494篇 |
免费 | 83篇 |
专业分类
管理学 | 1981篇 |
民族学 | 128篇 |
人才学 | 1篇 |
人口学 | 2708篇 |
丛书文集 | 11篇 |
理论方法论 | 875篇 |
综合类 | 340篇 |
社会学 | 5960篇 |
统计学 | 1573篇 |
出版年
2024年 | 6篇 |
2023年 | 43篇 |
2022年 | 20篇 |
2021年 | 42篇 |
2020年 | 77篇 |
2019年 | 126篇 |
2018年 | 1736篇 |
2017年 | 1755篇 |
2016年 | 1214篇 |
2015年 | 133篇 |
2014年 | 152篇 |
2013年 | 448篇 |
2012年 | 475篇 |
2011年 | 1274篇 |
2010年 | 1122篇 |
2009年 | 870篇 |
2008年 | 905篇 |
2007年 | 1113篇 |
2006年 | 96篇 |
2005年 | 325篇 |
2004年 | 353篇 |
2003年 | 299篇 |
2002年 | 163篇 |
2001年 | 90篇 |
2000年 | 67篇 |
1999年 | 71篇 |
1998年 | 47篇 |
1997年 | 31篇 |
1996年 | 65篇 |
1995年 | 30篇 |
1994年 | 35篇 |
1993年 | 21篇 |
1992年 | 32篇 |
1991年 | 27篇 |
1990年 | 25篇 |
1989年 | 23篇 |
1988年 | 27篇 |
1987年 | 16篇 |
1986年 | 28篇 |
1985年 | 20篇 |
1984年 | 16篇 |
1983年 | 19篇 |
1982年 | 17篇 |
1981年 | 11篇 |
1980年 | 15篇 |
1979年 | 25篇 |
1978年 | 11篇 |
1976年 | 8篇 |
1975年 | 7篇 |
1974年 | 10篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
871.
We investigate special cases of the quadratic minimum spanning tree problem (QMSTP) on a graph \(G=(V,E)\) that can be solved as a linear minimum spanning tree problem. We give a characterization of such problems when G is a complete graph, which is the standard case in the QMSTP literature. We extend our characterization to a larger class of graphs that include complete bipartite graphs and cactuses, among others. Our characterization can be verified in \(O(|E|^2)\) time. In the case of complete graphs and when the cost matrix is given in factored form, we show that our characterization can be verified in O(|E|) time. Related open problems are also indicated. 相似文献
872.
Sven Mallach 《Journal of Combinatorial Optimization》2018,36(3):871-895
We revise existing and introduce new mixed-integer programming models for the Multiprocessor scheduling problem with communication delays. The basis for both is the identification of two major modeling strategies one of which can be considered ordering-based, and the other assignment-based. We first reveal redundancies in the encoding of feasible solutions found in present formulations and discuss how they can be avoided. For the assignment-based approach, we propose new inequalities that lead to provably stronger continuous relaxations and better performance in practice. Moreover, we derive a third, novel modeling strategy and show how to more compactly linearize assignment formulations with quadratic constraints. In a comprehensive experimental comparison of representative models that reflect the state-of-the-art in terms of strength and size, we evaluate not only running times but also the obtained lower and upper bounds on the makespan for the harder instances of a large scale benchmark set. 相似文献
873.
In the partial degree bounded edge packing problem (PDBEP), the input is an undirected graph \(G=(V,E)\) with capacity \(c_v\in {\mathbb {N}}\) on each vertex v. The objective is to find a feasible subgraph \(G'=(V,E')\) maximizing \(|E'|\), where \(G'\) is said to be feasible if for each \(e=\{u,v\}\in E'\), \(\deg _{G'}(u)\le c_u\) or \(\deg _{G'}(v)\le c_v\). In the weighted version of the problem, additionally each edge \(e\in E\) has a weight w(e) and we want to find a feasible subgraph \(G'=(V,E')\) maximizing \(\sum _{e\in E'} w(e)\). The problem is already NP-hard if \(c_v = 1\) for all \(v\in V\) (Zhang in: Proceedings of the joint international conference on frontiers in algorithmics and algorithmic aspects in information and management, FAW-AAIM 2012, Beijing, China, May 14–16, pp 359–367, 2012). In this paper, we introduce a generalization of the PDBEP problem. We let the edges have weights as well as demands, and we present the first constant-factor approximation algorithms for this problem. Our results imply the first constant-factor approximation algorithm for the weighted PDBEP problem, improving the result of Aurora et al. (FAW-AAIM 2013) who presented an \(O(\log n)\)-approximation for the weighted case. We also study the weighted PDBEP problem on hypergraphs and present a constant factor approximation if the maximum degree of the hypergraph is bounded above by a constant. We study a generalization of the weighted PDBEP problem with demands where each edge additionally specifies whether it requires at least one, or both its end-points to not exceed the capacity. The objective is to pick a maximum weight subset of edges. We give a constant factor approximation for this problem. We also present a PTAS for the weighted PDBEP problem with demands on H-minor free graphs, if the demands on the edges are bounded by polynomial. We show that the PDBEP problem is APX-hard even for bipartite graphs with \(c_v = 1, \; \forall v\in V\) and having degree at most 3. 相似文献
874.
A graph \(G=(V,E)\) with even number vertices is called Pfaffian if it has a Pfaffian orientation, namely it admits an orientation such that the number of edges of any M-alternating cycle which have the same direction as the traversal direction is odd for some perfect matching M of the graph G. In this paper, we obtain a necessary and sufficient condition of Pfaffian graphs in a type of bipartite graphs. Then, we design an \(O(|E(G)|^2)\) algorithm for recognizing Pfaffian graphs in this class and constructs a Pfaffian orientation if the graph is Pfaffian. The results improve and generalize some known results. 相似文献
875.
A simple connected graph G with 2n vertices is said to be k-extendable for an integer k with \(0<k<n\) if G contains a perfect matching and every matching of cardinality k in G is a subset of some perfect matching. Lakhal and Litzler (Inf Process Lett 65(1):11–16, 1998) discovered a polynomial algorithm that decides whether a bipartite graph is k-extendable. For general graphs, however, it has been an open problem whether there exists a polynomial algorithm. The new result presented in this paper is that the extendability problem is co-NP-complete. 相似文献
876.
Yosuke Hanawa Yuya Higashikawa Naoyuki Kamiyama Naoki Katoh Atsushi Takizawa 《Journal of Combinatorial Optimization》2018,36(4):1299-1314
A dynamic network introduced by Ford and Fulkerson is a directed graph with capacities and transit times on its arcs. The quickest transshipment problem is one of the most fundamental problems in dynamic networks. In this problem, we are given sources and sinks. Then the goal of this problem is to find a minimum time limit such that we can send the right amount of flow from sources to sinks. In this paper, we introduce a variant of this problem called the mixed evacuation problem. This problem models an emergent situation in which people can evacuate on foot or by car. The goal is to organize such a mixed evacuation so that an efficient evacuation can be achieved. In this paper, we study this problem from the theoretical and practical viewpoints. In the first part, we prove the polynomial-time solvability of this problem in the case where the number of sources and sinks is not large, and also prove the polynomial-time solvability and computational hardness of its variants with integer constraints. In the second part, we apply our model to the case study of Minabe town in Wakayama prefecture, Japan. 相似文献
877.
Let \(G=(V, E)\) be a simple graph and denote the set of edges incident to a vertex v by E(v). The neighbor sum distinguishing (NSD) total choice number of G, denoted by \(\mathrm{ch}_{\Sigma }^{t}(G)\), is the smallest integer k such that, after assigning each \(z\in V\cup E\) a set L(z) of k real numbers, G has a total coloring \(\phi \) satisfying \(\phi (z)\in L(z)\) for each \(z\in V\cup E\) and \(\sum _{z\in E(u)\cup \{u\}}\phi (z)\ne \sum _{z\in E(v)\cup \{v\}}\phi (z)\) for each \(uv\in E\). In this paper, we propose some reducible configurations of NSD list total coloring for general graphs by applying the Combinatorial Nullstellensatz. As an application, we present that \(\mathrm{ch}^{t}_{\Sigma }(G)\le \Delta (G)+3\) for every subcubic graph G. 相似文献
878.
Francisco J. Aragón Artacho Rubén Campoy Ilias Kotsireas Matthew K. Tam 《Journal of Combinatorial Optimization》2018,35(4):1061-1085
In this work, we propose an optimization approach for constructing various classes of circulant combinatorial designs that can be defined in terms of autocorrelation. The problem is formulated as a so-called feasibility problem having three sets, to which the Douglas–Rachford projection algorithm is applied. The approach is illustrated on three different classes of circulant combinatorial designs: circulant weighing matrices, D-optimal matrices of circulant type, and Hadamard matrices with two circulant cores. Furthermore, we explicitly construct two new circulant weighing matrices, a CW(126, 64) and a CW(198, 100), whose existence was previously marked as unresolved in the most recent version of Strassler’s table. 相似文献
879.
Retraining of staff is a compulsory managerial function in many organisations and often requires planning for a large number of employees. The large scale of this problem and various restrictions on the resultant assignment to classes make this planning challenging. The paper presents a complexity analysis of this problem together with linear and nonlinear mathematical programming formulations. Three different column generation based optimisation procedures and a large neighbourhood search procedure, incorporating column generation, are compared by means of computational experiments. The experiments used data typical to large electricity distributors. 相似文献
880.
Qingsong Tang Xiangde Zhang Guoren Wang Cheng Zhao 《Journal of Combinatorial Optimization》2018,35(4):1250-1260
For a simple graph G on n vertices with adjacency matrix A, Motzkin and Strauss established a remarkable connection between the clique number and the global maximum value of the quadratic programm: \(\textit{max}\{ \mathbf {x}^T A \mathbf {x}\}\) on the standard simplex: \(\{\sum _{i=1}^{n} x_i =1, x_i \ge 0 \}\). In Gibbons et al. (Math Oper Res 122:754–768, 1997), an extension of the Motzkin–Straus formulation was provided for the vertex-weighted clique number of a graph. In this paper, we provide a continuous characterization of the maximum vertex-weighted clique problem for vertex-weighted uniform hypergraphs. 相似文献