Library

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Computing 39 (1987), S. 165-174 
    ISSN: 1436-5057
    Keywords: 68E10 ; 62G30 ; Linear assignment problem ; order statistic ; asymptotic analysis
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Wir analysieren das asymptotische Verhalten des Erwartungswerts der kleinsten Ordnungsstatistik unter schwachen Voraussetzungen über die VerteilungsfunktionF. Dabei wird unterschieden, obF auf ganz (−∞, +∞) oder nur auf (0, ∞) definiert ist. Die Ergebnisse liefern asymptotische Abschätzungen für den Erwartungswert des optimalen Wertes beim linearen Zuordnungsproblem, wobei angenommen wird, daß die Kostenkoeffizienten unabhängige Zufallsvariable mit VerteilungsfunktionF sind.
    Notes: Abstract Under mild conditions on the distribution functionF, we analyze the asymptotic behavior in expectation of the smallest order statistic, both for the case thatF is defined on (−∞, +∞) and for the case thatF is defined on (0, ∞). These results yield asymptotic estimates of the expected optiml value of the linear assignment problem under the assumption that the cost coefficients are independent random variables with distribution functionF.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    ISSN: 1572-9982
    Source: Springer Online Journal Archives 1860-2000
    Topics: Economics
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Computing 31 (1983), S. 287-303 
    ISSN: 1436-5057
    Keywords: 68 E 05 ; Sorting ; probabilistic analysis
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Bei dem distributiven Sortierverfahren von Dobosiewicz wird sowohl das Intervall zwischen Minimum und Median als auch das Intervall zwischen Median und Maximum inn/2 Teilintervalle gleicher Länge zerlegt; die Prozedur wird dann rekursiv in jedem, mindestens vier Zahlen enthaltenden Teilintervall angesetzt. In dieser Arbeit werden einige Aspekte des Verfahrens verfeinert und erweitert. Insbesondere wird das asymptotisch lineare Verhalten unter verschiedene Wahrscheinlichkeits-Annahmen untersucht.
    Notes: Abstract In the distributive sorting method of Dobosiewicz, both the interval between the minimum and the median of the numbers to be sorted and the interval between the median and the maximum are partitioned inton/2 subintervals of equal length; the procedure is then applied recursively on each subinterval containing more than three numbers. We refine and extend previous analyses of this method, e.g., by establishing its asymptotic linear behaviour under various probabilistic assumptions.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    Annals of operations research 1 (1984), S. 43-58 
    ISSN: 1572-9338
    Keywords: Hierarchical planning models ; identical machine scheduling
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract In the hierarchical scheduling model to be considered, the decision at the aggregate level to acquire a number of identical machines has to be based on probabilistic information about the jobs that have to be scheduled on these machines at the detailed level. The objective is to minimize the sum of the acquisition costs and the expected average completion time of the jobs. In contrast to previous models of this type, the second part of this objective function corresponds to a well-solvable scheduling problem that can be solved to optimality by a simple priority rule. A heuristic method to solve the entire problem is described, for which strong asymptotic optimality results can be established.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Springer
    Annals of operations research 1 (1984), S. 23-42 
    ISSN: 1572-9338
    Keywords: Hierarchical planning problem ; stochastic programming ; heuristic ; performance measure ; probabilistic analysis ; asymptotic optimality ; machine scheduling
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract As we have argued in previous papers, multi-level decision problems can often be modeled as multi-stage stochastic programs, and hierarchical planning systems designed for their solution, when viewed as stochastic programming heuristics, can be subjected to analytical performance evaluation. The present paper gives a general formulation of such stochastic programs and provides a framework for the design and analysis of heuristics for their solution. The various ways to measure the performance of such heuristics are reviewed, and some relations between these measures are derived. Our concepts are illustrated on a simple two-level planning problem of a general nature and on a more complicated two-level scheduling problem.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 6
    Electronic Resource
    Electronic Resource
    Springer
    Acta applicandae mathematicae 3 (1985), S. 107-108 
    ISSN: 1572-9036
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 7
    Electronic Resource
    Electronic Resource
    Springer
    Journal of global optimization 1 (1991), S. 331-340 
    ISSN: 1573-2916
    Keywords: Bayesian stopping rules ; Multistart
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Suppose a sequential sample is taken from an unknown discrete probability distribution on an unknown range of integers, in an effort to sample its maximum. A crucial issue is an appropriate stopping rude determining when to terminate the sampling process. We approach this problem from a Bayesian perspective, and derive stopping rules that minimize loss functions which assign a loss to the sample size and to the deviation between the maximum in the sample and the true (unknown) maximum. We will show that our rules offer an extremely simple approximate solution to the well-known problem to terminate the Multistart method for continuous global optimization.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 8
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 88 (1996), S. 381-397 
    ISSN: 1573-2878
    Keywords: Augmented Lagrangians ; duality theory ; nonlinear optimization ; stability ; value function
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In duality theory, there is a trade-off between generality and tractability. Thus, the generality of the Tind-Wolsey framework comes at the expense of an infinite-dimensional dual solution space, even if the primal solution space is finite dimensional. Therefore, the challenge is to impose additional structure on the dual solution space and to identify conditions on the primal program, such that the properties that are typically associated with duality, like weak and strong duality, are preserved. In this paper, we consider real-valuedness, continuity, and additive separability as such additional structures. The virtue of the latter property is that it restores the one-to-one correspondence between primal constraints and dual variables as it exists in Lagrangian duality. The main result of this paper is that, roughly speaking, the existence of realvalued, continuous, and additively separable dual solutions that preserve strong duality is guaranteed, once the primal program satisfies a certain stability condition. The latter condition is ensured by the well-known regularity conditions that imply constraint qualification in Karush-Kuhn-Tucker points. On the other hand, if instead of additive separability, a mild tractability condition is imposed on the dual solution space, then stability turns out to be a necessary condition for strong duality in a well-defined sense. This result, combined with the observation that applicability of some well-known augmented Lagrangian methods to constrained optimization.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 9
    Electronic Resource
    Electronic Resource
    Springer
    Acta informatica 26 (1989), S. 679-696 
    ISSN: 1432-0525
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Summary We consider the problem of scheduling tasks on a single machine to minimize the flowtime. The machine is subject to breakdowns during the processing of the tasks. The breakdowns occur at a random times and the machine is unavailable until it is repaired. The times for repair are random and independent of each other and of the breakdown process. A task that is preempted due to a breakdown must be restarted and otherwise preemptions are not allowed. We show in the case of a single breakdown that if the distribution function of the time to breakdown is concave then Shortest Processing Time (SPT) first scheduling stochastically minimizes the flowtime. For the case of multiple breakdowns we show that SPT minimizes the expected flowtime when the times to breakdown are exponentially distributed. If the time for a single breakdown is known before scheduling begins, and the processing times of the tasks are also known, then we show that the problem of deciding whether there is a schedule with flowtime less than or equal to a given value is NP-complete. Finally, we bound the performance of SPT scheduling in the deterministic case when there is a single breakdown.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 10
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 22 (1982), S. 125-140 
    ISSN: 1436-4646
    Keywords: Stochastic Methods ; Global Optimization ; Clustering ; Confidence Interval
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract A stochastic method for global optimization is described and evaluated. The method involves a combination of sampling, clustering and local search, and terminates with a range of confidence intervals on the value of the global optimum. Computational results on standard test functions are included as well.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...