Unternehmensforschung
Công bố khoa học tiêu biểu
* Dữ liệu chỉ mang tính chất tham khảo
Sắp xếp:
Complexity of the multiobjective minimum weight minimum stretch spanner problem
Unternehmensforschung - - Trang 1-19 - 2024
In this paper, we take an in-depth look at the complexity of a hitherto unexplored multiobjective minimum weight minimum stretch spanner problem; or in short multiobjective spanner (MSp) problem. The MSp is a multiobjective generalization of the well-studied minimum t-spanner problem. This multiobjective approach allows to find solutions that offer a viable compromise between cost and utility—a pr...... hiện toàn bộ
Two basic problems in reliability-based structural optimization
Unternehmensforschung - Tập 46 - Trang 309-333 - 1997
Optimization of structures with respect to performance, weight or cost is a well-known application of mathematical optimization theory. However optimization of structures with respect to weight or cost under probabilistic reliability constraints or optimization with respect to reliability under cost/weight constraints has been subject of only very few studies. The difficulty in using probabilistic...... hiện toàn bộ
A min max problem
Unternehmensforschung - Tập 24 - Trang 191-200 - 1980
This paper studies a special class of min max problems in two sections. In Section I, a procedure is developed which gives the optimal solution of the problem. The Section II deals with ranking the solutions in increasing order of the value of the objective function.
On the effects of combining objectives in multi-objective optimization
Unternehmensforschung - Tập 82 - Trang 1-18 - 2015
In multi-objective optimization, one considers optimization problems with more than one objective function, and in general these objectives conflict each other. As the solution set of a multi-objective problem is often rather large and contains points of no interest to the decision-maker, strategies are sought that reduce the size of the solution set. One such strategy is to combine several object...... hiện toàn bộ
Optimal scheduling of tasks when service is subject to disruption: the preempt-repeat case
Unternehmensforschung - Tập 61 - Trang 147-169 - 2005
It has long been recognised that situations in which some key resource or service is to be allocated among jobs or customers competing for it are often subject to a range of uncertainties. Key amongst these concern the reliability of service itself. When the service being delivered to a job is disrupted by some failure of the service mechanism, it is reasonable to suppose that effort may subsequen...... hiện toàn bộ
Complete characterisation of the customer delay in a queueing system with batch arrivals and batch service
Unternehmensforschung - Tập 72 - Trang 1-23 - 2009
Whereas the buffer content of batch-service queueing systems has been studied extensively, the customer delay has only occasionally been studied. The few papers concerning the customer delay share the common feature that only the moments are calculated explicitly. In addition, none of these surveys consider models including the combination of batch arrivals and a server operating under the full-ba...... hiện toàn bộ
Utility indifference pricing and hedging for structured contracts in energy markets
Unternehmensforschung - Tập 85 - Trang 265-303 - 2017
In this paper we study the pricing and hedging of structured products in energy markets, such as swing and virtual gas storage, using the exponential utility indifference pricing approach in a general incomplete multivariate market model driven by finitely many stochastic factors. The buyer of such contracts is allowed to trade in the forward market in order to hedge the risk of his position. We f...... hiện toàn bộ
Stochastic optimal routing
Unternehmensforschung - Tập 12 - Trang 173-177 - 1968
In this paper, we wish to introduce the idea of stochastic effects in optimal routing problems. This can be done by committing mistakes while making decisions. We will illustrate this idea by a classical puzzle: “The Wine Pouring Problem”.
Tổng số: 2,028
- 1
- 2
- 3
- 4
- 5
- 6
- 10