標(biāo)題: Titlebook: Operations Research Proceedings 2015; Selected Papers of t Karl Franz D?rner,Ivana Ljubic,Gernot Tragler Conference proceedings 2017 Spring [打印本頁(yè)] 作者: 烏鴉 時(shí)間: 2025-3-21 17:52
書目名稱Operations Research Proceedings 2015影響因子(影響力)
書目名稱Operations Research Proceedings 2015影響因子(影響力)學(xué)科排名
書目名稱Operations Research Proceedings 2015網(wǎng)絡(luò)公開度
書目名稱Operations Research Proceedings 2015網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Operations Research Proceedings 2015被引頻次
書目名稱Operations Research Proceedings 2015被引頻次學(xué)科排名
書目名稱Operations Research Proceedings 2015年度引用
書目名稱Operations Research Proceedings 2015年度引用學(xué)科排名
書目名稱Operations Research Proceedings 2015讀者反饋
書目名稱Operations Research Proceedings 2015讀者反饋學(xué)科排名
作者: Foreknowledge 時(shí)間: 2025-3-21 20:38
Using Contiguous 2D-Feasible 1D Cutting Patterns for the 2D Strip Packing Problemde any information about the location of the items contained, we investigate methods to provide . of patterns in the column generation and cutting plane process, respectively. Some computational results are also reported.作者: DAMP 時(shí)間: 2025-3-22 02:09
Computing Partitions with Applications to Capital Budgeting Problemsrameter tractability for several parameterized versions of the problem. For a lot of small parameter values we obtain efficient solutions for the partitioning capital budgeting problem. We also consider the connection to pseudo-polynomial algorithms.作者: harmony 時(shí)間: 2025-3-22 05:29 作者: moratorium 時(shí)間: 2025-3-22 12:47
Mathematical Optimization of a Magnetic Ruler Layout with Rotated Pole Boundariess is considered instead of the common rectangular ones. We present a mixed integer programming model for an optimal placement of the trapezoidal magnetic areas to obtain the longest possible ruler under constraints conditioned by production techniques, physical limits as well as mathematical approximation of the magnetic field.作者: 付出 時(shí)間: 2025-3-22 13:22
The Maximum Scatter TSP on a Regular Gridimal solutions for nodes on a line to a regular (.)-grid. The new algorithm . takes linear time to compute an optimal tour in some cases. It is asymptotically optimal and a (.)-approximation for the (.)-grid, which is the worst case.作者: 失眠癥 時(shí)間: 2025-3-22 18:16
Upper Bound for the Capacitated Competitive Facility Location Problems and the set of customers are finite. The customer demands are known, and the total demand covered by each of the facilities can not exceed its capacity. We propose the upper bound for the leader’s objective function based on solving of the estimating MIP.作者: Monocle 時(shí)間: 2025-3-22 22:49 作者: 大漩渦 時(shí)間: 2025-3-23 03:07
0721-5924 isions and big data.Includes supplementary material: This book gathers a selection of refereed papers presented at the “International Conference on Operations Research OR2015,” which was held at the University of Vienna, Austria, September 1-4, 2015. Over 900 scientists and students from 50 countrie作者: BARGE 時(shí)間: 2025-3-23 07:45 作者: Decongestant 時(shí)間: 2025-3-23 10:33 作者: Judicious 時(shí)間: 2025-3-23 17:23 作者: 生氣地 時(shí)間: 2025-3-23 21:47 作者: 陳列 時(shí)間: 2025-3-24 00:42
Exploiting Solving Phases for Mixed-Integer Programsn the MIP-solver SCIP, we demonstrate the usefulness of the phase concept both with an exact recognition of the optimality of a solution, and provide heuristic alternatives to make use of the concept in practice.作者: 褲子 時(shí)間: 2025-3-24 06:09 作者: FRAUD 時(shí)間: 2025-3-24 10:08 作者: 蝕刻 時(shí)間: 2025-3-24 14:03
Improving the Performance of MIP and MINLP Solvers by Integrated Heuristics algorithms that are tightly integrated within global MINLP solvers and analyze their impact on the overall solution process. This comprises generalizations of primal heuristics for MIP towards MINLP as well as novel ideas for MINLP primal heuristics and for heuristic algorithms to take branching decisions and to collect global information in MIP.作者: Flustered 時(shí)間: 2025-3-24 14:55
Robust Two-Stage Network Problemsarc costs are precisely known, and completed optimally in the second stage, after a true second-stage cost scenario occurs. The robust min-max criterion is used to compute an optimal solution. Several complexity results for the interval and discrete uncertainty representations are provided.作者: 尾隨 時(shí)間: 2025-3-24 21:59
978-3-319-42901-4Springer International Publishing Switzerland 2017作者: 滲透 時(shí)間: 2025-3-24 23:25
Operations Research Proceedings 2015978-3-319-42902-1Series ISSN 0721-5924 Series E-ISSN 2197-9294 作者: GREEN 時(shí)間: 2025-3-25 06:27
Karl Franz D?rner,Ivana Ljubic,Gernot TraglerPresents latest findings from research in OR.Introduces selected papers from a leading OR conference.Provides a special focus on optimal decisions and big data.Includes supplementary material: 作者: Psychogenic 時(shí)間: 2025-3-25 10:55 作者: insipid 時(shí)間: 2025-3-25 11:42 作者: 生命 時(shí)間: 2025-3-25 17:03
Goutam Sen,Mohan Krishnamoorthy,Vishnu Narayanan,Narayan Rangaraj作者: 天然熱噴泉 時(shí)間: 2025-3-25 20:27
Marzena Fügenschuh,Armin Fügenschuh,Marina Ludszuweit,Aleksandar Mojsic,Joanna Sokó?作者: 偽造 時(shí)間: 2025-3-26 00:13
An Experimental Study of Algorithms for Controlling Palletizersdels for randomly generated sequences using GLPK and CPLEX solvers. We also draw comparisons with a breadth first search solution for the problem (Gurski et al.,Modelling, Computation and Optimization in Information Systems and Management Sciences, 2015, [.]).作者: artless 時(shí)間: 2025-3-26 06:38
LP-Based Relaxations of the Skiving Stock Problem—Improved Upper Bounds for the Gap and computational simulations have shown that there is only a small difference (called gap) between the optimal objective values of the relaxation and the SSP itself. In this paper, we will present some new results and improved upper bounds for the gap of the SSP that are based on the theory of res作者: 山頂可休息 時(shí)間: 2025-3-26 08:52 作者: 極大痛苦 時(shí)間: 2025-3-26 14:17 作者: dapper 時(shí)間: 2025-3-26 17:52 作者: 捕鯨魚叉 時(shí)間: 2025-3-26 22:40 作者: Encephalitis 時(shí)間: 2025-3-27 01:16 作者: Repetitions 時(shí)間: 2025-3-27 06:18
ezieht, indem sie das Fremde und Unbekannte nach der Analogie dessen erkl?rt, was dem Menschen aus der unmittelbaren Erfahrung bekannt ist, und dies ist zugleich meist das Lebenswichtige und emotional Wirksame. Die Sachverhalte, welche auf diese Weise als erkl?rende Modellvorstellungen verwendet wer作者: consolidate 時(shí)間: 2025-3-27 09:59
Gregor Hendel dieses Problem nur einen Teilaspekt universell verbreiteter und das vor- und au?erphilosophische Denken ebenso wie die sogenannte traditionelle Philosophie zumindest ma?geblich mitbestimmender Formen der Weltauffassung darstellt. Der Fortgang _~ieser Untersuchungen hat in einer Reihe von Aufs?tzen 作者: 陳腐的人 時(shí)間: 2025-3-27 14:14 作者: linear 時(shí)間: 2025-3-27 18:13 作者: infinite 時(shí)間: 2025-3-28 01:59
Exploiting Solving Phases for Mixed-Integer Programsg solutions and in strengthening the relaxation. Intuitively, a dynamic solving strategy with an appropriate emphasis on different solving components and strategies is desirable during the search process. We propose an adaptive solver behavior that dynamically reacts on transitions between the three作者: 枯萎將要 時(shí)間: 2025-3-28 03:10
An Extended Formulation for the Line Planning Problemncies. Configurations account for all possible options to provide a required transportation capacity on an infrastructure edge. The proposed configuration model is strong in the sense that it implies several facet-defining inequalities for the standard model: set cover, symmetric band, MIR, and mult作者: MIR 時(shí)間: 2025-3-28 08:57 作者: Infinitesimal 時(shí)間: 2025-3-28 10:51 作者: 漸強(qiáng) 時(shí)間: 2025-3-28 18:29
Robust Two-Stage Network Problemsarc costs are precisely known, and completed optimally in the second stage, after a true second-stage cost scenario occurs. The robust min-max criterion is used to compute an optimal solution. Several complexity results for the interval and discrete uncertainty representations are provided.作者: Ischemia 時(shí)間: 2025-3-28 20:46
Composed Min-Max and Min-Sum Radial Approach to the Emergency System Designhe worst situated user must be considered. Optimization of the average user disutility is often related to the weighted .-median problem. To cope with both objectives, we have suggested a composed method. In the first phase, the disutility of the worst situated user is minimized. The second phase is作者: 鄙視讀作 時(shí)間: 2025-3-29 01:40
LP-Based Relaxations of the Skiving Stock Problem—Improved Upper Bounds for the Gapformulation, different (small) item lengths and corresponding availabilities are given. We aim at maximizing the number of objects with a certain minimum length that can be constructed by connecting the items on hand. Such computations are of high interest in many real world application, e.g. in ind作者: 左右連貫 時(shí)間: 2025-3-29 05:37
Creating Worst-Case Instances for Upper and Lower Bounds of the Two-Dimensional Strip Packing Probletrip Packing Problem. The idea of this new approach is to optimise the width and the height of all items aiming to find an instance with maximal performance ratio with respect to the considered heuristic. Therefore, we model the pattern obtained by the heuristic as a solution of an ILP problem and m作者: 微塵 時(shí)間: 2025-3-29 07:19 作者: 有節(jié)制 時(shí)間: 2025-3-29 13:42 作者: 不透明性 時(shí)間: 2025-3-29 16:13
Computing Partitions with Applications to Capital Budgeting Problemst ., ., has a return of . and a price of .. Further for every portfolio . there is capacity .. The task is to choose . disjoint portfolios . from . such that for every . the prices in . do not exceed the capacity . and the total return of this selection is maximized. From a computational point of vi作者: 調(diào)整 時(shí)間: 2025-3-29 21:37 作者: DIS 時(shí)間: 2025-3-30 00:11
The Onset of Congestion in Charging of Electric Vehicles for Proportionally Fair Network Management tly. Such development suggests that a congestion management protocol will be a crucial component of future technological innovations in low voltage networks. An important property of a suitable network capacity management protocol is to balance network efficiency and fairness requirements. Assuming 作者: Delirium 時(shí)間: 2025-3-30 04:45 作者: 赤字 時(shí)間: 2025-3-30 10:08
A Benders Decomposition Approach for Static Data Segment Location to Servers Connected by a Tree Baclocation, query routing, user assignment and network topology are also addressed simultaneously. We consider the problem with the backbone (server network) being restricted to be a tree. Although it is an extremely hard problem to solve in its original form, prior information on the segment allocati作者: malign 時(shí)間: 2025-3-30 16:03
Mathematical Optimization of a Magnetic Ruler Layout with Rotated Pole Boundariesent cycle at a reference point. From there, the position is determined by counting increments of a periodic graduation. Absolute methods do not need reference points, since the position can be read directly from the ruler. In the state of the art approach the absolute position on the ruler is encode作者: CUMB 時(shí)間: 2025-3-30 17:54 作者: interlude 時(shí)間: 2025-3-30 23:50 作者: Hirsutism 時(shí)間: 2025-3-31 01:46 作者: 膠水 時(shí)間: 2025-3-31 08:15 作者: Abnormal 時(shí)間: 2025-3-31 10:52
H. J. P. Keighley,F. R. McKim,A. Clark,M. J. Harrisonpital, and culture. Moreover, it shows that the creative manifestations of this spectre screen—both hiding and revealing—a persistent anxiety around Cubanness even as national identity is transformed by connections to the outside world..978-3-030-06589-8978-3-319-93103-6
