请选择 进入手机版 | 继续访问电脑版

 找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Data Correcting Approaches in Combinatorial Optimization; Boris Goldengorin,Panos M. Pardalos Book 2012 Boris Goldengorin, Panos M. Pardal

[复制链接]
查看: 51577|回复: 35
发表于 2025-3-21 17:16:24 | 显示全部楼层 |阅读模式
书目名称Data Correcting Approaches in Combinatorial Optimization
编辑Boris Goldengorin,Panos M. Pardalos
视频video
概述Focuses on algorithmic applications of well known polynomially solvable special cases of computationally intractable problems.Discusses design of practically efficient algorithms for solving wide clas
丛书名称SpringerBriefs in Optimization
图书封面Titlebook: Data Correcting Approaches in Combinatorial Optimization;  Boris Goldengorin,Panos M. Pardalos Book 2012 Boris Goldengorin, Panos M. Pardal
描述​​​​​​​​​​​​​​​​​.Data Correcting Approaches in Combinatorial Optimization. focuses on algorithmic applications of the well known polynomially solvable special cases of computationally intractable problems. The purpose of this text is to design practically efficient algorithms for solving wide classes of combinatorial optimization problems.  Researches, students and engineers will benefit from new bounds and branching rules in development efficient branch-and-bound type computational algorithms. This book examines applications for solving the Traveling Salesman Problem and its variations, Maximum Weight Independent Set Problem, Different Classes of Allocation and Cluster Analysis  as well as some classes of Scheduling Problems. Data Correcting Algorithms in Combinatorial Optimization  introduces the data correcting approach to algorithms which provide an answer to the following questions: how to construct a bound to the original intractable problem and find which element of the corrected instance  one should branch such that the total size of search tree will be minimized. The PC time needed for solving intractable problems will be adjusted with the requirements for solving real wo
出版日期Book 2012
关键词algorithmics; cluster analysis; combinatorial optimization; data correcting algorithms; data structures;
版次1
doihttps://doi.org/10.1007/978-1-4614-5286-7
isbn_softcover978-1-4614-5285-0
isbn_ebook978-1-4614-5286-7Series ISSN 2190-8354 Series E-ISSN 2191-575X
issn_series 2190-8354
copyrightBoris Goldengorin, Panos M. Pardalos 2012
The information of publication is updating

书目名称Data Correcting Approaches in Combinatorial Optimization影响因子(影响力)




书目名称Data Correcting Approaches in Combinatorial Optimization影响因子(影响力)学科排名




书目名称Data Correcting Approaches in Combinatorial Optimization网络公开度




书目名称Data Correcting Approaches in Combinatorial Optimization网络公开度学科排名




书目名称Data Correcting Approaches in Combinatorial Optimization被引频次




书目名称Data Correcting Approaches in Combinatorial Optimization被引频次学科排名




书目名称Data Correcting Approaches in Combinatorial Optimization年度引用




书目名称Data Correcting Approaches in Combinatorial Optimization年度引用学科排名




书目名称Data Correcting Approaches in Combinatorial Optimization读者反馈




书目名称Data Correcting Approaches in Combinatorial Optimization读者反馈学科排名




单选投票, 共有 0 人参与投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 23:36:38 | 显示全部楼层
Data Correcting Approach for the Maximization of Submodular Functions,prescribed accuracy (the difference between optimal and current solution). The main idea of the data correcting approach for an arbitrary function . defined on a set . can be described as follows (see e.g., [66]).
发表于 2025-3-22 02:27:15 | 显示全部楼层
https://doi.org/10.1007/978-1-4757-9703-9In this chapter, our aim is to reduce the amount of time spent proving the optimality of the solution obtained. We propose a data correcting algorithm for the SPLP that is designed to output solutions with a prespecified . ε (see [53]).
发表于 2025-3-22 05:54:18 | 显示全部楼层
2190-8354 gn of practically efficient algorithms for solving wide clas​​​​​​​​​​​​​​​​​.Data Correcting Approaches in Combinatorial Optimization. focuses on algorithmic applications of the well known polynomially solvable special cases of computationally intractable problems. The purpose of this text is to de
发表于 2025-3-22 12:20:42 | 显示全部楼层
发表于 2025-3-22 15:27:11 | 显示全部楼层
发表于 2025-3-22 17:32:39 | 显示全部楼层
发表于 2025-3-23 00:17:56 | 显示全部楼层
Introduction,ion, the design of communication and transportation networks, the design of very large scale integration (VLSI) circuits, the design of automated production systems, artificial intelligence, machine learning, and software engineering.
发表于 2025-3-23 01:50:52 | 显示全部楼层
Book 2012e special cases of computationally intractable problems. The purpose of this text is to design practically efficient algorithms for solving wide classes of combinatorial optimization problems.  Researches, students and engineers will benefit from new bounds and branching rules in development efficie
发表于 2025-3-23 09:11:58 | 显示全部楼层
Data Correcting Approach for the Simple Plant Location Problem,In this chapter, our aim is to reduce the amount of time spent proving the optimality of the solution obtained. We propose a data correcting algorithm for the SPLP that is designed to output solutions with a prespecified . ε (see [53]).
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-14 06:22
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表