作者: 防止 時間: 2025-3-21 21:56
Payment Systems and Employee Policiesapacity .-cut in both cases; see Sections 12.3 and 12.4. This problem, finding a minimum capacity cut δ(.) such that |. ∩ .| is odd for a specified vertex set ., can be solved with network flow techniques.作者: 大方不好 時間: 2025-3-22 04:21
,-Matchings and ,-Joins,apacity .-cut in both cases; see Sections 12.3 and 12.4. This problem, finding a minimum capacity cut δ(.) such that |. ∩ .| is odd for a specified vertex set ., can be solved with network flow techniques.作者: 系列 時間: 2025-3-22 05:23
Textbook 20022nd editionered by the many positive and even enthusiastic comments and letters from colleagues and the gen- eral readership. Several of our colleagues helped us in finding typographical and other errors. In particular, we thank Ulrich Brenner, Andras Frank, Bernd Gartner and Rolf Mohring. Of course, all error作者: absolve 時間: 2025-3-22 10:21
Help for the Independent Retailer,e consider the problem of minimizing an arbitrary submodular function. This can be done in polynomial time with the .. For the important special case of symmetric submodular functions we mention a simple combinatorial algorithm.作者: 冥想后 時間: 2025-3-22 16:40 作者: 冥想后 時間: 2025-3-22 19:49
https://doi.org/10.1007/978-3-662-21711-5Discrete Algorithms; Matching; Matchings; Mathematica; Mathematical Programming; algorithms; approximation作者: Allergic 時間: 2025-3-23 01:14 作者: 任意 時間: 2025-3-23 04:55
Bernhard Korte,Jens VygenWell-written textbook on combinatorial optimization.One of very few textbooks on this topic.Subject area has manifold applications.Includes supplementary material: 作者: 相互影響 時間: 2025-3-23 06:04 作者: 一起 時間: 2025-3-23 11:40
https://doi.org/10.1007/978-1-349-19657-9Let us start with two examples.作者: CYN 時間: 2025-3-23 16:43 作者: 儲備 時間: 2025-3-23 21:11
Basic Accounting and Accounting SystemsIn this chapter we review the most important facts about Linear Programming. Although this chapter is self-contained, it cannot be considered to be a comprehensive treatment of the field. The reader unfamiliar with Linear Programming is referred to the textbooks mentioned at the end of this chapter.作者: COMMA 時間: 2025-3-24 02:06
Understanding Financial InformationThere are basically three types of algorithms for .: the . (see Section 3.2), interior point algorithms, and the ..作者: Semblance 時間: 2025-3-24 06:11 作者: 平躺 時間: 2025-3-24 07:57 作者: Amendment 時間: 2025-3-24 14:30
Defining and Determining CapacityIn this and the next chapter we consider flows in networks. We have a digraph . with edge capacities .: .(.) → ?. and two specified vertices . (the .) and . (the .). The quadruple (., ., ., .) is sometimes called a ..作者: 不透明 時間: 2025-3-24 15:52 作者: 虛情假意 時間: 2025-3-24 19:47 作者: 疼死我了 時間: 2025-3-25 01:46 作者: 忘川河 時間: 2025-3-25 05:48 作者: APEX 時間: 2025-3-25 11:29
Financial Planning and BudgetingThe . and the . discussed in earlier chapters are among the “hardest” problems for which a polynomial-time algorithm is known. In this chapter we deal with the following problem which turns out to be, in a sense, the “easiest” .-hard problem作者: nonchalance 時間: 2025-3-25 15:42
Financial Planning and BudgetingSuppose we have . objects, each of a given size, and some bins of equal capacity. We want to assign the objects to the bins, using as few bins as possible. Of course the total size of the objects assigned to one bin should not exceed its capacity.作者: laparoscopy 時間: 2025-3-25 18:19
Introduction,Let us start with two examples.作者: Herd-Immunity 時間: 2025-3-25 22:02
Graphs,Graphs are a fundamental combinatorial structure used throughout this book. In this chapter we not only review the standard definitions and notation, but also prove some basic theorems and mention some fundamental algorithms.作者: Constant 時間: 2025-3-26 01:27
Linear Programming,In this chapter we review the most important facts about Linear Programming. Although this chapter is self-contained, it cannot be considered to be a comprehensive treatment of the field. The reader unfamiliar with Linear Programming is referred to the textbooks mentioned at the end of this chapter.作者: Oratory 時間: 2025-3-26 08:13
Linear Programming Algorithms,There are basically three types of algorithms for .: the . (see Section 3.2), interior point algorithms, and the ..作者: 大都市 時間: 2025-3-26 11:50
Integer Programming,In this chapter, we consider linear programs with integrality constraints作者: Abduct 時間: 2025-3-26 14:09 作者: 水槽 時間: 2025-3-26 19:22 作者: 鑲嵌細(xì)工 時間: 2025-3-26 22:06 作者: 連鎖 時間: 2025-3-27 04:50
Weighted Matching,Nonbipartite weighted matching appears to be one of the “hardest” combinatorial optimization problems that can be solved in polynomial time. We shall extend . to the weighted case and shall again obtain an .(..)-implementation. This algorithm has many applications, some of which are mentioned in the exercises and in Section 12.2.作者: Angiogenesis 時間: 2025-3-27 08:14 作者: 爭吵加 時間: 2025-3-27 10:10 作者: 我沒有命令 時間: 2025-3-27 15:23
The Knapsack Problem,The . and the . discussed in earlier chapters are among the “hardest” problems for which a polynomial-time algorithm is known. In this chapter we deal with the following problem which turns out to be, in a sense, the “easiest” .-hard problem作者: Credence 時間: 2025-3-27 20:10
Bin-Packing,Suppose we have . objects, each of a given size, and some bins of equal capacity. We want to assign the objects to the bins, using as few bins as possible. Of course the total size of the objects assigned to one bin should not exceed its capacity.作者: 命令變成大炮 時間: 2025-3-27 22:52 作者: Bricklayer 時間: 2025-3-28 03:37 作者: PHAG 時間: 2025-3-28 09:11
,-Completeness,are also many important problems for which no polynomial-time algorithm is known. Although we cannot prove that none exists we can show that a polynomial-time algorithm for one “hard” (more precisely: .-hard) problem would imply a polynomial-time algorithm for almost all problems discussed in this book (more precisely: all .-easy problems).作者: ovation 時間: 2025-3-28 13:25 作者: 索賠 時間: 2025-3-28 15:26 作者: 煩憂 時間: 2025-3-28 21:51
Understanding Financial Informationuffice to connect all cities and they should be as cheap as possible. It is natural to model the network by a graph: the vertices are the cities and the edges correspond to the cables. By Theorem 2.4 the minimal connected spanning subgraphs of a given graph are its spanning trees.作者: 高調(diào) 時間: 2025-3-29 02:20
https://doi.org/10.1007/978-1-349-18691-4apter 8 one could introduce edge costs to model that the employees have different salaries; our goal is to meet a deadline when all jobs must be finished at a minimum cost. Of course, there are many more applications.作者: 否認(rèn) 時間: 2025-3-29 04:45
Contribution and Break-Even Analysisare also many important problems for which no polynomial-time algorithm is known. Although we cannot prove that none exists we can show that a polynomial-time algorithm for one “hard” (more precisely: .-hard) problem would imply a polynomial-time algorithm for almost all problems discussed in this book (more precisely: all .-easy problems).作者: 無能力之人 時間: 2025-3-29 11:18 作者: 流浪者 時間: 2025-3-29 13:54
Understanding Financial Informationuffice to connect all cities and they should be as cheap as possible. It is natural to model the network by a graph: the vertices are the cities and the edges correspond to the cables. By Theorem 2.4 the minimal connected spanning subgraphs of a given graph are its spanning trees.作者: adulterant 時間: 2025-3-29 16:18 作者: 使入迷 時間: 2025-3-29 21:49 作者: 復(fù)習(xí) 時間: 2025-3-30 01:12 作者: 尾隨 時間: 2025-3-30 04:15 作者: TEN 時間: 2025-3-30 09:22
Financial and Other Services for SMEsties), such that the total flow through any edge does not exceed the capacity. We model the pairs (.) by a second digraph; for technical reasons we have an edge from . to . when we ask for an .-.-flow.作者: micronutrients 時間: 2025-3-30 12:29 作者: 大洪水 時間: 2025-3-30 18:36
Minimum Cost Flows,apter 8 one could introduce edge costs to model that the employees have different salaries; our goal is to meet a deadline when all jobs must be finished at a minimum cost. Of course, there are many more applications.作者: 大罵 時間: 2025-3-31 00:18 作者: 嘲笑 時間: 2025-3-31 04:11
Generalizations of Matroids,iom (M3). In Section 14.1 we consider greedoids, arising by dropping (M2) instead. Moreover, certain polytopes related to matroids and to submodular functions, called polymatroids, lead to strong generalizations of important theorems; we shall discuss them in Section 14.2. Finally, in Section 14.3 w作者: 尊嚴(yán) 時間: 2025-3-31 05:38 作者: ENDOW 時間: 2025-3-31 09:10 作者: 歹徒 時間: 2025-3-31 13:46 作者: 正常 時間: 2025-3-31 17:47
Textbook 20022nd editionarch Project, sponsored by the Hungarian Academy of Sciences and the Deutsche Forschungsgemeinschaft, two Sonderforschungsbereiche (special re- search units) of the Deutsche Forschungsgemeinschaft, the Ministere Franc;ais de la Recherche et de la Technologie and the Alexander von Humboldt Foundation
