Titlebook: Operations Research ’93; Extended Abstracts o Achim Bachem,Ulrich Derigs,Rainer Schrader Conference proceedings 1994 Springer-Verlag Berlin

門牙

書目名稱Operations Research ’93影響因子(影響力)




書目名稱Operations Research ’93影響因子(影響力)學(xué)科排名




書目名稱Operations Research ’93網(wǎng)絡(luò)公開度




書目名稱Operations Research ’93網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Operations Research ’93被引頻次




書目名稱Operations Research ’93被引頻次學(xué)科排名




書目名稱Operations Research ’93年度引用




書目名稱Operations Research ’93年度引用學(xué)科排名




書目名稱Operations Research ’93讀者反饋




書目名稱Operations Research ’93讀者反饋學(xué)科排名

方便

packet

hallow

Coronation

Moderate

Linear 0-1 Inequalities and Extended Clauses,JL87] with 0-1 or pseudo-Boolean constraints was first introduced in [Boc92]. The resulting language CLP(.) aims to be a logic programming environment suitable for various applications where 0-1 problems naturally arise. This is the case for many AI-applications [BB93] and operations research.

conjunctiva

上釉彩

Groundstates in Ising Spin Lattices by Optimal Matchings,. and . × .-lattices as considered in Solid State Physics when trying to determine for .→∞ the phase transition from ferro- to paramagnetism in magnetic crystal systems at zero temperature, cf. Bieche et al. (1980). In particular this requires to solve a quadratic integer programming problem, equiva

Eulogy

Efficient Workload-Balancing on Grids, Hypercubes and Trees,.} and a communication network . ? . × .. At a fixed point in time every processor . ∈ . has a workload (WL) λ(.) ∈ ?., which is an estimation for the time needed to solve the problems placed on .. In the following we assume, that WL is dividible in infinitely small pieces, which can be exchanged be

忙碌