Titlebook: Introduction to Combinatorial Optimization; Ding-Zhu Du,Panos M. Pardalos,Weili Wu Textbook 2022 Springer Nature Switzerland AG 2022 Algor

信賴

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




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




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




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




書目名稱Introduction to Combinatorial Optimization被引頻次




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




書目名稱Introduction to Combinatorial Optimization年度引用




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




書目名稱Introduction to Combinatorial Optimization讀者反饋




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

Charlatan

Textbook 2022e, shortest path, maximum matching, network flow, set-cover, as well as key algorithms, suchas greedy algorithm, dynamic programming, augmenting path, and divide-and-conquer. Historical notes, ample exercises in every chapter, strategically placed graphics, and an extensive bibliography are amongst

BILIO

Introduction,Let us start this textbook from a fundamental question and tell you what will constitute this book.

獨(dú)行者

Recess

Linear Programming,Linear programming (LP) is an important combinatorial optimization problem, and in addition, it is an important tool to design and to understand algorithms for other problems. In this chapter, we introduce LP theory starting from Simplex Algorithm, which is an incremental method.

輕觸

cajole

Restriction and Steiner Tree,Restriction is a major technique in design of approximation algorithms. The Steiner minimum tree is a classic NP-hard combinatorial optimization problem. In the study of the Steiner minimum tree and its variations, restriction plays an important role.

Habituate

Greedy Approximation and Submodular Optimization,Greedy is an important strategy to design approximation algorithms, especially in the study of submodular optimization problems. In this chapter, we will explore this strategy together with important results in submodular optimization.

胰臟

Nonsubmodular Optimization,In the real world, there are many set function optimization problems with objective function and/or constraint which is neither submodular nor supermodular. Usually, it is hard to study their approximation solutions. In this chapter, we summarize existing efforts in the literature.

漂浮

https://doi.org/10.1007/978-3-031-10596-8Algorithm Design; Combinatorial Optimization; NP-hard problem; approximation algorithms; linear programm