找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

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

[復(fù)制鏈接]
查看: 19770|回復(fù): 61
樓主
發(fā)表于 2025-3-21 16:36:01 | 只看該作者 |倒序?yàn)g覽 |閱讀模式
書目名稱Handbook of Combinatorial Optimization
編輯Ding-Zhu Du,Panos M. Pardalos
視頻videohttp://file.papertrans.cn/422/421052/421052.mp4
圖書封面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
關(guān)鍵詞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影響因子(影響力)學(xué)科排名




書目名稱Handbook of Combinatorial Optimization網(wǎng)絡(luò)公開度




書目名稱Handbook of Combinatorial Optimization網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Handbook of Combinatorial Optimization被引頻次




書目名稱Handbook of Combinatorial Optimization被引頻次學(xué)科排名




書目名稱Handbook of Combinatorial Optimization年度引用




書目名稱Handbook of Combinatorial Optimization年度引用學(xué)科排名




書目名稱Handbook of Combinatorial Optimization讀者反饋




書目名稱Handbook of Combinatorial Optimization讀者反饋學(xué)科排名




單選投票, 共有 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

您所在的用戶組沒有投票權(quán)限
沙發(fā)
發(fā)表于 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.
板凳
發(fā)表于 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.
地板
發(fā)表于 2025-3-22 08:39:12 | 只看該作者
5#
發(fā)表于 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.
6#
發(fā)表于 2025-3-22 14:25:04 | 只看該作者
7#
發(fā)表于 2025-3-22 17:37:17 | 只看該作者
8#
發(fā)表于 2025-3-22 21:21:36 | 只看該作者
9#
發(fā)表于 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.
10#
發(fā)表于 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.
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-9 10:17
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
顺平县| 巩留县| 蕲春县| 蕉岭县| 澎湖县| 当阳市| 兴和县| 西贡区| 清涧县| 东源县| 榆树市| 吴江市| 九台市| 伊金霍洛旗| 保亭| 共和县| 筠连县| 资阳市| 鄂托克旗| 木里| 东兰县| 海林市| 收藏| 桂林市| 东安县| 泽普县| 阳新县| 城步| 沭阳县| 昌邑市| 保定市| 炎陵县| 清徐县| 秭归县| 沙雅县| 沽源县| 库伦旗| 秦皇岛市| 米林县| 固原市| 合江县|