Titlebook: Approaches to Integer Programming; M. L. Balinski Book 1974Latest edition Springer-Verlag Berlin Heidelberg 1974 978-0-444-10823-4.algorit

司法權(quán)

書目名稱Approaches to Integer Programming影響因子(影響力)




書目名稱Approaches to Integer Programming影響因子(影響力)學(xué)科排名




書目名稱Approaches to Integer Programming網(wǎng)絡(luò)公開(kāi)度




書目名稱Approaches to Integer Programming網(wǎng)絡(luò)公開(kāi)度學(xué)科排名




書目名稱Approaches to Integer Programming被引頻次




書目名稱Approaches to Integer Programming被引頻次學(xué)科排名




書目名稱Approaches to Integer Programming年度引用




書目名稱Approaches to Integer Programming年度引用學(xué)科排名




書目名稱Approaches to Integer Programming讀者反饋




書目名稱Approaches to Integer Programming讀者反饋學(xué)科排名

SOBER

A heuristic algorithm for mixed-integer programming problems, encouraging. For example, randomly generated problems with 50 constraints and 400 variables consumed 2～3 minutes on a FACOM 230/60. The quality of the obtained solutions seem to be quite high. In fact, for many problems with known optimal solutions, our algorithm was successful in obtaining exact optimal solutions.

飛行員

波動(dòng)

M?rkte, Trends, Chancen, Erfolgsfaktoren encouraging. For example, randomly generated problems with 50 constraints and 400 variables consumed 2～3 minutes on a FACOM 230/60. The quality of the obtained solutions seem to be quite high. In fact, for many problems with known optimal solutions, our algorithm was successful in obtaining exact optimal solutions.

紅潤(rùn)

JAUNT

詞匯表

M?rkte, Trends , Chancen, Erfolgsfaktorenving them. The purpose of this paper is to investigate the computational effects of different . on such problems. The problems considered are a market allocation problem, a combinatorial problem, two mining problems and a problem of logical design.

通情達(dá)理

發(fā)酵

Two computationally difficult set covering problems that arise in computing the 1-width of incidenc. Ryser, has 330 constraints and 45 variables. The constraint matrices of the two set covering problems are incidence matrices of Steiner triple systems. An optimal solution to the problem that we were able to solve (the smaller one) gives some new information on the 1-widths of members of this class of (0,1)-matrices.

Oratory

Experiments in the formulation of integer programming problems,ving them. The purpose of this paper is to investigate the computational effects of different . on such problems. The problems considered are a market allocation problem, a combinatorial problem, two mining problems and a problem of logical design.