標(biāo)題: Titlebook: Discrete Diversity and Dispersion Maximization; A Tutorial on Metahe Rafael Martí,Anna Martínez-Gavara Book 2023 The Editor(s) (if applicab [打印本頁] 作者: grateful 時(shí)間: 2025-3-21 16:41
書目名稱Discrete Diversity and Dispersion Maximization影響因子(影響力)
書目名稱Discrete Diversity and Dispersion Maximization影響因子(影響力)學(xué)科排名
書目名稱Discrete Diversity and Dispersion Maximization網(wǎng)絡(luò)公開度
書目名稱Discrete Diversity and Dispersion Maximization網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Discrete Diversity and Dispersion Maximization被引頻次
書目名稱Discrete Diversity and Dispersion Maximization被引頻次學(xué)科排名
書目名稱Discrete Diversity and Dispersion Maximization年度引用
書目名稱Discrete Diversity and Dispersion Maximization年度引用學(xué)科排名
書目名稱Discrete Diversity and Dispersion Maximization讀者反饋
書目名稱Discrete Diversity and Dispersion Maximization讀者反饋學(xué)科排名
作者: Cardiac 時(shí)間: 2025-3-22 00:03 作者: 紅潤 時(shí)間: 2025-3-22 02:13
Book 2023ny practical settings from facility location to social network analysis and constitute an important class of NP-hard problems in combinatorial optimization. In fact, this volume presents a “missing link” in the combinatorial optimization-related literature. In providing the basic principles and fund作者: 防水 時(shí)間: 2025-3-22 05:40 作者: opalescence 時(shí)間: 2025-3-22 12:30 作者: infatuation 時(shí)間: 2025-3-22 15:28 作者: infatuation 時(shí)間: 2025-3-22 17:24 作者: Finasteride 時(shí)間: 2025-3-23 00:44
Variable Neighborhood Searchy be exploited and show how they can be organized within variable neighborhood descent and variable neighborhood search heuristics. Finally, we provide insights on the performance of different VNS methodologies applied to two diversity problems: the maximum diversity problem and the capacitated dispersion problem.作者: 母豬 時(shí)間: 2025-3-23 01:37
Less Is More Approachst introduced to solve two diversity problems. In this chapter we present its general principles, and describe how it was used to solve the Max-Mean diversity problem in 2017 and minimum-differential dispersion problem in 2016.作者: 供過于求 時(shí)間: 2025-3-23 09:12 作者: COLIC 時(shí)間: 2025-3-23 12:25 作者: Flat-Feet 時(shí)間: 2025-3-23 17:13 作者: 改正 時(shí)間: 2025-3-23 18:11 作者: CHAFE 時(shí)間: 2025-3-24 01:00
Data Mining in Heuristic Searchhe computational results show that the new data mining heuristic improved the quality of the results obtained by the original GRASP heuristic. It also improved some best-known results from the literature.作者: insipid 時(shí)間: 2025-3-24 03:50
Multi-objective Optimizatione diversity problem (BODP), which considers the . and the . as objective functions to simultaneously maximize. Six different multi-objective algorithms have been described, analyzing their results on six performance metrics using a subset of instances from the MDPLIB 2.0 library.作者: expository 時(shí)間: 2025-3-24 07:48 作者: 勉勵(lì) 時(shí)間: 2025-3-24 10:43 作者: essential-fats 時(shí)間: 2025-3-24 18:04
The Association of Caribbean Statesy be exploited and show how they can be organized within variable neighborhood descent and variable neighborhood search heuristics. Finally, we provide insights on the performance of different VNS methodologies applied to two diversity problems: the maximum diversity problem and the capacitated dispersion problem.作者: Intractable 時(shí)間: 2025-3-24 20:44
The Association of Caribbean Statesst introduced to solve two diversity problems. In this chapter we present its general principles, and describe how it was used to solve the Max-Mean diversity problem in 2017 and minimum-differential dispersion problem in 2016.作者: BURSA 時(shí)間: 2025-3-25 02:46
https://doi.org/10.1007/978-94-011-1717-3k of the SS methodology, from the broader and more general case to the particular one of the diversity and dispersion problems. Specifically, two different SS designs have been described in detailed to solve a specific dispersion problem, the capacitated dispersion problem.作者: 笨拙處理 時(shí)間: 2025-3-25 05:32
https://doi.org/10.1007/978-3-031-38310-6Metaheuristics; discrete diversity; math programming models; branch and bound; integer programming; Greed作者: cylinder 時(shí)間: 2025-3-25 09:01 作者: Employee 時(shí)間: 2025-3-25 14:45
Geometrical Analysis of Solutionsally represent the optimal solutions of some diversity models when solving Euclidean instances. These representations help us to understand and differentiate the models and their area of applicability. In particular, we disclose which models are better suited for dispersion and which ones for representativeness.作者: Cholecystokinin 時(shí)間: 2025-3-25 16:17 作者: modifier 時(shí)間: 2025-3-25 22:12
Progress in Theoretical Computer Sciencensist in the selection of a subset of them in such a way that the diversity of the selected elements is maximized. These problems have been studied in depth over the last 30 years from an OR perspective. Different mathematical models have been proposed to include different aspects and to model reali作者: Fibrinogen 時(shí)間: 2025-3-26 01:16 作者: 植物茂盛 時(shí)間: 2025-3-26 04:36
The Barents Euro-Arctic Councilally represent the optimal solutions of some diversity models when solving Euclidean instances. These representations help us to understand and differentiate the models and their area of applicability. In particular, we disclose which models are better suited for dispersion and which ones for repres作者: 聰明 時(shí)間: 2025-3-26 08:46
Subregional Cooperation in the New Europe and subsequently add elements until a promising feasible solution is found. Their advantages are simplicity in design, analysis and implementation, and an intuitive structure. In general, though not always, they also have a limited computational complexity. An obvious counterpart is offered by dest作者: regale 時(shí)間: 2025-3-26 15:24 作者: Confidential 時(shí)間: 2025-3-26 18:11
Integration and Industrial Cooperation,In the last few years, it has been employed to solve a considerable number of optimization problems, including some diversity and dispersion problems. The first part of this chapter is devoted to the revision of the basic components for the design of this metaheuristic. It also presents the changes 作者: 有其法作用 時(shí)間: 2025-3-27 00:49 作者: 射手座 時(shí)間: 2025-3-27 04:00 作者: 花費(fèi) 時(shí)間: 2025-3-27 08:41
The Association of Caribbean Statest we use as few resources as possible in doing something while providing the best possible outcome. This approach has been applied successfully in almost all the scientific and art disciplines. However, in the optimization literature, it is relatively a new trend. The less is more philosophy was fir作者: pessimism 時(shí)間: 2025-3-27 11:48 作者: 我沒有強(qiáng)迫 時(shí)間: 2025-3-27 13:55 作者: DECRY 時(shí)間: 2025-3-27 19:45 作者: myopia 時(shí)間: 2025-3-27 22:37 作者: STENT 時(shí)間: 2025-3-28 04:31
Hiromi Watanabe,Girish Beedesseegent behavior, which requires a multi-objective point of view. To illustrate this kind of problems, this chapter presents the study of the bi-objective diversity problem (BODP), which considers the . and the . as objective functions to simultaneously maximize. Six different multi-objective algorithm作者: 不能妥協(xié) 時(shí)間: 2025-3-28 08:43
Rafael Martí,Anna Martínez-GavaraBasic principles and fundamental ideas of successful methodologies for discrete optimization.Allows the readers to create their own applications to other discrete optimization problems through tutoria作者: 愛花花兒憤怒 時(shí)間: 2025-3-28 12:03 作者: Perennial長期的 時(shí)間: 2025-3-28 15:01
Discrete Diversity and Dispersion Maximization978-3-031-38310-6Series ISSN 1931-6828 Series E-ISSN 1931-6836 作者: Anthology 時(shí)間: 2025-3-28 20:12
The Barents Euro-Arctic Councilally represent the optimal solutions of some diversity models when solving Euclidean instances. These representations help us to understand and differentiate the models and their area of applicability. In particular, we disclose which models are better suited for dispersion and which ones for representativeness.作者: Initial 時(shí)間: 2025-3-28 23:03 作者: Adulate 時(shí)間: 2025-3-29 04:32
1931-6828 as supplementary to a primary text in upper undergraduate courses..The chapters are divided into three main sections. The first section describes a metaheuristic methodology in a tutorial style, offering gener978-3-031-38312-0978-3-031-38310-6Series ISSN 1931-6828 Series E-ISSN 1931-6836 作者: 訓(xùn)誡 時(shí)間: 2025-3-29 11:19 作者: Popcorn 時(shí)間: 2025-3-29 14:32 作者: Engaged 時(shí)間: 2025-3-29 19:07
https://doi.org/10.1007/978-1-349-14650-5easibility or local optimality, which were usually treated as barriers. The methods based on these principles constitute nowadays the area called adaptive memory programming. Over a wide range of problem settings, the strategic use of memory in these methods has proved to make dramatic differences i作者: 玩忽職守 時(shí)間: 2025-3-29 19:47
Book 2023resented in each chapter, this book may be used in a master course, a doctoral seminar, or as supplementary to a primary text in upper undergraduate courses..The chapters are divided into three main sections. The first section describes a metaheuristic methodology in a tutorial style, offering gener作者: 輕推 時(shí)間: 2025-3-30 02:20 作者: insert 時(shí)間: 2025-3-30 06:54 作者: Irrigate 時(shí)間: 2025-3-30 10:54
Tabu Searcheasibility or local optimality, which were usually treated as barriers. The methods based on these principles constitute nowadays the area called adaptive memory programming. Over a wide range of problem settings, the strategic use of memory in these methods has proved to make dramatic differences i作者: athlete’s-foot 時(shí)間: 2025-3-30 12:57
