標(biāo)題: Titlebook: Robust and Online Large-Scale Optimization; Models and Technique Ravindra K. Ahuja,Rolf H. M?hring,Christos D. Zaro Book 2009 Springer-Verl [打印本頁] 作者: polysomnography 時(shí)間: 2025-3-21 17:28
書目名稱Robust and Online Large-Scale Optimization影響因子(影響力)
書目名稱Robust and Online Large-Scale Optimization影響因子(影響力)學(xué)科排名
書目名稱Robust and Online Large-Scale Optimization網(wǎng)絡(luò)公開度
書目名稱Robust and Online Large-Scale Optimization網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Robust and Online Large-Scale Optimization被引頻次
書目名稱Robust and Online Large-Scale Optimization被引頻次學(xué)科排名
書目名稱Robust and Online Large-Scale Optimization年度引用
書目名稱Robust and Online Large-Scale Optimization年度引用學(xué)科排名
書目名稱Robust and Online Large-Scale Optimization讀者反饋
書目名稱Robust and Online Large-Scale Optimization讀者反饋學(xué)科排名
作者: rheumatism 時(shí)間: 2025-3-21 22:27 作者: Hallowed 時(shí)間: 2025-3-22 01:11 作者: Talkative 時(shí)間: 2025-3-22 05:04 作者: 火花 時(shí)間: 2025-3-22 09:22
Light Robustnessms, one is typically required to determine a robust solution, i.e., a possibly suboptimal solution whose feasibility and cost is not affected heavily by the change of certain input coefficients. Two main classes of methods have been proposed in the literature to handle uncertainty: stochastic progra作者: 嚴(yán)重傷害 時(shí)間: 2025-3-22 15:38 作者: 有節(jié)制 時(shí)間: 2025-3-22 20:26
A Bicriteria Approach for Robust Timetablingm or of a solution have been suggested. However, there is always a trade-off between the best possible solution and a robust solution, called the price of robustness. In this paper, we analyze this trade-off using the following bicriteria approach. We treat an optimization problem as a bicriteria pr作者: 獨(dú)特性 時(shí)間: 2025-3-22 23:24
Meta-heuristic and Constraint-Based Approaches for Single-Line Railway Timetablingigence, which are able to cope with large scale problems as those in single-line railway timetable optimization. Timetable design is a central problem in railway planning. In the basic timetabling problem, we are given a line plan as well as demand and infrastructure information. The goal is to comp作者: HAVOC 時(shí)間: 2025-3-23 02:43 作者: 表狀態(tài) 時(shí)間: 2025-3-23 07:23 作者: MITE 時(shí)間: 2025-3-23 10:47
The Exact Subgraph Recoverable Robust Shortest Path Problem by simple means such as announcements. We introduce a model, in which the passenger computes his optimal route on his mobile device in a given subnetwork according to the actual travel times. Those travel times are sent to him as soon as a delay occurs..The main focus of this paper is on the calcul作者: landfill 時(shí)間: 2025-3-23 14:37 作者: occult 時(shí)間: 2025-3-23 19:50 作者: Atheroma 時(shí)間: 2025-3-23 23:07 作者: Acclaim 時(shí)間: 2025-3-24 02:52 作者: Factual 時(shí)間: 2025-3-24 09:05
Mining Railway Delay Dependencies in Large-Scale Real-World Delay Data such propagation as much as possible. To improve existing timetables, tools for automatic detection of systematic dependencies of delays among trains would be of great aid. We present efficient algorithms to detect two of the most important types of dependencies, namely dependencies due to resource作者: 懸崖 時(shí)間: 2025-3-24 12:55
Rescheduling Dense Train Traffic over Complex Station Interlocking Areasis task becomes more difficult when dealing with complex interlocking areas, since operational rules constrain the passage of trains through short track sections. This paper presents a detailed microscopic representation of the railway network that is able to tackle the complexity of a station area 作者: Limerick 時(shí)間: 2025-3-24 16:41 作者: 運(yùn)動(dòng)的我 時(shí)間: 2025-3-24 22:35 作者: 合唱團(tuán) 時(shí)間: 2025-3-25 00:01
Meta-heuristic and Constraint-Based Approaches for Single-Line Railway Timetablingme (both at changeovers and onboard), efficient use of trains, etc. Due to its central role in the planning process of railway scheduling, timetable design has many interfaces with other classical problems: line planning, vehicle scheduling, and delay management.作者: 狼群 時(shí)間: 2025-3-25 04:59 作者: GRIPE 時(shí)間: 2025-3-25 10:12 作者: 健壯 時(shí)間: 2025-3-25 13:57 作者: 廢止 時(shí)間: 2025-3-25 17:21 作者: myriad 時(shí)間: 2025-3-25 20:24
Integrating Robust Railway Network Design and Line Planning under Failures different concepts of robustness are considered: one from the user’s point of view, which aims at minimizing total travel time, and one from the operator’s point of view, which aims at minimizing extra costs, both assuming possible disruptions.作者: Obverse 時(shí)間: 2025-3-26 03:17
Effective Allocation of Fleet Frequencies by Reducing Intermediate Stops and Short Turning in Transiectives: minimizing passenger overload, maximizing passenger mobility and minimizing passenger loss. Schedules for decongesting and recovering the line are determined by means of optimization models. Heuristic approaches are discussed and computational results for a real case study are provided.作者: 修剪過的樹籬 時(shí)間: 2025-3-26 06:14
A Bicriteria Approach for Robust Timetablingthe case in which the robustness is defined as the largest delay for which all connections are maintained we show the bicriteria problem can be solved with the same time complexity as the original single-criteria problem.作者: Deject 時(shí)間: 2025-3-26 11:17 作者: PAD416 時(shí)間: 2025-3-26 13:56 作者: 長處 時(shí)間: 2025-3-26 18:53
Light Robustnessming approach, and has a number of important advantages in terms of flexibility and ease to use. In particular, experiments on both random and real word problems show that Light Robustness is sometimes able to produce solutions whose quality is comparable with that obtained through stochastic progra作者: 說笑 時(shí)間: 2025-3-26 21:33
Incentive-Compatible Robust Line Planning incentives of the line operators..By investigating a resource allocation mechanism (originally developed in the context of communication networks), we show that a socially optimal solution can be accomplished in certain situations via an anonymous incentive-compatible pricing scheme for the usage o作者: 癡呆 時(shí)間: 2025-3-27 04:42 作者: Commonwealth 時(shí)間: 2025-3-27 08:12 作者: 尖牙 時(shí)間: 2025-3-27 13:30
Integrated Gate and Bus Assignment at Amsterdam Airport Schipholg the gate assignment problem. We developed a column generation algorithm for this problem and have implemented a prototype. To make the algorithm efficient we used a special technique called stabilized column generation and also column deletion. Computational experiments with data based on real-lif作者: countenance 時(shí)間: 2025-3-27 14:49
Book 2009andard peer-review process, out of which 18 were finally accepted for publication...The volume is organized in four parts: Robustness and Recoverability, Robust Timetabling and Route Planning, Robust Planning Under Scarce Resources, and Online Planning: Delay and Disruption Management..作者: 迷住 時(shí)間: 2025-3-27 20:40 作者: 用不完 時(shí)間: 2025-3-28 00:21
Christian Liebchen,Marco Lübbecke,Rolf M?hring,Sebastian Stillerhtentscheidenden Ritterschaft hatte sich das Fu?volk wieder zu einer selbst?ndigen taktischen Formation entwickelt, die, in tiefgestaffelten Karrees formiert, nicht nur dem Sto? gepanzerter Reiter standzuhalten vermochte, sondern auch durch einen im Laufschritt vorgetragenen Angriff das gegnerische 作者: flex336 時(shí)間: 2025-3-28 03:21
Serafino Cicerone,Gianlorenzo D’Angelo,Gabriele Di Stefano,Daniele Frigioni,Alfredo Navarra,Michael ltung. Gerd Krumreich (2006) bem?ngelt allerdings, dass Meyer-Arndt den vor 1914 überall in Europa verbreiteten ?Topos vom unvermeidlichen Krieg“ nicht wirklich auslote: ?Dadurch steht aber der durchgehende Vorwurf im leeren Raum, dass Friedenserhaltung nicht oberstes Ziel der deutschen Politik gewe作者: intuition 時(shí)間: 2025-3-28 09:47 作者: 旁觀者 時(shí)間: 2025-3-28 13:37 作者: 夸張 時(shí)間: 2025-3-28 17:10 作者: RADE 時(shí)間: 2025-3-28 19:25 作者: absorbed 時(shí)間: 2025-3-29 02:31 作者: Colonnade 時(shí)間: 2025-3-29 03:55
Francesco Corman,Rob M. P. Goverde,Andrea D’Ariano作者: 向外 時(shí)間: 2025-3-29 09:11
Julie Jespersen-Groth,Daniel Potthoff,Jens Clausen,Dennis Huisman,Leo Kroon,Gábor Maróti,Morten Nyha作者: ordain 時(shí)間: 2025-3-29 13:03
Ravindra K. Ahuja,Rolf H. M?hring,Christos D. Zaro作者: hemoglobin 時(shí)間: 2025-3-29 16:02 作者: 知道 時(shí)間: 2025-3-29 19:57 作者: obsolete 時(shí)間: 2025-3-30 01:34
Matteo Fischetti,Michele Monacin des Krieges besch?ftigt. Dabei ist er nicht nur als Analytiker des Kriegsgeschehens aufgetreten, sondern hat immer wieder auch Ratschl?ge erteilt, wie man sich auf einen Krieg am besten vorbereite und was man bei der Führung eines Krieges zu beachten habe. Wie sonst auch, hat Machiavelli beim Them作者: Foolproof 時(shí)間: 2025-3-30 05:19
Engineering Time-Expanded Graphs for Faster Timetable Informationfaster query times with less space consumption than the original model. Moreover, we show that our extensions harmonize well with speed-up techniques whose adaption to timetable networks is more challenging than one might expect.作者: Femine 時(shí)間: 2025-3-30 09:47 作者: Additive 時(shí)間: 2025-3-30 12:37 作者: Intrepid 時(shí)間: 2025-3-30 17:58
Robust and Online Large-Scale Optimization978-3-642-05465-5Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 隼鷹 時(shí)間: 2025-3-30 23:32 作者: 大門在匯總 時(shí)間: 2025-3-31 02:11 作者: BOLUS 時(shí)間: 2025-3-31 08:36 作者: interlude 時(shí)間: 2025-3-31 10:08
,Human Psychology’s General Features,dy should be modified, but must then be re-validated. Even though some scales are prevalent and often used in HRI studies with a different context, researchers should still know their limitations and have a healthy suspicion that they are working as expected. We expand upon recommendations like thes作者: 割讓 時(shí)間: 2025-3-31 16:01 作者: Adenoma 時(shí)間: 2025-3-31 21:16 作者: 乏味 時(shí)間: 2025-3-31 21:56
2364-107X to formalization in the labour market, gender disparities in the labour market, disruption in social networks following urbanizations, attitudes towards multi-ethnic states); (4) building inclusive safety nets978-1-4899-8647-4978-1-4614-4945-4Series ISSN 2364-107X Series E-ISSN 2364-1088 作者: 強(qiáng)有力 時(shí)間: 2025-4-1 05:04 作者: 做事過頭 時(shí)間: 2025-4-1 09:30 作者: 瘙癢 時(shí)間: 2025-4-1 13:35
A Neural Network Based Inverse Kinematics Solution In RoboticsThis paper presents a new scheme to solve the inverse kinematics problem in Robotics by using the optimizability of the Hopfield network and the concept of the sliding mode control. Attention is given to the quality of the solution, to accommodating the redundant robots, and to the feasibility of using this scheme for Cartesian position control.
