载货清单 发表于 2025-3-25 04:56:09

http://reply.papertrans.cn/23/2300/229952/229952_21.png

烦躁的女人 发表于 2025-3-25 07:44:30

http://reply.papertrans.cn/23/2300/229952/229952_22.png

动作谜 发表于 2025-3-25 11:53:24

Small Machine Tools for Small WorkpiecesA polynomial bounded method is presented for computing bounds to the value of the optimum of a large class of NP-hard combinatorial optimization problems.

BLINK 发表于 2025-3-25 18:01:59

Introduction to the Nuclear Power Industry,We investigate the problem of when a .-matching problem with integer edge costs has an integer optimal dual solution. We introduce the concept of .-bicritical graphs, give a characterization of them and show that these play a pivotal role in determining when there exists an integer optimal dual solution.

弓箭 发表于 2025-3-25 22:19:26

https://doi.org/10.1007/978-3-319-92594-3A general method is described for determining blocking and anti-blocking polyhedra related to any combinatorial family given as the extreme points of a polyhedron. This technique is illustrated in detail for the common independent sets of two matroids.

清楚 发表于 2025-3-26 04:10:57

http://reply.papertrans.cn/23/2300/229952/229952_26.png

aggravate 发表于 2025-3-26 04:26:00

Dual integrality in ,-matching problems,We investigate the problem of when a .-matching problem with integer edge costs has an integer optimal dual solution. We introduce the concept of .-bicritical graphs, give a characterization of them and show that these play a pivotal role in determining when there exists an integer optimal dual solution.

Admonish 发表于 2025-3-26 12:32:24

http://reply.papertrans.cn/23/2300/229952/229952_28.png

多嘴多舌 发表于 2025-3-26 15:51:14

http://reply.papertrans.cn/23/2300/229952/229952_29.png

CAND 发表于 2025-3-26 18:56:22

Marc Dumas-Johansen,Andreas Thulstrupthat emerged as best was run on 55 randomly generated test problems (20 of them from the literature), with up to 200 constraints and 2000 variables. The results show the algorithm to be more reliable and efficient than earlier procedures on large, sparse set covering problems.
页: 1 2 [3] 4 5 6
查看完整版本: Titlebook: Combinatorial Optimization I; M. W. Padberg Book 1980Latest edition Springer-Verlag Berlin Heidelberg 1980 0-444-85489-4.algebra.algorithm