標(biāo)題: Titlebook: Handbook of Combinatorial Optimization; Ding-Zhu Du,Panos M. Pardalos Book 1998 Springer Science+Business Media New York 1998 algorithms.a [打印本頁] 作者: 厭氧 時(shí)間: 2025-3-21 16:36
書目名稱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é)科排名
作者: 反抗者 時(shí)間: 2025-3-21 20:50
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.作者: BARK 時(shí)間: 2025-3-22 03:25
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.作者: fulmination 時(shí)間: 2025-3-22 08:39 作者: BOGUS 時(shí)間: 2025-3-22 09:03
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.作者: Ccu106 時(shí)間: 2025-3-22 14:25 作者: seruting 時(shí)間: 2025-3-22 17:37 作者: nonsensical 時(shí)間: 2025-3-22 21:21 作者: Heart-Rate 時(shí)間: 2025-3-23 03:27
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.作者: abysmal 時(shí)間: 2025-3-23 09: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.作者: patella 時(shí)間: 2025-3-23 11:58
https://doi.org/10.1057/9781137492852ems. At the heart of these approaches is a sequence of linear programming problems that drive the solution process. The success of such algorithms is strongly tied in with the strength or tightness of the linear programming representations employed.作者: forager 時(shí)間: 2025-3-23 14:45
Principles of the Twilight Theory,ent computational techniques have been developed to solve large size problems making it possible to solve many real world applications. This paper is a survey of the applications of the set covering, set packing, set partitioning models and their variants, including generalizations.作者: 激怒 時(shí)間: 2025-3-23 21:09 作者: Ischemic-Stroke 時(shí)間: 2025-3-24 01:39 作者: Congregate 時(shí)間: 2025-3-24 06:01
https://doi.org/10.1057/9780230286863ced that either . is inside the triangle formed by the given points and that the angles at . formed by the lines joining . to the three points are all 120°, or . is one of the three vertices and the angle at . formed by the lines joining . to the other two points is greater than or equal to 120°.作者: Conspiracy 時(shí)間: 2025-3-24 09:19 作者: 潛移默化 時(shí)間: 2025-3-24 14:14 作者: 聯(lián)想記憶 時(shí)間: 2025-3-24 18:24 作者: PACK 時(shí)間: 2025-3-24 21:42
Computing Distances between Evolutionary Trees,ard to compute, . the Hamming distance for binary strings, the Euclidean distance for geometric objects; some others are formulated as combinatorial optimization problems and thus pose nontrivial challenging algorithmic problems, sometimes even uncomputable, such as the universal information distance between two objects [4].作者: Left-Atrium 時(shí)間: 2025-3-25 00:23 作者: 掙扎 時(shí)間: 2025-3-25 03:20 作者: arthroscopy 時(shí)間: 2025-3-25 09:06
Steiner Minimal Trees in ,,: Theory, Algorithms, and Applications,n you would want to minimize the overall interconnecting distance between the atoms. This is fundamentally the Steiner problem in ... Figure 1 demonstrates a geometric construction for the Steiner Minimal Tree of N=6 vertices in ...作者: 寵愛 時(shí)間: 2025-3-25 14:18 作者: 令人悲傷 時(shí)間: 2025-3-25 18:50 作者: Aqueous-Humor 時(shí)間: 2025-3-25 22:20 作者: 季雨 時(shí)間: 2025-3-26 01:03 作者: 受人支配 時(shí)間: 2025-3-26 05:45 作者: Peristalsis 時(shí)間: 2025-3-26 11:09 作者: 玉米棒子 時(shí)間: 2025-3-26 15:24
Gwi-Taek Jeong,Young-Taig Oh,Don-Hee Parks that arise in computer science and operations research as well as continuous computational problems arising in the natural sciences and engineering. This chapter describes the conceptual basis and applications of interior-point methods for discrete problems in computing.作者: META 時(shí)間: 2025-3-26 20:36
Structural Analysis of Wheat Stemsconstraint. Several variants of the classical 0–1 Knapsack Problem will be considered with respect to relaxations, bounds, reductions and other algorithmic techniques for the exact solution. Computational results are presented to compare the actual performance of the most effective algorithms published.作者: Intercept 時(shí)間: 2025-3-27 00:12
https://doi.org/10.1007/978-94-6209-098-9s algebraic theory as the natural integer analog of the simplex approach to linear programming Although couched in algebra, the theory of Gr?bner bases and its consequences for integer programming are intimately intertwined with polyhedral geometry and lattice arithmetic which are staples of the traditional approach to this subject.作者: FIN 時(shí)間: 2025-3-27 01:39
Twitter als Basis wissenschaftlicher Studiens its edge set. Two edges are . if they connect to a common vertex. Two vertices .. and .. are adjacent if there is an edge . = (..,..) ∈ .. Finally, if . = (..,..) ∈ .,we say . is . to vertices .., ...作者: 認(rèn)識(shí) 時(shí)間: 2025-3-27 09:13
Existing Earnings and Wage Series,ating set problem is to find a set .’ of minimum cardinality, which is denoted by .(.). It is well known that the minimum dominating set problem is .-complete [9]. In this paper we consider on-line dominating set problems for general and permutation (simple) graphs.作者: 非實(shí)體 時(shí)間: 2025-3-27 12:12
Interior Point Methods for Combinatorial Optimization,s that arise in computer science and operations research as well as continuous computational problems arising in the natural sciences and engineering. This chapter describes the conceptual basis and applications of interior-point methods for discrete problems in computing.作者: choroid 時(shí)間: 2025-3-27 15:19
Knapsack Problems,constraint. Several variants of the classical 0–1 Knapsack Problem will be considered with respect to relaxations, bounds, reductions and other algorithmic techniques for the exact solution. Computational results are presented to compare the actual performance of the most effective algorithms published.作者: Wernickes-area 時(shí)間: 2025-3-27 19:47
,Gr?bner Bases in Integer Programming,s algebraic theory as the natural integer analog of the simplex approach to linear programming Although couched in algebra, the theory of Gr?bner bases and its consequences for integer programming are intimately intertwined with polyhedral geometry and lattice arithmetic which are staples of the traditional approach to this subject.作者: 無目標(biāo) 時(shí)間: 2025-3-27 22:32 作者: 攝取 時(shí)間: 2025-3-28 03:49 作者: 清楚說話 時(shí)間: 2025-3-28 08:19 作者: 放肆的我 時(shí)間: 2025-3-28 13:55
Book 1998 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作者: 和音 時(shí)間: 2025-3-28 14:34 作者: GEM 時(shí)間: 2025-3-28 19:36 作者: 五行打油詩(shī) 時(shí)間: 2025-3-28 22:54
Dynamical System Approaches to Combinatorial Optimization,methods for distributed and parallel processing. Because of the parallelization, these techniques are able to compute a given task much faster than algorithms which are using a traditional sequentially working digital computer..The analysis focuses on the linear two-dimensional (two-index) assignmen作者: GLARE 時(shí)間: 2025-3-29 05:23
Débora de Oliveira,Tito Lívio Moitinho Alveseloped for the solution of this class of problems, are presented in this paper: Generalized Benders Decomposition (GBD), Outer Approximation (OA), Generalized Cross Decomposition (GCD), Branch and Bound (BB), Extended Cutting Plane (ECP), and Feasibility Approach (FA). Some recent developments for t作者: Dendritic-Cells 時(shí)間: 2025-3-29 07:56 作者: LEVY 時(shí)間: 2025-3-29 14:35
Mixed-Integer Nonlinear Optimization in Process Synthesis,ons, the ., is exposed in this paper. Process Synthesis seeks to develop systematically process flowsheets that convert raw materials into desired products. In recent years, the optimization approach to process synthesis has shown promise in tackling this challenge. It requires the development of a 作者: accordance 時(shí)間: 2025-3-29 19:16
Connections between Nonlinear Programming and Discrete Optimization,s of . are isolated in some topology, i.e., every point of . has a neighbourhood which does not contain other points of .. Obviously, all combinatorial optimization problems are also discrete optimization problems but the converse is not true. A simple example is the problem of minimizing a function作者: SMART 時(shí)間: 2025-3-29 22:41
Interior Point Methods for Combinatorial Optimization,s that arise in computer science and operations research as well as continuous computational problems arising in the natural sciences and engineering. This chapter describes the conceptual basis and applications of interior-point methods for discrete problems in computing.作者: Perigee 時(shí)間: 2025-3-30 00:58
Knapsack Problems,constraint. Several variants of the classical 0–1 Knapsack Problem will be considered with respect to relaxations, bounds, reductions and other algorithmic techniques for the exact solution. Computational results are presented to compare the actual performance of the most effective algorithms publis作者: colloquial 時(shí)間: 2025-3-30 04:08
Reformulation-Linearization Techniques for Discrete Optimization Problems,stribution, economics and game theory, process design, and engineering design situations. Several recent advances have been made in the development of branch-and-cut algorithms for discrete optimization problems and in polyhedral outer-approximation methods for continuous nonconvex programming probl作者: formula 時(shí)間: 2025-3-30 08:16 作者: 大看臺(tái) 時(shí)間: 2025-3-30 16:10 作者: 無孔 時(shí)間: 2025-3-30 19:58
Efficient Algorithms for Geometric Shortest Path Query Problems,roblem of processing geometric shortest path queries is concerned with constructing an efficient data structure for quickly answering on-line queries for shortest paths connecting any two query points in a geometric setting. This problem is a generalization of the well-studied problem of computing a作者: 鍵琴 時(shí)間: 2025-3-30 20:55
Computing Distances between Evolutionary Trees,n, the study of thermodynamic costs of computing, cognitive science, .. Various models have been introduced to measure the degree of similarity or dissimilarity in the literature. In the latter case the degree of dissimilarity is also often referred to as the .. While some distances are straightforw作者: 柔美流暢 時(shí)間: 2025-3-31 02:07 作者: 自傳 時(shí)間: 2025-3-31 06:56
Steiner Minimal Trees: An Introduction, Parallel Computation, and Future Work,g mathematicians in history. In the mid-seventeenth century a simple problem was posed: Find the point . that minimizes the sum of the distances from . to each of three given points in the plane. Solutions to this problem were derived independently by Fermat, Torricelli, and Cavaliers. They all dedu作者: gerrymander 時(shí)間: 2025-3-31 11:08 作者: 大笑 時(shí)間: 2025-3-31 16:58
Combinatoral Optimization in Clustering,usually, a subset of the objects considered, or a subset of the variables, or both) consisting of the entities which are much “alike”, in terms of the data, versus the other part of the data. The term itself was coined in psychology back in thirties when a heuristical technique was suggested for clu作者: Virtues 時(shí)間: 2025-3-31 21:05 作者: 充滿人 時(shí)間: 2025-4-1 00:17 作者: 吞沒 時(shí)間: 2025-4-1 03:24 作者: Veneer 時(shí)間: 2025-4-1 07:02
On-line Dominating Set Problems for Graphs,ating set problem is to find a set .’ of minimum cardinality, which is denoted by .(.). It is well known that the minimum dominating set problem is .-complete [9]. In this paper we consider on-line dominating set problems for general and permutation (simple) graphs.
