Titlebook: Combinatorics and Computer Science; 8th Franco-Japanese Michel Deza,Reinhardt Euler,Ioannis Manoussakis Conference proceedings 1996 Spring

HAG

書目名稱Combinatorics and Computer Science影響因子(影響力)




書目名稱Combinatorics and Computer Science影響因子(影響力)學科排名




書目名稱Combinatorics and Computer Science網(wǎng)絡公開度




書目名稱Combinatorics and Computer Science網(wǎng)絡公開度學科排名




書目名稱Combinatorics and Computer Science被引頻次




書目名稱Combinatorics and Computer Science被引頻次學科排名




書目名稱Combinatorics and Computer Science年度引用




書目名稱Combinatorics and Computer Science年度引用學科排名




書目名稱Combinatorics and Computer Science讀者反饋




書目名稱Combinatorics and Computer Science讀者反饋學科排名

熱情的我

培養(yǎng)

驚奇

CERE

遺傳

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.

遺傳

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

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

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

細微的差異

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