找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Combinatorial Heuristic Algorithms with FORTRAN; H. T. Lau Book 1986 Springer-Verlag Berlin Heidelberg 1986 algorithms.combinatorial optim

[复制链接]
查看: 33759|回复: 40
发表于 2025-3-21 16:58:55 | 显示全部楼层 |阅读模式
书目名称Combinatorial Heuristic Algorithms with FORTRAN
编辑H. T. Lau
视频video
丛书名称Lecture Notes in Economics and Mathematical Systems
图书封面Titlebook: Combinatorial Heuristic Algorithms with FORTRAN;  H. T. Lau Book 1986 Springer-Verlag Berlin Heidelberg 1986 algorithms.combinatorial optim
描述In recent years researchers have spent much effort in developing efficient heuristic algorithms for solving the class of NP-complete problems which are widely believed to be inherently intractable from the computational point of view. Although algorithms have been designed and are notorious among researchers, computer programs are either not implemented on computers or very difficult to obtain. The purpose of this book is to provide a source of FORTRAN coded algorithms for a selected number of well-known combinatorial optimization problems. The book is intended to be used as a supplementary text in combinatorial algorithms, network optimization, operations research and management science. In addition, a short description on each algorithm will allow the book to be used as a convenient reference. This work would not have been possible without the excellent facilities of Bell-Northern Research, Canada. H. T. Lau lIe des Soeurs Quebec, Canada August 1986 CONTENTS Page Introduction Part I. INTEGER PROGRAMMING Chapter 1. Integer Linear Programming Chapter 2. Zero-one Linear Programming 30 Chapter 3. Zero-one Knapsack Problem 38 Part II. NETWORK DESIGN Chapter 4. Traveling Salesman Probl
出版日期Book 1986
关键词algorithms; combinatorial optimization; linear optimization; operations research; optimization
版次1
doihttps://doi.org/10.1007/978-3-642-61649-5
isbn_softcover978-3-540-17161-4
isbn_ebook978-3-642-61649-5Series ISSN 0075-8442 Series E-ISSN 2196-9957
issn_series 0075-8442
copyrightSpringer-Verlag Berlin Heidelberg 1986
The information of publication is updating

书目名称Combinatorial Heuristic Algorithms with FORTRAN影响因子(影响力)




书目名称Combinatorial Heuristic Algorithms with FORTRAN影响因子(影响力)学科排名




书目名称Combinatorial Heuristic Algorithms with FORTRAN网络公开度




书目名称Combinatorial Heuristic Algorithms with FORTRAN网络公开度学科排名




书目名称Combinatorial Heuristic Algorithms with FORTRAN被引频次




书目名称Combinatorial Heuristic Algorithms with FORTRAN被引频次学科排名




书目名称Combinatorial Heuristic Algorithms with FORTRAN年度引用




书目名称Combinatorial Heuristic Algorithms with FORTRAN年度引用学科排名




书目名称Combinatorial Heuristic Algorithms with FORTRAN读者反馈




书目名称Combinatorial Heuristic Algorithms with FORTRAN读者反馈学科排名




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

0票 0.00%

Perfect with Aesthetics

 

0票 0.00%

Better Implies Difficulty

 

1票 100.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 20:51:27 | 显示全部楼层
发表于 2025-3-22 01:58:06 | 显示全部楼层
Traveling Salesman Probleme and return back to the starting node in such a way that the total traveled distance is minimum. In graph terminology, the traveling salesman problem is to find the least cost Hamiltonian circuit in a given undirected graph.
发表于 2025-3-22 05:07:17 | 显示全部楼层
Book 1986arch, Canada. H. T. Lau lIe des Soeurs Quebec, Canada August 1986 CONTENTS Page Introduction Part I. INTEGER PROGRAMMING Chapter 1. Integer Linear Programming Chapter 2. Zero-one Linear Programming 30 Chapter 3. Zero-one Knapsack Problem 38 Part II. NETWORK DESIGN Chapter 4. Traveling Salesman Probl
发表于 2025-3-22 08:44:34 | 显示全部楼层
0075-8442 Linear Programming Chapter 2. Zero-one Linear Programming 30 Chapter 3. Zero-one Knapsack Problem 38 Part II. NETWORK DESIGN Chapter 4. Traveling Salesman Probl978-3-540-17161-4978-3-642-61649-5Series ISSN 0075-8442 Series E-ISSN 2196-9957
发表于 2025-3-22 13:07:41 | 显示全部楼层
Traveling Salesman Probleme and return back to the starting node in such a way that the total traveled distance is minimum. In graph terminology, the traveling salesman problem is to find the least cost Hamiltonian circuit in a given undirected graph.
发表于 2025-3-22 18:50:08 | 显示全部楼层
发表于 2025-3-22 23:07:33 | 显示全部楼层
发表于 2025-3-23 01:55:09 | 显示全部楼层
发表于 2025-3-23 09:11:58 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-7-4 10:40
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表