標(biāo)題: Titlebook: Handbook of Combinatorial Optimization; Panos M. Pardalos,Ding-Zhu Du,Ronald L. Graham Reference work 2013Latest edition Springer Science+ [打印本頁(yè)] 作者: 斷巖 時(shí)間: 2025-3-21 16:20
書(shū)目名稱(chēng)Handbook of Combinatorial Optimization影響因子(影響力)
書(shū)目名稱(chēng)Handbook of Combinatorial Optimization影響因子(影響力)學(xué)科排名
書(shū)目名稱(chēng)Handbook of Combinatorial Optimization網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱(chēng)Handbook of Combinatorial Optimization網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱(chēng)Handbook of Combinatorial Optimization被引頻次
書(shū)目名稱(chēng)Handbook of Combinatorial Optimization被引頻次學(xué)科排名
書(shū)目名稱(chēng)Handbook of Combinatorial Optimization年度引用
書(shū)目名稱(chēng)Handbook of Combinatorial Optimization年度引用學(xué)科排名
書(shū)目名稱(chēng)Handbook of Combinatorial Optimization讀者反饋
書(shū)目名稱(chēng)Handbook of Combinatorial Optimization讀者反饋學(xué)科排名
作者: 小卷發(fā) 時(shí)間: 2025-3-21 20:49 作者: ADORE 時(shí)間: 2025-3-22 00:39
Advances in Group Testing,Suppose there is some method to test whether a subset of items contains at least one positive or not. The test result is said to be positive if it indicates that the subset contains at least one positive item; otherwise, the test result is called negative. The problem is to resolve the status of eve作者: 巨頭 時(shí)間: 2025-3-22 07:12
Algebrization and Randomization Methods,ch baffle people many years. In recent years, some algebrization and randomization techniques have been developed and applied in the design of algorithms, which provides a credible alternative to traditional methods. Then the testing monomials theories were developed based on above techniques, which作者: antidote 時(shí)間: 2025-3-22 11:15 作者: 格子架 時(shí)間: 2025-3-22 16:16
Algorithms and Metaheuristics for Combinatorial Matrices,h thousands of variables. In this chapter we present a survey of some recent algorithms to search for some kinds of combinatorial matrices, with an emphasis to algorithms within the realm of optimization and metaheuristics. It is to be noted that for most kinds of combinatorial matrices there are se作者: 偽證 時(shí)間: 2025-3-22 18:28
Algorithms for the Satisfiability Problem,, and some theoretical aspects of SAT. Some applications to which SAT solvers have been successfully applied are also presented. The intention is to assist someone interested in applying SAT technology in solving some stubborn class of combinatorial problems.作者: 秘傳 時(shí)間: 2025-3-23 00:23 作者: hypnotic 時(shí)間: 2025-3-23 01:44 作者: 報(bào)復(fù) 時(shí)間: 2025-3-23 08:12
Combinatorial Optimization Algorithms,eriments to determine whether a specific DNA fragment, that represents the virus, is present in a DNA solution. A probe is a segment of DNA or RNA, labeled with a radioactive isotope, dye, or enzyme, used to find a specific target sequence on a DNA molecule by hybridization. Selecting unique probes 作者: 愛(ài)哭 時(shí)間: 2025-3-23 13:46
Combinatorial Optimization in Data Mining,number of cases where fundamental data mining tool is not combinatorial in nature, yet widely used special-purpose combinatorial extensions exist. For the sake of completeness, these fundamental tools are also discussed in detail before the extensions with underlying combinatorial optimization probl作者: Dri727 時(shí)間: 2025-3-23 15:14
Combinatorial Optimization Techniques for Network-Based Data Mining,he?approach of representing real-world datasets as large-scale networks (graphs) has become increasingly popular during recent years. The purpose of this chapter is to briefly review the graph-theoretic and combinatorial optimization concepts that are important in the context of data mining, as well作者: ONYM 時(shí)間: 2025-3-23 19:41 作者: 種植,培養(yǎng) 時(shí)間: 2025-3-23 23:01
Complexity Issues on PTAS,TAS). The key questions under consideration are as follows: what optimization problems have PTASs, FPTASs, and EPTASs, and how efficient are these algorithms?.On the positive side, there are syntactic classes for characterizing PTAS, FPTAS, and EPTAS. Expressing a problem as a member in these classe作者: SOBER 時(shí)間: 2025-3-24 03:48 作者: Latency 時(shí)間: 2025-3-24 09:22
Connected Dominating Set in Wireless Networks,n addition the subgraph induced by . is connected. Given a graph, finding the minimum Connected Dominating Set is a classical combinatorial optimization problem, existing in literature for a long time. Due to wide applications of the minimum Connected Dominating Set in wireless networks, Connected D作者: MELD 時(shí)間: 2025-3-24 10:56 作者: 松果 時(shí)間: 2025-3-24 16:38
Patterns of sexual reproduction in diatomso the well-known ., ., more general forms of the problems, in which each node is required to be dominated by more than one of its neighbors, are also considered. An example is the . (PIDS) problem, originated from the context of influence propagation in social networks. The PIDS problem seeks for a 作者: BLUSH 時(shí)間: 2025-3-24 22:18 作者: 驚惶 時(shí)間: 2025-3-24 23:39
Patterns of Language and ActionSuppose there is some method to test whether a subset of items contains at least one positive or not. The test result is said to be positive if it indicates that the subset contains at least one positive item; otherwise, the test result is called negative. The problem is to resolve the status of eve作者: 逃避系列單詞 時(shí)間: 2025-3-25 06:06
The Economics of Joan Robinson,ch baffle people many years. In recent years, some algebrization and randomization techniques have been developed and applied in the design of algorithms, which provides a credible alternative to traditional methods. Then the testing monomials theories were developed based on above techniques, which作者: resistant 時(shí)間: 2025-3-25 08:41 作者: Fulminate 時(shí)間: 2025-3-25 15:44
Mirela Damian,Robin Flatland,Joseph O’Rourkeh thousands of variables. In this chapter we present a survey of some recent algorithms to search for some kinds of combinatorial matrices, with an emphasis to algorithms within the realm of optimization and metaheuristics. It is to be noted that for most kinds of combinatorial matrices there are se作者: 勤勉 時(shí)間: 2025-3-25 19:34 作者: Alienated 時(shí)間: 2025-3-25 22:59
Adilson R. Gon?alves,Ulf Schuchardte guarantees. Both on-line and off-line algorithms are analyzed. The investigation is extended to variants of the problem through an extensive review of dual versions, variations on bin sizes and item packing, as well as those produced by additional constraints. The bin packing papers are classified作者: Rejuvenate 時(shí)間: 2025-3-26 01:26
The Interwar Social Problem Novel,torial optimization problems. The unexpected versatility of the UQP model is opening doors to the solution of a diverse array of important and challenging applications. Developments in this evolving area are illustrated by describing its methodology with examples and by reporting substantial computa作者: 鎮(zhèn)痛劑 時(shí)間: 2025-3-26 06:21 作者: 燦爛 時(shí)間: 2025-3-26 10:57 作者: Consensus 時(shí)間: 2025-3-26 15:50
Twentieth-century Children‘s Writershe?approach of representing real-world datasets as large-scale networks (graphs) has become increasingly popular during recent years. The purpose of this chapter is to briefly review the graph-theoretic and combinatorial optimization concepts that are important in the context of data mining, as well作者: overweight 時(shí)間: 2025-3-26 19:35 作者: 貞潔 時(shí)間: 2025-3-27 00:45
After firing The 1940s and 1950s,TAS). The key questions under consideration are as follows: what optimization problems have PTASs, FPTASs, and EPTASs, and how efficient are these algorithms?.On the positive side, there are syntactic classes for characterizing PTAS, FPTAS, and EPTAS. Expressing a problem as a member in these classe作者: Diskectomy 時(shí)間: 2025-3-27 03:11
,Wells, ,, and Lewis’s Ransom Trilogy,distance and a closely related distance called the subtree-transfer distance used in dealing with evolutionary histories involving events like recombinations or gene conversions; some variants of these distances will also be discussed.作者: 交響樂(lè) 時(shí)間: 2025-3-27 06:00
https://doi.org/10.1007/978-1-349-00143-9n addition the subgraph induced by . is connected. Given a graph, finding the minimum Connected Dominating Set is a classical combinatorial optimization problem, existing in literature for a long time. Due to wide applications of the minimum Connected Dominating Set in wireless networks, Connected D作者: 誘拐 時(shí)間: 2025-3-27 11:51 作者: Lipoma 時(shí)間: 2025-3-27 13:45
Specimen Passage and Commentary,This chapter reviews a research focus of scheduling in manufacturing facilities over the last decade. Manufacturing environment has a great influence on the processing times of jobs. The chapter reviews basic concept about past-sequence-dependent delivery times and covers recently results on scheduling with such constraint.作者: Cardioversion 時(shí)間: 2025-3-27 20:55
https://doi.org/10.1007/978-1-349-25934-2This writing aims at surveying what has been done to analyze some connections between continuous and discrete extremum problems and related models, like generalized systems and variational inequalities.作者: 根除 時(shí)間: 2025-3-28 00:34 作者: 吊胃口 時(shí)間: 2025-3-28 03:45
Connections Between Continuous and Discrete Extremum Problems, Generalized Systems, andVariational This writing aims at surveying what has been done to analyze some connections between continuous and discrete extremum problems and related models, like generalized systems and variational inequalities.作者: 碎石頭 時(shí)間: 2025-3-28 09:05 作者: 本能 時(shí)間: 2025-3-28 11:07
Twentieth Century Crime & Mystery Writers, and some theoretical aspects of SAT. Some applications to which SAT solvers have been successfully applied are also presented. The intention is to assist someone interested in applying SAT technology in solving some stubborn class of combinatorial problems.作者: Mets552 時(shí)間: 2025-3-28 16:55 作者: concert 時(shí)間: 2025-3-28 21:33
Algorithms for the Satisfiability Problem,, and some theoretical aspects of SAT. Some applications to which SAT solvers have been successfully applied are also presented. The intention is to assist someone interested in applying SAT technology in solving some stubborn class of combinatorial problems.作者: 思想流動(dòng) 時(shí)間: 2025-3-29 00:49
Computing Distances Between Evolutionary Trees,distance and a closely related distance called the subtree-transfer distance used in dealing with evolutionary histories involving events like recombinations or gene conversions; some variants of these distances will also be discussed.作者: Hallmark 時(shí)間: 2025-3-29 05:47
Panos M. Pardalos,Ding-Zhu Du,Ronald L. GrahamThis second edition features 30% new additional content, additional chapters as well as updated content.Editors-in-chief are renowned members of the operations research and mathematics communities.Sub作者: 貪婪的人 時(shí)間: 2025-3-29 10:47 作者: agonist 時(shí)間: 2025-3-29 14:09
Springer Science+Business Media New York 2013作者: 冷淡一切 時(shí)間: 2025-3-29 19:26 作者: 果仁 時(shí)間: 2025-3-29 22:41
Adilson R. Gon?alves,Ulf Schuchardtof dual versions, variations on bin sizes and item packing, as well as those produced by additional constraints. The bin packing papers are classified according to a novel scheme that allows one to create a compact synthesis of the topic, the main results, and the corresponding algorithms.作者: 多樣 時(shí)間: 2025-3-30 03:03
https://doi.org/10.1007/978-1-349-62733-2 the sake of completeness, these fundamental tools are also discussed in detail before the extensions with underlying combinatorial optimization problems. A number of computationally challenging data mining algorithms that have non-convex formulations are also explored.作者: 水獺 時(shí)間: 2025-3-30 06:33
Twentieth-century Children‘s Writershis chapter is to briefly review the graph-theoretic and combinatorial optimization concepts that are important in the context of data mining, as well as to discuss the interpretation of these concepts from mathematical modeling?perspective.作者: 增強(qiáng) 時(shí)間: 2025-3-30 11:18
https://doi.org/10.1007/978-1-349-00143-9on problem, existing in literature for a long time. Due to wide applications of the minimum Connected Dominating Set in wireless networks, Connected Dominating Sets attract many recent research efforts. In this chapter, those developments are surveyed.作者: 整潔 時(shí)間: 2025-3-30 13:26
Bin Packing Approximation Algorithms: Survey and Classification,of dual versions, variations on bin sizes and item packing, as well as those produced by additional constraints. The bin packing papers are classified according to a novel scheme that allows one to create a compact synthesis of the topic, the main results, and the corresponding algorithms.作者: meditation 時(shí)間: 2025-3-30 19:57
Combinatorial Optimization in Data Mining, the sake of completeness, these fundamental tools are also discussed in detail before the extensions with underlying combinatorial optimization problems. A number of computationally challenging data mining algorithms that have non-convex formulations are also explored.作者: 恃強(qiáng)凌弱的人 時(shí)間: 2025-3-30 20:42
Combinatorial Optimization Techniques for Network-Based Data Mining,his chapter is to briefly review the graph-theoretic and combinatorial optimization concepts that are important in the context of data mining, as well as to discuss the interpretation of these concepts from mathematical modeling?perspective.作者: 步兵 時(shí)間: 2025-3-31 02:34
Connected Dominating Set in Wireless Networks,on problem, existing in literature for a long time. Due to wide applications of the minimum Connected Dominating Set in wireless networks, Connected Dominating Sets attract many recent research efforts. In this chapter, those developments are surveyed.作者: 調(diào)整 時(shí)間: 2025-3-31 07:09
Twentieth-Century English History Playsnsportation and logistics engineering and the algorithms that have been devised over the years to solve them. The problems presented and studied in this contribution include the traffic assignment, the vehicle routing problem, and the toll pricing among others.作者: 符合規(guī)定 時(shí)間: 2025-3-31 12:40 作者: 是限制 時(shí)間: 2025-3-31 14:14
,Combinatorial Optimization in Transportation and Logistics?Networks,nsportation and logistics engineering and the algorithms that have been devised over the years to solve them. The problems presented and studied in this contribution include the traffic assignment, the vehicle routing problem, and the toll pricing among others.作者: 中古 時(shí)間: 2025-3-31 18:51
