標(biāo)題: Titlebook: Combinatorics and Computer Science; 8th Franco-Japanese Michel Deza,Reinhardt Euler,Ioannis Manoussakis Conference proceedings 1996 Spring [打印本頁] 作者: HAG 時間: 2025-3-21 18:31
書目名稱Combinatorics and Computer Science影響因子(影響力)
書目名稱Combinatorics and Computer Science影響因子(影響力)學(xué)科排名
書目名稱Combinatorics and Computer Science網(wǎng)絡(luò)公開度
書目名稱Combinatorics and Computer Science網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Combinatorics and Computer Science被引頻次
書目名稱Combinatorics and Computer Science被引頻次學(xué)科排名
書目名稱Combinatorics and Computer Science年度引用
書目名稱Combinatorics and Computer Science年度引用學(xué)科排名
書目名稱Combinatorics and Computer Science讀者反饋
書目名稱Combinatorics and Computer Science讀者反饋學(xué)科排名
作者: 熱情的我 時間: 2025-3-21 22:58 作者: 培養(yǎng) 時間: 2025-3-22 02:32 作者: 驚奇 時間: 2025-3-22 06:46 作者: CERE 時間: 2025-3-22 09:26 作者: 遺傳 時間: 2025-3-22 16:55
Double description method revisited,hat we can hardly state any interesting theorems on its time and space complexities. In this paper, we reinvestigate this method, introduce some new ideas for efficient implementations, and show some empirical results indicating its practicality in solving highly degenerate problems.作者: 遺傳 時間: 2025-3-22 18:25
On skeletons, diameters and volumes of metric polyhedra,ax-cut and multicommodity flow problems. Namely we consider the volume, symmetry group, facets, vertices, face lattice, diameter, adjacency and incidence relations and connectivity of the metric polytope and its relatives. In particular, using its large symmetry group, we completely describe all the作者: ARK 時間: 2025-3-22 22:19
Improving branch and bound for Jobshop scheduling with constraint propagation,me key subsets of tasks. The advantage of this approach was to shorten the size of search trees for branch&bound algorithms because more propagation was performed at each node..In this paper, we refine the propagation scheme and describe in detail the branch&bound algorithm with its heuristics and w作者: saturated-fat 時間: 2025-3-23 04:38
A new efficiently solvable special case of the three-dimensional axial bottleneck assignment proble{1, ..., n} such that max.=1,...,n .. is minimized..We first present two closely related conditions on the cost array ., the wedge property and the weak wedge property, which guarantee that an optimal solution of 3-BAP is obtained by setting . and . to the identity permutation. In order to enlarge t作者: 細(xì)微的差異 時間: 2025-3-23 08:01
Ramsey numbers by stochastic algorithms with new heuristics,gs for the edges of these graphs and hypergraphs, by stochastic optimization algorithms in which the criterion of minimization is the number of monochrome cliques. To avoid local optima, we propose a technique consisting of an enumeration of edge colourings involved in monochrome cliques, as well as作者: 下垂 時間: 2025-3-23 12:20
On the hybrid neural network model for solving optimization problems,orithm called the Hybrid Network Updating Algorithm (HNUA) is used to drive the HN model. The best thing about the HNUA is that it reaches a feasible solution very quickly. Our argument here is that while the HNUA is very quick to satisfy the constraints, it guarantees very little in terms of the qu作者: Perigee 時間: 2025-3-23 14:17 作者: 噴出 時間: 2025-3-23 21:56 作者: 單獨 時間: 2025-3-24 00:24
On integer multiflows and metric packings in matroids,ficient for multiflow feasibility. In this work we exhibit the next level of necessary conditions, three conditions which correspond in a well-defined way to minimally non-ideal binary clutters. We characterize the subclass of matroids where the presented conditions are also sufficient for multiflow作者: 不可知論 時間: 2025-3-24 04:32 作者: 黃瓜 時間: 2025-3-24 07:08
0302-9743 CS ‘96, held in Brest, France in July 1995..The papers included in the book have been contributed by authors from 10 countries; they are organized in sections entitled graph theory, combinatorial optimization, selected topics, and parallel and distributed computing.978-3-540-61576-7978-3-540-70627-4Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Autobiography 時間: 2025-3-24 13:50
Future Smart Technologies for Human Health,e compare constraint programming to integer programming. This algorithm is tested on the standard benchmarks from Muth & Thompson, Lawrence, Adams et al, Applegate & Cook and Nakano & Yamada. The achievements are the following:作者: Mendicant 時間: 2025-3-24 15:20
https://doi.org/10.1007/978-3-030-51292-7his class of efficiently solvable special cases of the 3-BAP, we then propose an .(.. log .) time algorithm which, given an n × n × n array ., either finds three permutations . and . such that the permuted array ..=(..) satisfies the wedge property, or proves that no such permutations exist.作者: GLIDE 時間: 2025-3-24 22:14 作者: 釘牢 時間: 2025-3-25 00:16
0302-9743 rom the 54 papers accepted for presentation at the joint 8th Franco-Japanese and 4th Franco-Chinese Conference on Combinatorics in Computer Science, CCS ‘96, held in Brest, France in July 1995..The papers included in the book have been contributed by authors from 10 countries; they are organized in 作者: 小故事 時間: 2025-3-25 04:01 作者: INTER 時間: 2025-3-25 08:53 作者: REP 時間: 2025-3-25 14:47
Finding an antidirected Hamiltonian path starting with a forward arc from a given vertex of a tournvertex with an arc of a given direction. The first proof yields the theorem for all tournaments of order at least 19. The second proof only applies to somewhat larger tournaments, but leads to more efficient (sequential and parallel) algorithms.作者: 諂媚于人 時間: 2025-3-25 18:32
On integer multiflows and metric packings in matroids, way to minimally non-ideal binary clutters. We characterize the subclass of matroids where the presented conditions are also sufficient for multiflow feasibility, and prove the existence of integer multiflows for Eulerian weights. The theorem we prove uses results from Seymour[10] and generalizes those results and those in Schw?rzler, Seb?作者: chapel 時間: 2025-3-25 22:43
Conference proceedings 1996 papers accepted for presentation at the joint 8th Franco-Japanese and 4th Franco-Chinese Conference on Combinatorics in Computer Science, CCS ‘96, held in Brest, France in July 1995..The papers included in the book have been contributed by authors from 10 countries; they are organized in sections e作者: Armada 時間: 2025-3-26 00:20
Improving branch and bound for Jobshop scheduling with constraint propagation,e compare constraint programming to integer programming. This algorithm is tested on the standard benchmarks from Muth & Thompson, Lawrence, Adams et al, Applegate & Cook and Nakano & Yamada. The achievements are the following:作者: negotiable 時間: 2025-3-26 08:14 作者: 松緊帶 時間: 2025-3-26 10:03
On the hybrid neural network model for solving optimization problems,ality of the generated solution. In this paper we rewrite one of the steps in the HNUA so that the goal function is better served. we demonstrate our work using the traveling salesman problem as an example.作者: certain 時間: 2025-3-26 12:48
Smart Building and Current Technologies,ectivity, the .-skeletons and a lifting procedure valid for a large class of vertices of the metric polytope are also given. Finally, we present an ordering of the facets of a polytope, based on their adjacency relations, for the enumeration of its vertices by the double description method.作者: 討厭 時間: 2025-3-26 19:03 作者: Radiculopathy 時間: 2025-3-26 23:38 作者: 絕緣 時間: 2025-3-27 04:09 作者: Airtight 時間: 2025-3-27 05:37 作者: circumvent 時間: 2025-3-27 13:00 作者: 勾引 時間: 2025-3-27 16:44
Combinatorics and Computer Science978-3-540-70627-4Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Herpetologist 時間: 2025-3-27 18:26 作者: Amylase 時間: 2025-3-28 00:06
Yohan Varghese Kuriakose,Mahesh Jangid.) space, where . denotes the number of vertices, . denotes the number of edges, . denotes the number of maximum degree, .(.) denotes the time complexity of an edge coloring algorithm, and . denotes the number of edge colorings.作者: GIDDY 時間: 2025-3-28 05:19
Indoor Environmental Impact on Human Health,eing strongly regular are studied. Many examples and counterexamples from different areas of graph theory regarding them are provided. In particular, a census of graphs with at most six vertices is given.作者: 粗魯性質(zhì) 時間: 2025-3-28 06:38
Future Smart Technologies for Human Health,hat we can hardly state any interesting theorems on its time and space complexities. In this paper, we reinvestigate this method, introduce some new ideas for efficient implementations, and show some empirical results indicating its practicality in solving highly degenerate problems.作者: Pantry 時間: 2025-3-28 11:11 作者: lethal 時間: 2025-3-28 17:14 作者: jaundiced 時間: 2025-3-28 19:38
Magnetorheological Shear Thickening Fluid,s a proper coloring such that the sizes of color classes are all bounded by a preassigned number .. Formulas for the equitable and .-bounded chromatic numbers of a split graph are established in this paper. It is proved that split graphs satisfy the equitable .-coloring conjecture in Chen, Lih and W作者: Deference 時間: 2025-3-28 23:35
Yohan Varghese Kuriakose,Mahesh Jangid.) space, where . denotes the number of vertices, . denotes the number of edges, . denotes the number of maximum degree, .(.) denotes the time complexity of an edge coloring algorithm, and . denotes the number of edge colorings.作者: wreathe 時間: 2025-3-29 06:14
Future Smart Technologies for Human Health,er the decomposition of the edges of .. into the complete bipartite graphs, and obtain the following results..The minimum number of complete bipartite subgraphs needed to decompose the edges of .. is ...The crown .. has a ..-decomposition (i.e., the edges of .. can be decomposed into subgraphs isomo作者: 暴露他抗議 時間: 2025-3-29 07:53
https://doi.org/10.1007/978-3-030-51292-7 hamiltonian path starting with a forward arc. The proofs yield algorithms to find, if possible, an antidirected Hamiltonian path starting in a given vertex with an arc of a given direction. The first proof yields the theorem for all tournaments of order at least 19. The second proof only applies to作者: 托運(yùn) 時間: 2025-3-29 11:56
Indoor Environmental Impact on Human Health,eing strongly regular are studied. Many examples and counterexamples from different areas of graph theory regarding them are provided. In particular, a census of graphs with at most six vertices is given.作者: 種族被根除 時間: 2025-3-29 16:11 作者: Incompetent 時間: 2025-3-29 20:11
Smart Building and Current Technologies,ax-cut and multicommodity flow problems. Namely we consider the volume, symmetry group, facets, vertices, face lattice, diameter, adjacency and incidence relations and connectivity of the metric polytope and its relatives. In particular, using its large symmetry group, we completely describe all the作者: 圍裙 時間: 2025-3-30 02:02
Future Smart Technologies for Human Health,me key subsets of tasks. The advantage of this approach was to shorten the size of search trees for branch&bound algorithms because more propagation was performed at each node..In this paper, we refine the propagation scheme and describe in detail the branch&bound algorithm with its heuristics and w作者: MIRE 時間: 2025-3-30 06:41 作者: BALK 時間: 2025-3-30 08:14
Indoor Environmental Impact on Human Health,gs for the edges of these graphs and hypergraphs, by stochastic optimization algorithms in which the criterion of minimization is the number of monochrome cliques. To avoid local optima, we propose a technique consisting of an enumeration of edge colourings involved in monochrome cliques, as well as作者: 使人煩燥 時間: 2025-3-30 14:37
Smart Building and Current Technologies,orithm called the Hybrid Network Updating Algorithm (HNUA) is used to drive the HN model. The best thing about the HNUA is that it reaches a feasible solution very quickly. Our argument here is that while the HNUA is very quick to satisfy the constraints, it guarantees very little in terms of the qu作者: instructive 時間: 2025-3-30 17:48 作者: 裙帶關(guān)系 時間: 2025-3-31 00:17
N. G. Sidorova,V. S. Osipov,A. G. Zeldnerproperly wider class than the class of .-matroids. Discrete systems with a certain 2 to 2 exchangeability belong to this class. We characterize these systems in terms of their rank function. Excluded minors of .-matroids and these systems are also described.作者: 勾引 時間: 2025-3-31 01:22 作者: 大約冬季 時間: 2025-3-31 08:25
https://doi.org/10.1007/3-540-61576-8Graph; Graph theory; combinatorial optimization; computer; computer science; distributed computing; optimi作者: 巡回 時間: 2025-3-31 12:25 作者: exceed 時間: 2025-3-31 16:14 作者: 血友病 時間: 2025-3-31 17:52 作者: 金哥占卜者 時間: 2025-4-1 00:05 作者: 陰郁 時間: 2025-4-1 04:55 作者: Trabeculoplasty 時間: 2025-4-1 09:00 作者: Infinitesimal 時間: 2025-4-1 13:59
,Constructive — non-constructive approximation and maximum independent set problem, in its instance. This thought process for the study of the relative hardness between determining solutions of combinatorial optimization problems and computing (approximately or exactly) their optimal values, allows us to define classes of independent set problems the approximability of which is particularly interesting.
