全文获取类型
收费全文 | 11259篇 |
免费 | 37篇 |
专业分类
管理学 | 1647篇 |
民族学 | 106篇 |
人口学 | 2469篇 |
丛书文集 | 5篇 |
理论方法论 | 605篇 |
综合类 | 298篇 |
社会学 | 4893篇 |
统计学 | 1273篇 |
出版年
2023年 | 9篇 |
2022年 | 4篇 |
2021年 | 9篇 |
2020年 | 19篇 |
2019年 | 27篇 |
2018年 | 1680篇 |
2017年 | 1691篇 |
2016年 | 1103篇 |
2015年 | 56篇 |
2014年 | 61篇 |
2013年 | 152篇 |
2012年 | 360篇 |
2011年 | 1182篇 |
2010年 | 1069篇 |
2009年 | 805篇 |
2008年 | 854篇 |
2007年 | 1027篇 |
2006年 | 35篇 |
2005年 | 250篇 |
2004年 | 291篇 |
2003年 | 238篇 |
2002年 | 109篇 |
2001年 | 25篇 |
2000年 | 29篇 |
1999年 | 16篇 |
1998年 | 15篇 |
1997年 | 12篇 |
1996年 | 39篇 |
1995年 | 4篇 |
1994年 | 7篇 |
1993年 | 9篇 |
1992年 | 9篇 |
1991年 | 8篇 |
1990年 | 11篇 |
1988年 | 10篇 |
1987年 | 7篇 |
1986年 | 3篇 |
1985年 | 6篇 |
1984年 | 5篇 |
1982年 | 9篇 |
1981年 | 3篇 |
1980年 | 5篇 |
1978年 | 6篇 |
1977年 | 4篇 |
1976年 | 3篇 |
1975年 | 2篇 |
1974年 | 3篇 |
1973年 | 2篇 |
1972年 | 2篇 |
1971年 | 2篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
861.
Marin Bougeret Guillerme Duvillié Rodolphe Giroudeau 《Journal of Combinatorial Optimization》2018,36(3):1059-1073
In this paper we consider the multidimensional binary vector assignment problem. An input of this problem is defined by m disjoint multisets \(V^1, V^2, \ldots , V^m\), each composed of n binary vectors of size p. An output is a set of n disjoint m-tuples of vectors, where each m-tuple is obtained by picking one vector from each multiset \(V^i\). To each m-tuple we associate a p dimensional vector by applying the bit-wise AND operation on the m vectors of the tuple. The objective is to minimize the total number of zeros in these n vectors. We denote this problem by Open image in new window , and the restriction of this problem where every vector has at most c zeros by Open image in new window . Open image in new window was only known to be Open image in new window -hard, even for Open image in new window . We show that, assuming the unique games conjecture, it is Open image in new window -hard to Open image in new window -approximate Open image in new window for any fixed Open image in new window and Open image in new window . This result is tight as any solution is a Open image in new window -approximation. We also prove without assuming UGC that Open image in new window is Open image in new window -hard even for Open image in new window . Finally, we show that Open image in new window is polynomial-time solvable for fixed Open image in new window (which cannot be extended to Open image in new window ). 相似文献
862.
An oriented graph \(G^\sigma \) is a digraph without loops or multiple arcs whose underlying graph is G. Let \(S\left( G^\sigma \right) \) be the skew-adjacency matrix of \(G^\sigma \) and \(\alpha (G)\) be the independence number of G. The rank of \(S(G^\sigma )\) is called the skew-rank of \(G^\sigma \), denoted by \(sr(G^\sigma )\). Wong et al. (Eur J Comb 54:76–86, 2016) studied the relationship between the skew-rank of an oriented graph and the rank of its underlying graph. In this paper, the correlation involving the skew-rank, the independence number, and some other parameters are considered. First we show that \(sr(G^\sigma )+2\alpha (G)\geqslant 2|V_G|-2d(G)\), where \(|V_G|\) is the order of G and d(G) is the dimension of cycle space of G. We also obtain sharp lower bounds for \(sr(G^\sigma )+\alpha (G),\, sr(G^\sigma )-\alpha (G)\), \(sr(G^\sigma )/\alpha (G)\) and characterize all corresponding extremal graphs. 相似文献
863.
Because of its application in the field of security in wireless sensor networks, k-path vertex cover (\(\hbox {VCP}_k\)) has received a lot of attention in recent years. Given a graph \(G=(V,E)\), a vertex set \(C\subseteq V\) is a k-path vertex cover (\(\hbox {VCP}_k\)) of G if every path on k vertices has at least one vertex in C, and C is a connected k-path vertex cover of G (\(\hbox {CVCP}_k\)) if furthermore the subgraph of G induced by C is connected. A homogeneous wireless sensor network can be modeled as a unit disk graph. This paper presents a new PTAS for \(\hbox {MinCVCP}_k\) on unit disk graphs. Compared with previous PTAS given by Liu et al., our method not only simplifies the algorithm and reduces the time-complexity, but also simplifies the analysis by a large amount. 相似文献
864.
A 2-distance k-coloring of a graph G is a proper k-coloring such that any two vertices at distance two get different colors. \(\chi _{2}(G)\)=min{k|G has a 2-distance k-coloring}. Wegner conjectured that for each planar graph G with maximum degree \(\Delta \), \(\chi _2(G) \le 7\) if \(\Delta \le 3\), \(\chi _2(G) \le \Delta +5\) if \(4\le \Delta \le 7\) and \(\chi _2(G) \le \lfloor \frac{3\Delta }{2}\rfloor +1\) if \(\Delta \ge 8\). In this paper, we prove that: (1) If G is a planar graph with maximum degree \(\Delta \le 5\), then \(\chi _{2}(G)\le 20\); (2) If G is a planar graph with maximum degree \(\Delta \ge 6\), then \(\chi _{2}(G)\le 5\Delta -7\). 相似文献
865.
Mohammed-Albarra Hassan Imed Kacem Sébastien Martin Izzeldin M. Osman 《Journal of Combinatorial Optimization》2018,36(3):1074-1101
In this paper we study the m-clique free interval subgraphs. We investigate the facial structure of the polytope defined as the convex hull of the incidence vectors associated with these subgraphs. We also present some facet-defining inequalities to strengthen the associated linear relaxation. As an application, the generalized open-shop problem with disjunctive constraints (GOSDC) is considered. Indeed, by a projection on a set of variables, the m-clique free interval subgraphs represent the solution of an integer linear program solving the GOSDC presented in this paper. Moreover, we propose exact and heuristic separation algorithms, which are exploited into a Branch-and-cut algorithm for solving the GOSDC. Finally, we present and discuss some computational results. 相似文献
866.
The aim of this paper is to obtain new sharp inequalities for a large family of topological indices, including the second variable Zagreb index \(M_2^{\alpha }\), and to characterize the set of extremal graphs with respect to them. Our main results provide lower bounds on this family of topological indices involving just the minimum and the maximum degree of the graph. These inequalities are new even for the Randi?, the second Zagreb and the modified Zagreb indices. 相似文献
867.
Qizhi Fang Bo Li Xiaohan Shan Xiaoming Sun 《Journal of Combinatorial Optimization》2018,36(1):211-229
Cooperative games provide an appropriate framework for fair and stable profit distribution in multiagent systems. In this paper, we study the algorithmic issues on path cooperative games that arise from the situations where some commodity flows through a network. In these games, a coalition of edges or vertices is successful if they establish a path from the source to the sink in the network, and lose otherwise. Based on dual theory of linear programming and the relationship with flow games, we provide the characterizations on the core, CS-core, least-core and nucleolus of path cooperative games, which implies all of these solution concepts are polynomial-time solvable for path cooperative games. 相似文献
868.
Ling Gai Hongwei Du Lidong Wu Junlei Zhu Yuehua Bu 《Journal of Combinatorial Optimization》2018,36(2):392-399
In this paper, a rumor blocking problem is studied with an objective function which is neither submodular or supermodular. We will prove that this problem is NP-hard and give a data-dependent approximation with sandwich method. In addition, we show that every set function has a pair of monotone nondecreasing modular functions as upper bound and lower bound, respectively. 相似文献
869.
A graph is locally irregular if the neighbors of every vertex v have degrees distinct from the degree of v. A locally irregular edge-coloring of a graph G is an (improper) edge-coloring such that the graph induced on the edges of any color class is locally irregular. It is conjectured that three colors suffice for a locally irregular edge-coloring. In the paper, we develop a method using which we prove four colors are enough for a locally irregular edge-coloring of any subcubic graph admiting such a coloring. We believe that our method can be further extended to prove the tight bound of three colors for such graphs. Furthermore, using a combination of existing results, we present an improvement of the bounds for bipartite graphs and general graphs, setting the best upper bounds to 7 and 220, respectively. 相似文献
870.
Luigi Lepore Francesco Paolone Domenico Rocco Cambrea 《Journal of Management and Governance》2018,22(4):829-862
Research on the effect of ownership structure on firm performance shows no convergent evidence concerning the sign and form of the above-mentioned relationship. Similarly, there is no homogeneous evidence documenting family ownership concentration is always positively or negatively correlated with firm value, or irrelevant. This paper analyses whether and how the de facto investor protection provided by the judicial system affects the relationship between corporate performance and ownership structure in 1314 firms operating in four European countries (Germany, France, Italy, and Spain) over a five-year period, 2010–2014. Moreover, we analyse whether judicial system efficiency influences if and how family firms in the controlling coalition collude for expropriating minority shareholders. Our findings show that the level of shareholder protection, derived from judicial efficiency, is relevant to the relationship between ownership structure and firm performance, thus corroborating literature in that institutional contexts matter in explaining such relations. The results suggest the need for more efficient external mechanisms of corporate governance to facilitate investment in equity capital, thus decreasing the country risk perceived by investors. 相似文献