標(biāo)題: Titlebook: ; [打印本頁] 作者: HEM 時間: 2025-3-21 18:59
書目名稱Graph Theory in Operations Research影響因子(影響力)
書目名稱Graph Theory in Operations Research影響因子(影響力)學(xué)科排名
書目名稱Graph Theory in Operations Research網(wǎng)絡(luò)公開度
書目名稱Graph Theory in Operations Research網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Graph Theory in Operations Research被引頻次
書目名稱Graph Theory in Operations Research被引頻次學(xué)科排名
書目名稱Graph Theory in Operations Research年度引用
書目名稱Graph Theory in Operations Research年度引用學(xué)科排名
書目名稱Graph Theory in Operations Research讀者反饋
書目名稱Graph Theory in Operations Research讀者反饋學(xué)科排名
作者: 遵循的規(guī)范 時間: 2025-3-21 20:33 作者: occult 時間: 2025-3-22 01:29 作者: Repetitions 時間: 2025-3-22 08:16 作者: Saline 時間: 2025-3-22 12:44 作者: bonnet 時間: 2025-3-22 15:41 作者: bonnet 時間: 2025-3-22 19:04 作者: 易彎曲 時間: 2025-3-22 22:26
Hannele Niemi,Auli Toom,Arto Kallioniemi is referred to one of the specialist books (for example, Battersby, 1967, Moder and Phillips, 1970, Lock, 1971 and Burman, 1972). Elmaghraby (1977) may be consulted for a theoretical treatment of the area and for further information on resource allocation.作者: inhumane 時間: 2025-3-23 02:43
https://doi.org/10.1007/1-4020-2545-9ent distribution system is closely tied to locational decisions (siting of factories, warehouses, emergency facilities, etc.). In this chapter the locations of facilities within a transportation system will be assumed to be fixed and given, and the routing decisions needed to provide an efficient distribution system will be explored.作者: 模范 時間: 2025-3-23 05:35
Shortest Route Problems,dditive but of the forms given in exercise 2.7 parts (a) and (c) respectively.) Shortest paths between two vertices of a special network are sought in knapsack problems (section 2.4) and in the inspection and assembly line balancing problems discussed below (section 4.1 and exercise 4.2).作者: 帶傷害 時間: 2025-3-23 12:08 作者: 繁榮中國 時間: 2025-3-23 14:02 作者: amphibian 時間: 2025-3-23 22:03
https://doi.org/10.1007/978-3-322-91041-7valent to the problem of finding an optimal path from the root to a terminal node in a search tree (see section 2.4), and one technique for achieving this aim is that of discrete dynamic programming as shown in chapter 2. In this chapter an alternative technique, called branch-and-bound, is introduced and described.作者: exostosis 時間: 2025-3-24 00:21 作者: 思想上升 時間: 2025-3-24 02:42 作者: Endemic 時間: 2025-3-24 09:53 作者: tenosynovitis 時間: 2025-3-24 11:21
https://doi.org/10.1007/978-3-322-91041-7s actually made, and the branches from x represent the possible x‘choices of action at .. The problem of finding an optimal composite decision is equivalent to the problem of finding an optimal path from the root to a terminal node in a search tree (see section 2.4), and one technique for achieving 作者: 策略 時間: 2025-3-24 18:20
https://doi.org/10.1007/978-981-99-5402-5-problems of other optimisation problems. Shortest route problems have obvious relevance when a shortest (or quickest or least cost) route is required between two points of a transportation system. Similar problems arise when it is required to find a maximal flow or least cost flow augmenting chain 作者: 和平主義 時間: 2025-3-24 20:47
Hannele Niemi,Auli Toom,Arto Kallioniemit is the construction of a house, the launching of a new product or putting a satellite into space. Any such planning system should (Lock, 1971).For simple projects bar charts may be appropriate, but for more complex ones the critical path method (CPM) is to be preferred. Network aspects of this and作者: Fortify 時間: 2025-3-25 01:51
Hannele Niemi,Auli Toom,Arto Kallioniemi. visits n —1 other towns ., .,..., ., each once only, finally returning to .. If the distance . from town . to . is given for each pair (.) find a route for the salesman which minimises the total distance travelled. Much of the interest in the problem arises from the challenge presented by the fact作者: boisterous 時間: 2025-3-25 07:22
https://doi.org/10.1007/1-4020-2545-9materials need to be supplied from various sources to sites of manufacturing; finished goods are transported from factory to depots or supplied direct to customers; children are transported to and from school by bus; customer orders and enquiries ‘travel with’ a commercial traveller from actual and 作者: Phagocytes 時間: 2025-3-25 08:17 作者: 災(zāi)難 時間: 2025-3-25 13:58
https://doi.org/10.1007/978-1-4614-7538-5d for. This chapter extends the basic theory in several directions. Section 10.1 deals with dynamic (or time varying) flows, non-conserved flows and multi-commodity flows as well as some simple modifications to the basic theory. Section 10.2 centres around the concept of least cost flow of a particu作者: Immunization 時間: 2025-3-25 17:00 作者: 休戰(zhàn) 時間: 2025-3-25 22:45 作者: 金絲雀 時間: 2025-3-26 03:49
Branch-and-bound Methods,s actually made, and the branches from x represent the possible x‘choices of action at .. The problem of finding an optimal composite decision is equivalent to the problem of finding an optimal path from the root to a terminal node in a search tree (see section 2.4), and one technique for achieving 作者: Indicative 時間: 2025-3-26 06:31 作者: 表示向前 時間: 2025-3-26 12:18
Project Networks,t is the construction of a house, the launching of a new product or putting a satellite into space. Any such planning system should (Lock, 1971).For simple projects bar charts may be appropriate, but for more complex ones the critical path method (CPM) is to be preferred. Network aspects of this and作者: 增強(qiáng) 時間: 2025-3-26 15:15 作者: GUILT 時間: 2025-3-26 19:54
Distribution Problems,materials need to be supplied from various sources to sites of manufacturing; finished goods are transported from factory to depots or supplied direct to customers; children are transported to and from school by bus; customer orders and enquiries ‘travel with’ a commercial traveller from actual and 作者: 贊美者 時間: 2025-3-27 00:13
Flows in Networks: Basic Model,oad system, trains through a railway network, messages through a communication network, fluids through pipes, electricity through an electrical circuit, people through customs at a large airport, jobs capable of being produced on different machines through their production sequence. There is usually作者: 混合,攙雜 時間: 2025-3-27 04:57 作者: 路標(biāo) 時間: 2025-3-27 06:45 作者: effrontery 時間: 2025-3-27 12:38
https://doi.org/10.1057/9780230292321iven word being used to convey more than one concept. It is with the basic definitions that the situation is worst and in order to provide a sound framework, formal definitions of some of the more fundamental concepts will be given in the following sections. The terminology to be used will generally follow that of Berge (1962) and Kaufmann (1967).作者: Rct393 時間: 2025-3-27 14:00
Introduction,on . of a real continuous variable x where . Figure 1.1b also shows a graph, this time of . In both cases x can take on a (continuous) infinity of values and the graph consists of continuous lines containing an infinite number of points.作者: 令人發(fā)膩 時間: 2025-3-27 20:39 作者: indecipherable 時間: 2025-3-28 01:35 作者: d-limonene 時間: 2025-3-28 04:16 作者: SENT 時間: 2025-3-28 06:58
Location Problems,Situations in which a physical object, or objects, have to be located are of very frequent occurrence. The objects in question will be called .. A variety of factors have to be taken into account in location problems but a very commonly occurring one is that of ‘a(chǎn)ccessibility’, and this will be the feature of special interest in this chapter.作者: 彈藥 時間: 2025-3-28 14:10 作者: Predigest 時間: 2025-3-28 16:02
Erste wissenschaftliche Sitzung,ere asked to produce an Automatica version of the discussion paper, and this was eventually published as [9]. Although I have met Keith and had interesting and enjoyable discussions with him many, many times since then, these two papers remain our only joint publications.作者: 眉毛 時間: 2025-3-28 22:37
Efficient evolution of asymmetric recurrent neural networks using a PDGP-inspired two-dimensional rrograms) to evolve the architecture and the weights simultaneously. Our method can evolve general asymmetric recurrent architectures as well as specialized recurrent architectures. This paper describes the method and reports on results of its application.作者: 昏睡中 時間: 2025-3-29 02:58 作者: 倒轉(zhuǎn) 時間: 2025-3-29 06:02
Jens Spars?,Steve Furberich have mitigated the reformatory potential of European city networking. Providing important insights into city diplomacy and Europeanization, the book will appeal to scholars and students of public administration, European integration and political science, as well as professionals and practitioners.?.978-3-031-29502-7978-3-031-29500-3作者: 脆弱么 時間: 2025-3-29 08:57
Masonry Reinforcement Using Cabuya Fiber and Perimetral Electro-Welded Meshd out on two reinforced concrete frames infilled with block masonry, where it is shown that the percentage of strength improvement against seismic loads in a masonry reinforced using electro-welded mesh and cabuya fiber is 78.46% compared to simple infilled frames. Horizontal displacements at the to作者: Institution 時間: 2025-3-29 14:09 作者: 導(dǎo)師 時間: 2025-3-29 16:15
Jean Gerson, the Shulammite, and the Maidngenauigkeit in den Vorstellungen über die Rechtsanwendung, die sich in den herrschenden Auslegungstheorien ausdrückt, übertr?gt sich aber auch auf den Begriff der Rechtssch?pfung. So wenig wie eine Theorie der Auslegung ist eine Behandlung der Rechtssch?pfung ohne Zurückgreifen auf die Lehre von der Rechtsgeltung m?glich.作者: 有惡意 時間: 2025-3-29 23:36
Salvador Pardo-Gordóndle. These two obstructions are related to the presence of nonzero holomorphic vector fields. There is a conjecture that any compact K?hler manifold of positive anticanonical line bundle without any nonzero holomorphic vector field admits a K?hler-Einstein metric. The conjecture is still open. The 作者: 小淡水魚 時間: 2025-3-30 02:44
Artificial Moral Agency and Patiency, J. . [5] und D. . [1]. W?hrend in . [3] ebenfalls eine Axiomatisierung nach ., . und . vorgenommen wurde, ist in Klaua [1] eine Axiomatisierung angegeben, die sich durch eine Verschmelzung der . Typentheorie und des auf ., . und . zurückgehenden Aufbaus der Mengenlehre ergibt.
