找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Handbook of Combinatorial Optimization; Ding-Zhu Du,Panos M. Pardalos Book 1998 Springer Science+Business Media New York 1998 algorithms.a

[复制链接]
查看: 19681|回复: 61
发表于 2025-3-21 16:36:01 | 显示全部楼层 |阅读模式
书目名称Handbook of Combinatorial Optimization
编辑Ding-Zhu Du,Panos M. Pardalos
视频video
图书封面Titlebook: Handbook of Combinatorial Optimization;  Ding-Zhu Du,Panos M. Pardalos Book 1998 Springer Science+Business Media New York 1998 algorithms.a
描述Combinatorial (or discrete) optimization is one of the most active fields in the interface of operations research, computer science, and applied math­ ematics. Combinatorial optimization problems arise in various applications, including communications network design, VLSI design, machine vision, air­ line crew scheduling, corporate planning, computer-aided design and man­ ufacturing, database query design, cellular telephone frequency assignment, constraint directed reasoning, and computational biology. Furthermore, combinatorial optimization problems occur in many diverse areas such as linear and integer programming, graph theory, artificial intelligence, and number theory. All these problems, when formulated mathematically as the minimization or maximization of a certain function defined on some domain, have a commonality of discreteness. Historically, combinatorial optimization starts with linear programming. Linear programming has an entire range of important applications including production planning and distribution, personnel assignment, finance, alloca­ tion of economic resources, circuit simulation, and control systems. Leonid Kantorovich and Tjalling Koopmans received the
出版日期Book 1998
关键词algorithms; artificial intelligence; combinatorial optimization; communication; dynamical systems; graph
版次1
doihttps://doi.org/10.1007/978-1-4613-0303-9
isbn_softcover978-1-4613-7987-4
isbn_ebook978-1-4613-0303-9
copyrightSpringer Science+Business Media New York 1998
The information of publication is updating

书目名称Handbook of Combinatorial Optimization影响因子(影响力)




书目名称Handbook of Combinatorial Optimization影响因子(影响力)学科排名




书目名称Handbook of Combinatorial Optimization网络公开度




书目名称Handbook of Combinatorial Optimization网络公开度学科排名




书目名称Handbook of Combinatorial Optimization被引频次




书目名称Handbook of Combinatorial Optimization被引频次学科排名




书目名称Handbook of Combinatorial Optimization年度引用




书目名称Handbook of Combinatorial Optimization年度引用学科排名




书目名称Handbook of Combinatorial Optimization读者反馈




书目名称Handbook of Combinatorial Optimization读者反馈学科排名




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

0票 0.00%

Perfect with Aesthetics

 

0票 0.00%

Better Implies Difficulty

 

0票 0.00%

Good and Satisfactory

 

1票 100.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 20:50:18 | 显示全部楼层
Connections between Nonlinear Programming and Discrete Optimization,l optimization problems are also discrete optimization problems but the converse is not true. A simple example is the problem of minimizing a function on the set of integer points contained in an unbounded polyhedron.
发表于 2025-3-22 03:25:46 | 显示全部楼层
Resource Allocation Problems,esources to be allocated. The amount of resources to be allocated to each activity is treated as a continuous or integer variable, depending on the cases. This can be viewed as a special case of the nonlinear programming problem or the nonlinear integer programming problem.
发表于 2025-3-22 08:39:12 | 显示全部楼层
发表于 2025-3-22 09:03:01 | 显示全部楼层
Efficient Algorithms for Geometric Shortest Path Query Problems,ocessing a variety of queries on exact and approximate shortest paths in a number of geometric and graphical settings. Some open problems and promising directions for future research are also discussed.
发表于 2025-3-22 14:25:04 | 显示全部楼层
发表于 2025-3-22 17:37:17 | 显示全部楼层
发表于 2025-3-22 21:21:36 | 显示全部楼层
发表于 2025-3-23 03:27:18 | 显示全部楼层
Hugh G. Lawford,Joyce D. Rousseaul optimization problems are also discrete optimization problems but the converse is not true. A simple example is the problem of minimizing a function on the set of integer points contained in an unbounded polyhedron.
发表于 2025-3-23 09:02:02 | 显示全部楼层
Conclusion: Bringing It All Back Home,esources to be allocated. The amount of resources to be allocated to each activity is treated as a continuous or integer variable, depending on the cases. This can be viewed as a special case of the nonlinear programming problem or the nonlinear integer programming problem.
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-10 18:04
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表