標題: Titlebook: Discrete Optimization and Operations Research; 9th International Co Yury Kochetov,Michael Khachay,Panos Pardalos Conference proceedings 201 [打印本頁] 作者: monster 時間: 2025-3-21 18:59
書目名稱Discrete Optimization and Operations Research影響因子(影響力)
書目名稱Discrete Optimization and Operations Research影響因子(影響力)學科排名
書目名稱Discrete Optimization and Operations Research網絡公開度
書目名稱Discrete Optimization and Operations Research網絡公開度學科排名
書目名稱Discrete Optimization and Operations Research被引頻次
書目名稱Discrete Optimization and Operations Research被引頻次學科排名
書目名稱Discrete Optimization and Operations Research年度引用
書目名稱Discrete Optimization and Operations Research年度引用學科排名
書目名稱Discrete Optimization and Operations Research讀者反饋
書目名稱Discrete Optimization and Operations Research讀者反饋學科排名
作者: 解開 時間: 2025-3-21 21:59
Novel Surfactants for Enhanced Oil Recoverythis paper we present the following results. Problem B can be solved by a 4-approximation algorithm in . time for . (.). Problem A can be solved by a 4-approximation algorithm in . time for .. Problem A can be solved by a 8-approximation algorithm in . time for any ..作者: parasite 時間: 2025-3-22 02:14
An Iterative Approach for Searching an Equilibrium in Piecewise Linear Exchange Models on variables and the modified conditions of the goods’ balances. For such a model the monotonicity property is violated. But it remains, if upper bounds are substituted by financial limits on purchases. This is the idea of proposed iterative algorithm for initial problem. It is a generalization of作者: FEAS 時間: 2025-3-22 05:10 作者: 淡紫色花 時間: 2025-3-22 11:25 作者: defenses 時間: 2025-3-22 15:59
0302-9743 rations Research, DOOR 2016, held in Vladivostok, Russia, in September 2016. . The 39 full papers presented in this volume were carefully reviewed and selected from 181 submissions. They were organized in topical sections named: discrete optimization; scheduling problems; facility location; mathemat作者: defenses 時間: 2025-3-22 18:26
Basim Abu-Jdayil,Mamdouh Ghannamheme. We propose a parallel implementation of the algorithm for a supercomputer, where the construction of position space layers for the hypothetical processors is conducted with use of discrete dynamic systems’ apparatus.作者: Aboveboard 時間: 2025-3-22 22:51 作者: 角斗士 時間: 2025-3-23 03:45
Conference proceedings 2016rganized in topical sections named: discrete optimization; scheduling problems; facility location; mathematical programming; mathematical economics and games; applications of operational research; and short communications.. . .作者: expunge 時間: 2025-3-23 07:35 作者: hypotension 時間: 2025-3-23 13:15
Basim Abu-Jdayil,Mamdouh Ghannamms for the m-PSP on random inputs with identical weight functions and for the m-PSP with different weight functions, as well. We describe in detail the cases of uniform and shifted exponential distributions of random inputs.作者: unstable-angina 時間: 2025-3-23 14:06
https://doi.org/10.1007/978-1-137-04142-5 center (centroid), i.e. the average value over all points in the cluster. We analyze the variant of the problem with cardinality constraints. We present an approximation algorithm for the problem and prove that it is a fully polynomial-time approximation scheme when the space dimension is bounded by a constant.作者: Peak-Bone-Mass 時間: 2025-3-23 21:30 作者: Cytology 時間: 2025-3-24 00:31 作者: Grandstand 時間: 2025-3-24 03:47 作者: 吝嗇性 時間: 2025-3-24 07:49 作者: 混雜人 時間: 2025-3-24 12:09
A Fully Polynomial-Time Approximation Scheme for a Special Case of a Balanced 2-Clustering Problem center (centroid), i.e. the average value over all points in the cluster. We analyze the variant of the problem with cardinality constraints. We present an approximation algorithm for the problem and prove that it is a fully polynomial-time approximation scheme when the space dimension is bounded by a constant.作者: curriculum 時間: 2025-3-24 15:14
PTAS for the Euclidean Capacitated Vehicle Routing Problem in ,king into account multiple depots, pick up and delivery options, time window restrictions, etc. But, to the best of our knowledge, almost none of these results go beyond the Euclidean plane. In this paper, we try to bridge this gap and propose an EPTAS for the Euclidean CVRP for any fixed dimension.作者: 2否定 時間: 2025-3-24 19:57 作者: Oligarchy 時間: 2025-3-25 01:19
0302-9743 ical programming; mathematical economics and games; applications of operational research; and short communications.. . .978-3-319-44913-5978-3-319-44914-2Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 絕緣 時間: 2025-3-25 05:45
https://doi.org/10.1007/978-1-4615-7981-6ction reduction steps such a point will most probably have a reduced objective function value. We present an exploratory experimental result that illustrates the behavior of LinSup on an infeasible LP problem.作者: jet-lag 時間: 2025-3-25 11:13 作者: 不滿分子 時間: 2025-3-25 12:54
https://doi.org/10.1007/978-1-137-04142-5e clusters is given as an input. It is shown that the problem is strongly NP-hard. A 2-approximation algorithm which runs in polynomial time for a fixed number of clusters is proposed for this problem.作者: 不確定 時間: 2025-3-25 19:44 作者: CHIDE 時間: 2025-3-25 23:34 作者: 雀斑 時間: 2025-3-26 02:55
An Approximation Algorithm for a Problem of Partitioning a Sequence into Clusters with Restrictions e clusters is given as an input. It is shown that the problem is strongly NP-hard. A 2-approximation algorithm which runs in polynomial time for a fixed number of clusters is proposed for this problem.作者: Bmd955 時間: 2025-3-26 06:31
Thermodynamic Properties of Micellar Systemss the waiting time for the service. Finally, the social costs under the equilibrium and under the optimal distribution are compared. It is shown that the price of anarchy can be infinitely large in the model with strategic pricing.作者: aggravate 時間: 2025-3-26 10:37
Recovery of Oil Using Surfactant-Based FoamsCSR?2013). Finally, refining a geometric algorithm due to Servakh (Diskretn. Anal. Issled. Oper.?7(1):75–82), we show that the more general . problem is fixed-parameter tractable parameterized by the partial order width combined with the maximum allowed difference between the earliest possible and factual starting time of a job.作者: GEN 時間: 2025-3-26 12:45 作者: 無能力 時間: 2025-3-26 18:40
Wardrop Equilibrium for Networks with the BPR Latency Functions the waiting time for the service. Finally, the social costs under the equilibrium and under the optimal distribution are compared. It is shown that the price of anarchy can be infinitely large in the model with strategic pricing.作者: implore 時間: 2025-3-26 21:53 作者: 琺瑯 時間: 2025-3-27 02:08 作者: 大雨 時間: 2025-3-27 09:15
Algorithmic Issues in Energy-Efficient Computationbattery-operated devices, personal computers, or large server farms. The main mechanisms that have been developed for saving energy are the ability of transitioning the device among multiple power states, and the use of dynamic voltage scaling (speed scaling).作者: 密碼 時間: 2025-3-27 10:30 作者: 天氣 時間: 2025-3-27 14:50
Short Survey on Graph Correlation Clustering with Minimization Criteriae objects. One of the most visual formalizations of clustering is the graph clustering, that is, grouping the vertices of a graph into clusters taking into consideration the edge structure of the graph whose vertices are objects and edges represent similarities between the objects..In this short sur作者: 吹氣 時間: 2025-3-27 19:04
Wardrop Equilibrium for Networks with the BPR Latency Function method for incoming traffic flow. The authors analytically derive a system of equations defining the optimal distribution of the incoming flow with minimum social costs, as well as a corresponding system of equations for the Wardrop equilibrium in this network. In particular, the Wardrop equilibriu作者: 生命 時間: 2025-3-28 01:01
A Review on Network Robustness from an Information Theory Perspectivens ranging from biological to social networks. In this context, one of the most discussed and important topics is the ability to distinguish similarities between networks. A probabilistic approach already showed useful in graph comparisons when representing the network structure as a set of probabil作者: 隱語 時間: 2025-3-28 04:02
An Iterative Approach for Searching an Equilibrium in Piecewise Linear Exchange Modelto the equilibrium problem in a linear exchange model and its variations. The conceptual base of this approach is the scheme of polyhedral complementarity. It has no analogs and made it possible to obtain the finite algorithms for some variations of the exchange model. Especially simple algorithms a作者: Ejaculate 時間: 2025-3-28 08:01
Handling Scheduling Problems with Controllable Parameters by Methods of Submodular Optimizationms over a submodular polyhedron intersected with a box. We explain a decomposition algorithm for solving the latter problem and discuss its implications for the relevant problems of preemptive scheduling on a single machine and parallel machines.作者: 專心 時間: 2025-3-28 10:58 作者: 脆弱帶來 時間: 2025-3-28 15:02 作者: 碳水化合物 時間: 2025-3-28 20:39 作者: Graduated 時間: 2025-3-29 01:09
On Asymptotically Optimal Approach to the m-Peripatetic Salesman Problem on Random InputsP with different weight functions on random inputs. The probabilistic analysis carried out for that algorithm is not suitable in the case of the m-PSP with identical weight functions..In this paper we present an approach which under certain conditions gives polynomial asymptotically optimal algorith作者: 勾引 時間: 2025-3-29 06:30
Efficient Randomized Algorithm for a Vector Subset Problem Euclidean space . such that the norm of the corresponding sum-vector is maximum. We derive the relation between algorithm’s time complexity, relative error and failure probability parameters. We show that the algorithm implements Polynomial-time Randomized Approximation Scheme (PRAS) for the genera作者: 表狀態(tài) 時間: 2025-3-29 09:39 作者: 創(chuàng)造性 時間: 2025-3-29 14:04
An Approximation Algorithm for a Problem of Partitioning a Sequence into Clusters with Restrictions um of squared distances between cluster elements and the corresponding cluster centers. It is assumed that the center of one of the desired clusters is the origin, while the centers of the other clusters are unknown and determined as the mean values over clusters elements. Additionally, there are a 作者: 惡意 時間: 2025-3-29 15:49
A Fully Polynomial-Time Approximation Scheme for a Special Case of a Balanced 2-Clustering Problem the weighted sum of the squared intracluster distances from the elements of the clusters to their centers. The weights of sums are the cardinalities of the clusters. The center of one of the clusters is given as input, while the center of the other cluster is unknown and determined as the geometric作者: Entropion 時間: 2025-3-29 23:15
PTAS for the Euclidean Capacitated Vehicle Routing Problem in ,d dimension. Thirty years ago, in their celebrated paper, M. Haimovich and A. Rinnoy Kan proposed the first PTAS for the Planar Single Depot CVRP based on their Iterated Tour Partition heuristic. For decades, this result was extended by many authors to numerous useful modifications of the problem ta作者: pester 時間: 2025-3-30 01:34
On Integer Recognition over Some Boolean Quadric Polytope Extension consider integer recognition over polytope . and its LP relaxation .. These polytopes are natural extensions of the well-known Boolean quadric polytope . and its rooted semimetric relaxation ...Integer recognition over . is NP-complete, since various special instances of 3-SAT problem like NAE-3SAT作者: lethal 時間: 2025-3-30 06:08
https://doi.org/10.1007/978-3-319-44914-2algorithms; approximation algorithms; clustering; computational results; discrete optimzation; game theor作者: 惡臭 時間: 2025-3-30 11:50 作者: 不可比擬 時間: 2025-3-30 15:14
E. Geladé,A. Verbeeck,F. C. De Schryverbattery-operated devices, personal computers, or large server farms. The main mechanisms that have been developed for saving energy are the ability of transitioning the device among multiple power states, and the use of dynamic voltage scaling (speed scaling).作者: 典型 時間: 2025-3-30 17:32
https://doi.org/10.1007/978-1-4615-7981-6linear. It allows to steer the iterates of a feasibility-seeking iterative process toward feasible points that have lower (not necessarily minimal) values of the objective function than points that would have been reached by the same feasiblity-seeking iterative process without superiorization. Usin作者: 無表情 時間: 2025-3-30 23:33
A. M. Bellocq,P. Honorat,D. Rouxe objects. One of the most visual formalizations of clustering is the graph clustering, that is, grouping the vertices of a graph into clusters taking into consideration the edge structure of the graph whose vertices are objects and edges represent similarities between the objects..In this short sur作者: 免除責任 時間: 2025-3-31 02:06 作者: Metamorphosis 時間: 2025-3-31 07:01
