Titlebook: Combinatorial Optimization I; M. W. Padberg Book 1980Latest edition Springer-Verlag Berlin Heidelberg 1980 0-444-85489-4.algebra.algorithm

能干

書目名稱Combinatorial Optimization I影響因子(影響力)




書目名稱Combinatorial Optimization I影響因子(影響力)學(xué)科排名




書目名稱Combinatorial Optimization I網(wǎng)絡(luò)公開度




書目名稱Combinatorial Optimization I網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Combinatorial Optimization I被引頻次




書目名稱Combinatorial Optimization I被引頻次學(xué)科排名




書目名稱Combinatorial Optimization I年度引用




書目名稱Combinatorial Optimization I年度引用學(xué)科排名




書目名稱Combinatorial Optimization I讀者反饋




書目名稱Combinatorial Optimization I讀者反饋學(xué)科排名

Tremor

定點(diǎn)

On the symmetric travelling salesman problem: Solution of a 120-city problem,trate how the knowledge of the facets of this polytope can be utilized to solve large-scale travelling salesman problems. In particular, we report how the shortest roundtrip through 120 German cities was found using a commercial linear programming code and adding facetial cutting planes in an interactive way.

ARY

Debility

Quadratic knapsack problems,for the QK problem are derived, and their different uses in a branch-and-bound scheme for solving such a problem are discussed. Some theoretical results concerning the class of all upper planes, as well as extensive computational experience, are reported.

GNAT

Combinatorial Optimization I978-3-642-00802-3Series ISSN 0303-3929 Series E-ISSN 2364-8201

GNAT

0303-3929 Overview: 978-3-642-00802-3Series ISSN 0303-3929 Series E-ISSN 2364-8201

大猩猩

CRUMB

Accessible

Lecture Notes in Production Engineeringfor the QK problem are derived, and their different uses in a branch-and-bound scheme for solving such a problem are discussed. Some theoretical results concerning the class of all upper planes, as well as extensive computational experience, are reported.