ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

Sprache
Ergebnisse pro Seite
Sortieren nach
Sortierung
Anzahl gespeicherter Suchen in der Suchhistorie
E-Mail-Adresse
Voreingestelltes Exportformat
Voreingestellte Zeichencodierung für Export
Anordnung der Filter
Maximale Anzahl angezeigter Filter
Autovervollständigung
Themen (Es wird nur nach Zeitschriften und Artikeln gesucht, die zu einem oder mehreren der ausgewählten Themen gehören)
Feed-Format
Anzahl der Ergebnisse pro Feed
feed icon rss

Ihre E-Mail wurde erfolgreich gesendet. Bitte prüfen Sie Ihren Maileingang.

Leider ist ein Fehler beim E-Mail-Versand aufgetreten. Bitte versuchen Sie es erneut.

Vorgang fortführen?

Exportieren
Filter
  • Artikel  (4)
  • Artikel: DFG Deutsche Nationallizenzen  (4)
  • probabilistic analysis  (4)
  • Springer  (4)
  • 2010-2014
  • 1980-1984  (4)
  • 1950-1954
  • Wirtschaftswissenschaften  (4)
  • Geschichte
Sammlung
  • Artikel  (4)
Datenquelle
  • Artikel: DFG Deutsche Nationallizenzen  (4)
Verlag/Herausgeber
  • Springer  (4)
Erscheinungszeitraum
Jahr
Thema
  • 1
    Digitale Medien
    Digitale Medien
    Springer
    Annals of operations research 1 (1984), S. 23-42 
    ISSN: 1572-9338
    Schlagwort(e): Hierarchical planning problem ; stochastic programming ; heuristic ; performance measure ; probabilistic analysis ; asymptotic optimality ; machine scheduling
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik , Wirtschaftswissenschaften
    Notizen: 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.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 2
    Digitale Medien
    Digitale Medien
    Springer
    Annals of operations research 1 (1984), S. 67-78 
    ISSN: 1572-9338
    Schlagwort(e): Integer linear programming ; stochastic programming ; probabilistic analysis ; computational complexity ; order statistics
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik , Wirtschaftswissenschaften
    Notizen: Abstract A method is proposed to estimate confidence intervals for the solution of integer linear programming (ILP) problems where the technological coefficients matrix and the resource vector are made up of random variables whose distribution laws are unknown and only a sample of their values is available. This method, based on the theory of order statistics, only requires knowledge of the solution of the relaxed integer linear programming (RILP) problems which correspond to the sampled random parameters. The confidence intervals obtained in this way have proved to be more accurate than those estimated by the current methods which use the integer solutions of the sampled ILP problems.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 3
    Digitale Medien
    Digitale Medien
    Springer
    Annals of operations research 1 (1984), S. 291-303 
    ISSN: 1572-9338
    Schlagwort(e): Towers of Hanoi ; error-correcting algorithm ; probabilistic analysis ; discrete density function ; recurrence equations
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik , Wirtschaftswissenschaften
    Notizen: Abstract Any sequence of legal moves leads the Towers of Hanoi puzzle to an arrangement from which the final configuration must be built up. A recursive algorithm which finishes off the puzzle is considered and, assuming a uniform distribution on the possible unfinished situations, the density function of the number of moves it takes is derived.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 4
    Digitale Medien
    Digitale Medien
    Springer
    Annals of operations research 1 (1984), S. 215-238 
    ISSN: 1572-9338
    Schlagwort(e): Geometric location problems ; probabilistic analysis ; heuristics ; k center ; k median
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik , Wirtschaftswissenschaften
    Notizen: Abstract We analyze the behaviour of thek center and median problems forn points randomly distributed in an arbitrary regionA ofR d . Under a mild assumption on the regionA, we show that fork≦k(n)=o(n/logn), the objective function values of the discrete and continuous versions of these problems are equal to each otheralmost surely. For the two-dimensional case, both these problems can be solved by placing the centers or medians in an especially simple regular hexagonal pattern (the ‘honeycomb heuristic’ of Papadimitriou). This yields the exact asymptotic values for thek center and median problem, namely, α(|A|/k)1/2 and β(|A|/k)1/2, where |A| denotes the volume ofA, α and β are known constants, and the objective of the median problem is given in terms of the average, rather than the usual total, distance. For the 3- and 4-dimensional case, similar results can be obtained for the center problem to within an accuracy of roughly one percent. As a by-product, we also get asymptotically optimal algorithms for the 2-dimensionalp-normk median problem and for the twin problems of minimizing the maximum number of vertices served by any center and similarly for maximizing the minimum.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
Schließen ⊗
Diese Webseite nutzt Cookies und das Analyse-Tool Matomo. Weitere Informationen finden Sie hier...