ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

X
feed icon rss

Your email was sent successfully. Check your inbox.

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

Proceed reservation?

Export
Filter
  • Articles  (2,266)
  • Springer  (1,472)
  • Elsevier  (794)
  • American Institute of Physics
  • 2020-2022
  • 1985-1989  (2,266)
  • 1950-1954
  • 1945-1949
  • 1988  (2,266)
  • Economics  (2,266)
Collection
  • Articles  (2,266)
Source
Keywords
Publisher
Years
  • 2020-2022
  • 1985-1989  (2,266)
  • 1950-1954
  • 1945-1949
Year
Journal
Topic
  • 1
    Electronic Resource
    Electronic Resource
    Buchbesprechungen (1988)
    Springer
    OR spectrum 10 (1988), S. 28-28 
    Details
    ISSN: 1436-6304
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01720031
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    Maximum-Likelihood-Schätzung aus gruppierten Daten — eine Übersicht (1988)
    Springer
    OR spectrum 10 (1988), S. 1-12 
    Details
    ISSN: 1436-6304
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Description / Table of Contents: Summary Often statistical data are available only in grouped form. In this paper we give a survey on estimation of parameters from grouped data using the Maximum-Likelihood-Method. First some notation is introduced and it is shown how the loss of information due to grouping may be quantified. The stochastic properties of Maximum-Likelihood-Estimates and various methods for their computation are discussed. Finally some empirical examples are given.
    Notes: Zusammenfassung Statistische Daten sind oft nur in gruppierter Form verfügbar. In dieser Arbeit wird ein Überblick über die Maximum-Likelihood-Methode zur Parameterschätzung aus gruppierten Daten gegeben. Nach Einführung der Notation wird gezeigt, wie der Informationsverlust, der durch die Gruppierung entsteht, quantifiziert werden kann. Die stochastischen Eigenschaften der Maximum-Likelihood-Schätzer werden behandelt. Ausführlich wird auf verschiedene Methoden zur Berechnung der Maximum-Likelihood-Schätzwerte eingegangen. Einige empirische Beispiele schließen die Arbeit ab.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01720028
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    Discount-isotone policies for Markov decision processes (1988)
    Springer
    OR spectrum 10 (1988), S. 13-22 
    Details
    ISSN: 1436-6304
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Description / Table of Contents: Zusammenfassung Für unendlich-stufige diskontierte Markovsche Entscheidungsprozesse werden Bedingungen angegeben, unter denen sogenannte “diskont-isotone” optimale Politiken existieren. Eine diskont-isotone Familie von optimalen Politiken liegt vor, wenn die Zustands- und Aktionenräume halbgeordnet sind und für eine Menge von Diskontierungsfaktoren je eine optimale Politik existiert, so daß in jedem Zustand die optimalen Aktionen isoton vom Diskontierungsfaktor abhängen. Es kann günstiger sein, zunächst Probleme mit kleinem Diskontierungsfaktor zu lösen und dann die Isotonie-Eigenschaften zur Lösung für größere Diskontierungsfaktoren heranzuziehen.
    Notes: Summary This paper considers infinite horizon discounted Markov decision processes and conditions under which discount-isotone optimal policies exist. Given partial orders over the state and action spaces, a set of discount-isotone optimal policies is a set of optimal policies, one for each discount factor in a given set, such that, for each state, the optimal actions are partially ordered in such a manner as to match the ordering of the discount factors. It is easier to solve problems with small discount factors and the induced partial ordering facilitates the solutions for higher discount factor levels.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01720029
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Electronic Resource
    Electronic Resource
    Buchbesprechungen (1988)
    Springer
    OR spectrum 10 (1988), S. 36-36 
    Details
    ISSN: 1436-6304
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01720033
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 5
    Electronic Resource
    Electronic Resource
    Probabilistic analysis of a continuous review perishable inventory system with Markovian demand, Erlangian life and non-instantaneous lead time (1988)
    Springer
    OR spectrum 10 (1988), S. 23-27 
    Details
    ISSN: 1436-6304
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Description / Table of Contents: Zusammenfassung Der vorliegende Artikel behandelt einen expliziten Kostenausdruck für eine stetige Überprüfung der (S, s) Bestellpolitik eines Lagerhaltungssystems verderblicher Güter im stationären Fall. Der Kostenausdruck ist eng verbunden mit der stationären Verteilung des stochastischen ProzessesL(t), der den Lagerbestand zu jeder beliebigen Zeitt darstellt. Das stochastische Verhalten des Prozesses {L(t),t≳-0} wird characterisiert durch die Identifikation eines eingebetteten MRP. Die Nachfragewerte des Systems werden durch einen Poisson-Prozeß bestimmt. Die gelagerten Güter haben eine nutzbare Lebensdauer, die durch eine Erlang-Verteilung beschrieben wird. Die Durchlaufzeit ist eine Zufallsvariable mit spezifierter Wahrscheinlichkeitsverteilung. Es wird zudem unterstellt, daß nicht befriedigte Nachfrage bei leerem Lager verloren geht.
    Notes: Summary This article obtains an explicit cost expression for a continuous review (S, s) ordering policy inventory system of perishable items, in the stationary case. The cost expression is closely related to the stationary distribution of the stochastic processL(t), representing the inventory at any timet. The stochastic behaviour of the process {L(t),t≳-0} is characterised by identifying an imbedded MRP. The demands of the system are governed by a Poisson process. The items in the inventory have a useful life time characterised by an Erlangian distribution. The lead time is a random variable with specified probability distribution. It is assumed that the demands that arrive when the inventory is zero are lost.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01720030
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 6
    Electronic Resource
    Electronic Resource
    Enumerative techniques for solving some nonconvex global optimization problems (1988)
    Springer
    OR spectrum 10 (1988), S. 29-35 
    Details
    ISSN: 1436-6304
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Description / Table of Contents: Zusammenfassung Wir geben einen Überblick über verschiedene Methoden für nicht konvexe Minimisierungsaufgaben. Insbesondere diskutieren wir Aufzählungsmethoden für Extrempunkte. Wir betrachten konkave, quadratisch indefinite Probleme ebenso wie Probleme spezieller Struktur: konkave Netzwerk-Fluß-Probleme und lineare Komplementaritäts-Probleme. Wir schlagen neue Methoden vor, um lineare untere Schranken für Aufzählungstechnicken zu erhalten.
    Notes: Summary We give an overview on different methods for solving nonconvex minimization problems using techniques of enumeration of extreme points. The problems considered include concave, indefinite quadratic, and special structured problems such as the concave cost network flow problem and linear complementarity. For methods that enumerate the extreme points according to the ascending order of the value of a linear underestimating function we propose new techniques for obtaining such underestimators.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01720032
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 7
    Electronic Resource
    Electronic Resource
    Zur Besprechung eingegangene Bücher (1988)
    Springer
    OR spectrum 10 (1988), S. 54-54 
    Details
    ISSN: 1436-6304
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01720036
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 8
    Electronic Resource
    Electronic Resource
    Buchbesprechungen (1988)
    Springer
    OR spectrum 10 (1988), S. 54-54 
    Details
    ISSN: 1436-6304
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01720037
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 9
    Electronic Resource
    Electronic Resource
    Optimization of unloading strategy for bulk carriers (1988)
    Springer
    OR spectrum 10 (1988), S. 45-53 
    Details
    ISSN: 1436-6304
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Description / Table of Contents: Zusammenfassung Ein mathematisches Modell zur Berechnung der Entladezeit und Optimierung der Entlade-Strategie für mit Schüttgut beladene Schiffe ist zu entwickeln. Als erster Schritt wird in diesem Artikel der Entladevorgang einer einzigen Luke (Schiffs-Ladekammer) analysiert und durch ein mathematisches Modell beschrieben. Das Modell ermöglicht es dem Anwender, die Entladezeit einer Luke für beliebige Entlade-Dispositionen rechnerisch zu bestimmen und somit verschiedene Dispoitionen miteinander zu vergleichen.
    Notes: Summary A mathematical model for computation of unloading time and optimization of unloading strategy for ships transporting bulk goods is searched for. As the first step the unloading process of a single hatch (ship's freight room) is analysed and described by a mathematical model in this paper. The model essentially enables one to compute the unloading time of a hatch for any given unloading procedure and thus to compare and value different competing procedures.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01720035
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 10
    Electronic Resource
    Electronic Resource
    How long will fast food customers wait? (1988)
    Springer
    OR spectrum 10 (1988), S. 37-44 
    Details
    ISSN: 1436-6304
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Description / Table of Contents: Zusammenfassung Der Zusammenhang zwischen den grundlegenden Bedienungscharakteristiken eines Schnellimbißkiosks und dem Verhalten seiner Kunden wird anhand eines Modells untersucht, welches den Lernprozeß der wartenden Kunden in bezug auf die Bedienungszeit in Rechnung stellt. Das Modell ist auf zwei Fälle ausgelegt. Im ersten Fall wird ein Kiosk in einem Einkaufskomplex betrachtet, dessen Kunden unsicher über die Bedienrate sind. Der zweite Fall behandelt einen Kiosk in einem Bürokomplex, wobei die Kunden Vorinformationen über die Bedienrate besitzen. Simulationsexperimente mit dem Modell offenbaren, wie die Unterschiede zwischen der erwarteten (oder versprochenen) und der beobachteten (oder geleisteten) Bediengeschwindigkeit und -qualität den Verlust von Kundschaft verursachen, bei zwei hypothetischen sowie zwei realen Schnellimbissen.
    Notes: Summary The relationship between a fast-food kiosk's basic operating characteristics and its customers' behavior is examined using a model which takes into account the learning process of the waiting customers with respect to the service time. The model is adapted to two cases. In the first case, a kiosk in a shopping complex is considered, whose customers are uncertain about the service rate. The second case deals with a kiosk in an office complex and its customers have prior information about the service rate. Simulation experiments with the model reveal how the discrepancies between the expected (or promised) and perceived (or delivered) service speed and quality cause lost patronage at two hypothetical and two real world fast-food operations.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01720034
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 11
    Electronic Resource
    Electronic Resource
    DGOR-Jahrestagung 1988 (1988)
    Springer
    OR spectrum 10 (1988), S. 64-64 
    Details
    ISSN: 1436-6304
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01720039
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 12
    Electronic Resource
    Electronic Resource
    Zur Besprechung eingegangene Bücher (1988)
    Springer
    OR spectrum 10 (1988), S. 185-185 
    Details
    ISSN: 1436-6304
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01740514
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 13
    Electronic Resource
    Electronic Resource
    Optimale Innovationspolitik bei unvollständiger Information (1988)
    Springer
    OR spectrum 10 (1988), S. 173-183 
    Details
    ISSN: 1436-6304
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Description / Table of Contents: Summary The innovation problem of a single firm is described as a sequential decision problem under uncertainty. In each period the firm can improve its technology by R&D activities. It is shown that a “reservation technology” exists — the firm stops its efforts in R&D before reaching the technological limit. The reservation technology can be influenced by competition or basic research. Moreover, new insights into the innovation advantages of big corporations are given.
    Notes: Zusammenfassung Das Innovationsproblem einer Firma wird im Rahmen eines sequentiellen Entscheidungsproblems bei Unsicherheit behandelt. Dabei kann die Firma unter Aufwendung von F&E-Ausgaben in jeder Periode ihr bisheriges Technologieniveau/ihre bisherige Produktqualität verbessern. Unter plausiblen Annahmen kann gezeigt werden, daß ein „Reservationstechnologieniveau“ existiert, ab dem es für eine Firma nicht mehr lohnend ist, F&E zu betreiben. Innovationskonkurrenz bzw. Grundlagenforschung können diese kritische Grenze positiv beeinflussen. Ein neues, interessantes Ergebnis über den Zusammenhang zwischen Firmengröße und Innovationsaktivität wird demonstriert.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01740512
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 14
    Electronic Resource
    Electronic Resource
    Buchbesprechungen (1988)
    Springer
    OR spectrum 10 (1988), S. 186-194 
    Details
    ISSN: 1436-6304
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01740515
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 15
    Electronic Resource
    Electronic Resource
    Solution of placement and routing problems in telephone exchange unit designs (1988)
    Springer
    OR spectrum 10 (1988), S. 213-220 
    Details
    ISSN: 1436-6304
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Description / Table of Contents: Zusammenfassung Eines der Probleme, die beim Gestaltungsprozeß elektromechanischer Vermittlungseinheiten auftreten, besteht darin, viele untereinander verbundene Objekte auf Positionen anzuordnen, die eine gegebene Struktur bilden. In diesem Papier wird beschrieben, wie dieses Problem mit Plazierungs- und Reihenfolgeheuristiken gelöst werden kann. Das reale Problem wird kurz angesprochen und die Optimierungs-probleme werden formal dargestellt. Zwei verschiedene Ansätze für ihre Lösung werden vorgestellt und unter Berücksichtigung ihres Rechenaufwands diskutiert. Zusätzlich werden einige erläuternde Beispiele von verbesserten Gestaltungen gegeben.
    Notes: Summary One problem in the design of electromechanical exchange units consists in arranging a large number of interconnected objects in positions forming a given structure. We describe in the present paper how this problem can be solved with placement and routing heuristics. The real-life problem is briefly reported and the optimization problems are stated formally. Two different approaches to their solution are presented and discussed with reference to the computational effort required for each. Some illustrative examples of improved designs are also given.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01720248
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 16
    Electronic Resource
    Electronic Resource
    Strategische Planung horizontal und vertikal differenzierter Gesundheitsprogramme (1988)
    Springer
    OR spectrum 10 (1988), S. 221-235 
    Details
    ISSN: 1436-6304
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Description / Table of Contents: Summary We consider a health programme from a policy perspective. This programme is specified for certain subgroups of a population, which can be treated in varying intensities. Its effectiveness depends on resources spent. We take into account that several resource categories may exist. The group-specific subproblems are modelled as stochastic decision chains with continuous action space, piecewise linear, monotone, convex cost functions and finite horizon. This paper develops a LP-model for efficient, simultaneous resource allocation.
    Notes: Zusammenfassung Im Rahmen strategischer Überlegungen kann ein Gesundheitsprogramm für verschiedene Untergruppen einer Population jeweils spezifisch ausgelegt und unterschiedlich intensiv betrieben werden. Programmintensität und -Wirksamkeit hängen vom Ressourceneinsatz ab. Hier werden mehrere Ressourcenkategorien zugelassen, und die untergruppenspezifischen Teilprogramme werden als stochastische Entscheidungsketten mit stetigem Aktionsraum, stückweise linearen, monotonen, konvexen Kostenfunktionen und endlichem Horizont modelliert. Wir entwickeln ein LP-Modell, das die effiziente Simultanallokation der Ressourcen zum Ziel hat.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01720249
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 17
    Electronic Resource
    Electronic Resource
    Buchbesprechungen (1988)
    Springer
    OR spectrum 10 (1988), S. 236-236 
    Details
    ISSN: 1436-6304
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01720250
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 18
    Electronic Resource
    Electronic Resource
    Regent developments in time series forecasting (1988)
    Springer
    OR spectrum 10 (1988), S. 195-212 
    Details
    ISSN: 1436-6304
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Description / Table of Contents: Zusammenfassung „Extrapolative“ Zeitreihenprognoseverfahren sind in der betriebswirtschaftlichen Praxis weit verbreitet. Ihre große praktische Bedeutung hat nicht nur zur Entwicklung neuer Prognoseverfahren geführt, sondern auch zu vergleichenden Untersuchungen und Beurteilungen etablierter Methoden. Dieser Beitrag stellt eine Übersicht der wichtigsten „extrapolativen“ Prognoseverfahren dar. Darüberhinaus befaßt er sich mit neueren Untersuchungen zur relativen Genauigkeit dieser Verfahren und unterstreicht die teilweise unerwarteten Schlußfolgerungen dieser neuen Untersuchungen. Unternehmen sind daran interessiert, daß für sie am besten geeignete Prognoseverfahren zu wählen. Der Beitrag erörtert die Art des Wahlprozesses und bespricht die Frage, inwieweit Zeitreihenmethoden betriebswirtschaftliche Urteile ergänzen können. Zum Schluß befaßt sich der Beitrag kurz mit Prognoseverfahren Software und äußert eine persönliche Meinung über Zeitreihenprognoseverfahren.
    Notes: Summary Time series (extrapolative) forecasting procedures are widely used in business. Their importance has led to the development of new methods of forecasting and research into the evaluation of well-established methods. This paper presents an overview of the major methods of extrapolative forecasting. Secondly it considers the evidence on the relative accuracy of these methods, highlighting the unexpected conclusions arrived at by this new research. Organizations need to identify the forecasting method most appropriate to their particular circumstances. The paper discusses how such a selection should take place, commenting on how time series methods can complement managerial judgement. The paper concludes with some brief remarks on forecasting software, and a personal view of the future of time series forecasting.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01720247
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 19
    Electronic Resource
    Electronic Resource
    Buchbesprechungen (1988)
    Springer
    OR spectrum 10 (1988), S. 248-248 
    Details
    ISSN: 1436-6304
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01720252
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 20
    Electronic Resource
    Electronic Resource
    Call for papers (1988)
    Springer
    OR spectrum 10 (1988), S. 249-249 
    Details
    ISSN: 1436-6304
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01720253
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 21
    Electronic Resource
    Electronic Resource
    Dank den referenten (1988)
    Springer
    OR spectrum 10 (1988), S. 250-250 
    Details
    ISSN: 1436-6304
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01720254
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 22
    Electronic Resource
    Electronic Resource
    Empirische Erhebung über Verschnittsoftware (1988)
    Springer
    OR spectrum 10 (1988), S. 237-247 
    Details
    ISSN: 1436-6304
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Description / Table of Contents: Summary In order to make the German market for software on cutting stock problems more transparent suppliers of computer programs are assembled and asked on the basis of a detailed catalogue of criteria developed before. The paper documents this empirical investigation and presents the results for 28 programs of 14 different firms.
    Notes: Zusammenfassung Um auf dem unübersichtlichen Softwaremarkt das Angebot an Standardsoftware zur DV-mäßigen Unterstützung und Optimierung industrieller Zuschneideprozesse transparenter zu gestalten, wurden Anbieter entsprechender Programme erhoben und auf der Basis eines zuvor entwickelten Kriterienkatalogs befragt. Der Beitrag dokumentiert diese empirische Untersuchung und stellt als Ergebnis 28 Programme von 14 verschiedenen Anbietern vergleichend gegenüber.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01720251
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 23
    Electronic Resource
    Electronic Resource
    Tagungen (1988)
    Springer
    OR spectrum 10 (1988), S. 251-252 
    Details
    ISSN: 1436-6304
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01720255
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 24
    Electronic Resource
    Electronic Resource
    Zur Besprechung eingegangene Bücher (1988)
    Springer
    OR spectrum 10 (1988), S. 252-252 
    Details
    ISSN: 1436-6304
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01720256
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 25
    Electronic Resource
    Electronic Resource
    Buchbesprechungen (1988)
    Springer
    OR spectrum 10 (1988), S. 253-254 
    Details
    ISSN: 1436-6304
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01720257
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 26
    Electronic Resource
    Electronic Resource
    Tagungen (1988)
    Springer
    OR spectrum 10 (1988), S. 65-66 
    Details
    ISSN: 1436-6304
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01720040
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 27
    Electronic Resource
    Electronic Resource
    LPL: A structured language for linear programming modeling (1988)
    Springer
    OR spectrum 10 (1988), S. 55-63 
    Details
    ISSN: 1436-6304
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Description / Table of Contents: Zusammenfassung Dieser Artikel beschreibt eine spezialisierte Programmiersprache LPL (Linear Programming Language), die sich dazu eignet, LP-Modelle aufzubauen, zu modifizieren und dokumentieren. Die LPL-Sprache wurde zum Erstellen von MPSX-Input-Dateien größerer Modelle erfolgreich eingesetzt. Der LPL-Compiler übersetzt ein LPL-Programm, das ein vollständiges LP-Model repräsentiert, in zwei interne Dateien. Diese beiden Dateien können ihrerseits wieder übersetzt werden in eine Gleichungsliste, eine Matrix-Darstellung oder in eine MPSX-Datei. LPL beinhaltet ebenfalls eine Schnittstelle zur populären Datenbank dBASEIII, welche erlaubt, Daten, die vom LP-Model gebraucht werden, direkt ab der Datenbank einzulesen.
    Notes: Summary This paper describes a specialized programming language, named LPL (Linear Programming Language), which may be used to build, modify and document LP models. The LPL language has been successfully applied by the authors to generate automatically MPSX input files of large LP models. The LPL Compiler translates LPL programs, which represent concise and readable LP models, into two internal files. These files may be translated into an explicit equation listing, a picture (matrix layout) or the MPSX input file. LPL includes also a link to the popular relational database management system dBASEIII, which allows the LPL Compiler to read data, used in the LP model, directly from databases.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01720038
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 28
    Electronic Resource
    Electronic Resource
    Eine Charakterisierung der Unterhalbstetigkeit von Restriktionsmengen (1988)
    Springer
    OR spectrum 10 (1988), S. 67-76 
    Details
    ISSN: 1436-6304
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Description / Table of Contents: Summary This paper tries to characterize lower semicontinuous dependence of constraint sets on the constraint functions in convex and quasiconvex optimization. For this purpose the lower semicontinuity of the set theoretic intersection for convex sets is investigated, and we will see, that it is equivalent with the “Non-Separability” of the given convex sets. This “abstract” result contains obviously the solution for the lower semicontinuity of the constraint sets.
    Notes: Zusammenfassung Die vorliegende Arbeit will charakterisieren, wann sich Restriktionsmengen bei konvexen bzw. quasikonvexen Optimierungsproblemen in Abhängigkeit von den Restriktionsfunktionen unterhalbstetig ändern. Zu diesem Zweck wird die Unterhalbstetigkeit des mengentheoretischen Durchschnitts für konvexe Mengen untersucht, und sie erweist sich als gleichwertig mit der „Nicht-Trennbarkeit“ der gegebenen konvexen Mengen. Dieses „abstrakte“ Ergebnis liefert sofort die Lösung für die Unterhalbstetigkeit der Restriktionsmengen.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01720206
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 29
    Electronic Resource
    Electronic Resource
    Buchbesprechungen (1988)
    Springer
    OR spectrum 10 (1988), S. 112-112 
    Details
    ISSN: 1436-6304
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01720209
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 30
    Electronic Resource
    Electronic Resource
    Produktionstheoretische Fundierung industrieller Zuschneideprozesse (1988)
    Springer
    OR spectrum 10 (1988), S. 77-96 
    Details
    ISSN: 1436-6304
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Description / Table of Contents: Summary Using an activity analytic approach the fundamentals of a production theory of cutting stock and related processes are developed. Such relations exist to packing and loading processes. The systematic analysis of a few basic assumptions allows production models to be deduced which normally form the starting point in the application oriented literature. Thus the underlying premises of these models become apparent. Therefore prerequisites are created which make the relations between different model approaches easier to recognize, as well as the requirements for the utilization in practice. Some of the statements are also of importance for more general processes of elastic joint production.
    Notes: Zusammenfassung Auf der Basis eines Ansatzes der Aktivitätsanalyse werden die Grundzüge einer Produktionstheorie der Zuschneideprozesse entwickelt. Die systematische Analyse einiger an den Anfang gestellter Annahmen erlaubt die Ableitung von Produktionsmodellen, welche in der bisherigen, praxisorientierten Literatur der Verschnittoptimierung üblicherweise den Ausgangspunkt bilden. Dadurch werden Voraussetzungen geschaffen, welche es erleichtern, den Zusammenhang zwischen verschiedenen Modellansätzen sowie die Anwendungsvoraussetzungen abgeleiteter Handlungsempfehlungen besser zu erkennen. Eine Reihe abgeleiteter Aussagen besitzt auch Bedeutung für Pack- und Beladeprozesse sowie für allgemeinere Prozesse der elastischen Kuppel- bzw. Resteproduktion.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01720207
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 31
    Electronic Resource
    Electronic Resource
    A comparison of two optimization procedures for 1- and 1 1/2-dimensional cutting stock problems (1988)
    Springer
    OR spectrum 10 (1988), S. 97-111 
    Details
    ISSN: 1436-6304
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Description / Table of Contents: Zusammenfassung Zur Bestimmung der optimalen Lösung von 1- und 1 1/2-dimensionalen Verschnittproblemen werden zwei verschiedene LP-Modellformulierungen vorgeschlagen. Dies sind zum einen das vollständige Schnittmustermodell, das mit dem bekannten spaltenerzeugenden Verfahren von Gilmore und Gomory [9, 10] gelöst werden kann und zum anderen das Einzelschnittmodell von Rao [17] und Dyckhoff [2, 4], zu dessen Lösung Standardsoftware der Linearen Programmierung einsetzbar ist. Für die beiden Modelle und Lösungsverfahren werden bisher nicht beachtete Gemeinsamkeiten und Unterschiede herausgearbeitet, die Aufschluß über mögliche Anwendungsgebiete und die Vorzüge des jeweiligen Ansatzes erlauben. Es werden sowohl das Standardproblem der Verschnittoptimierung als auch praxisnahe Erweiterungen — wie verschiedene, beschränkt verfügbare Standardlängen und die Bewertung von Restlängen — untersucht. Zur Reduktion des Lösungsaufwandes werden drei auf beide Lösungsansätze anwendbare Reduktionsregeln angegeben. Testrechnungen mit drei aus der Literatur bekannten Verschnittproblemen zeigen die Vor- und Nachteile der beiden Ansätze.
    Notes: Summary There are two different LP-model formulations to obtain the optimal solution of 1- and 1 1/2-dimensional cutting stock problems. On the one hand there is the complete-cut LP-model which may be solved by the well-known column generation approach of Gilmore and Gomory [9, 10], while on the other hand Rao [17] and Dyckhoff [2, 4] propose an LP-model based on one-cuts to describe the cutting process, to be solved by standard LP software. For both models and solution approaches their commonalities and differences are elaborated, providing insights into possible application areas and the advantages of each approach. We will consider the standard cutting stock problem as well as real world extensions — like the limited availability of standard lengths and the evaluation of residual lengths. Furthermore, three reduction-rules are indicated which can reduce the solution effort. Test runs based on three cutting stock problems mentioned in the literature demonstrate the pros and cons of the two approaches.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01720208
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 32
    Electronic Resource
    Electronic Resource
    Tagungen (1988)
    Springer
    OR spectrum 10 (1988), S. 124-126 
    Details
    ISSN: 1436-6304
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01720211
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 33
    Electronic Resource
    Electronic Resource
    Zur Besprechung eingegangene Bücher (1988)
    Springer
    OR spectrum 10 (1988), S. 126-126 
    Details
    ISSN: 1436-6304
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01720212
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 34
    Electronic Resource
    Electronic Resource
    Practical adaptations of the Gilmore-Gomory approach to cutting stock problems (1988)
    Springer
    OR spectrum 10 (1988), S. 113-123 
    Details
    ISSN: 1436-6304
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Description / Table of Contents: Zusammenfassung Die Methode der verzögerten Schnittmuster-Generierung zur Lösung von Verschnittproblemen wurde von Gilmore und Gomory in den frühen 60er Jahren entwickelt. Die wesentlichste Barriere gegen einen verbreiteten Gebrauch der Methode ist ihre Beschränkung auf die Minimierung des Verschnitts. Die in diesem Beitrag beschriebenen Änderungen des Gilmore/Gomory Ansatzes erweitern den Anwendungsbereich. Die Modifikationen beziehen sich auf die Schnittmuster-Generierung der 1. Phase, mehrfache Lösungen pro Rucksackproblem, eine explizite Wertbestimmung von Unter- und Überdeckung der Nachfrage sowie auf einen wertbehafteten Verschnitt. Während einige Änderungen Verbesserungen des klassischen Ansatzes darstellen, erlauben alle Modifikationen zusammen komplexere Zielfunktionspezifikationen.
    Notes: Summary The delayed pattern generation approach to the solution of cutting stock problems was first proposed by Gilmore and Gomory in the early 1960's. The most significant barrier to its widespread acceptance in commercial applications is its inflexibility in dealing with objectives other than waste minimization. The adaptations of the basic Gilmore-Gomory approach presented in this article increase its flexibility. The adaptations relate to initial pattern generation, multiple solutions per knapsack problem, explicit valuation of undersupply and oversupply, and waste having a value. While some adaptations improve the basic approach, all adaptations lead to the ability to handle objectives more complex than solely waste minimization.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01720210
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 35
    Electronic Resource
    Electronic Resource
    Buchbesprechungen (1988)
    Springer
    OR spectrum 10 (1988), S. 127-127 
    Details
    ISSN: 1436-6304
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01720213
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 36
    Electronic Resource
    Electronic Resource
    Buchbesprechungen (1988)
    Springer
    OR spectrum 10 (1988), S. 128-128 
    Details
    ISSN: 1436-6304
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01720214
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 37
    Electronic Resource
    Electronic Resource
    Buchbesprechungen (1988)
    Springer
    OR spectrum 10 (1988), S. 144-144 
    Details
    ISSN: 1436-6304
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01740507
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 38
    Electronic Resource
    Electronic Resource
    Kostenkontrolle bei mehrstufigen Produktionsprozessen (1988)
    Springer
    OR spectrum 10 (1988), S. 129-143 
    Details
    ISSN: 1436-6304
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Description / Table of Contents: Summary Cost control approaches as known in literature are basically restricted to single-stage production processes. In multi-stage production processes the so calledinduced cost variances pose the problem, i.e. applying the two basic cost control approaches which show either the total or the terminal costs of a cost centre it frequently occurs that cost variances are shown in a cost centre, although they were caused and hence induced by preceeding or succeeding cost centres. A new cost control approach is developed which allows identification and assignment of induced cost variances to the responsible cost centres; this general cost control approach can be applied independent of the specific approach chosen, showing either the total costs or the terminal costs. It is built up by analogy to the cost control approach for a single-stage production process, but it also applies to any kind of multi-stage production process.
    Notes: Zusammenfassung Die aus der Literatur bekannten Kostenkontrollansätze beschränken sich grundsätzlich auf einstufige Produktionsprozesse. In mehrstufigen Produktionsprozessen tritt das Problem der induzierten Kostenabweichungen auf. Bei Anwendung des Gesamtkosten- oder Endkostenansatzes zur Kostenerfassung einer Stelle werden bei mehrstufigen Prozessen Kostenabweichungen ausgewiesen, die von vorgelagerten oder nachgelagerten Stellen verursacht worden sind und damit induzierte Abweichungen darstellen. Zur stellenspezifischen Zuordnung dieser Kostenabweichungen wird daher ein neuer Kontrollansatz konzipiert, der unabhängig vom gewählten Gesamtkosten- oder Endkostenansatz eingesetzt werden kann. Dieser Kostenkontrollansatz ist analog zum Kontrollansatz einstufiger Produktionsprozesse aufgebaut und allgemein für jeden beliebigen Typ mehrstufiger Prozesse einsatzfähig.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01740506
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 39
    Electronic Resource
    Electronic Resource
    Geometric fundamentals of the simplex method in semi-infinite programming (1988)
    Springer
    OR spectrum 10 (1988), S. 145-152 
    Details
    ISSN: 1436-6304
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Description / Table of Contents: Zusammenfassung Die natürliche Verallgemeinerung des Simplexverfahrens zur Behandlung linearer Optimierungsaufgaben mit unendlich vielen Nebenbedingungen gilt für das Duale Problem. Obwohl der zulässige Bereich zwar konvex im Raume der verallgemeinerten endlichen Folgen ist, behält er viele Eigenschaften vom endlichen Fall, die grundlegend um eine geometrische Deutung des Austausch-schritts zu erzeugen sind. Das Problem der Bestimmung von neuen Basismengen wird ebenfalls behandelt.
    Notes: Summary The natural extension of the simplex method to linear optimization problems with infinitely many constraints applies to their dual problems. Although the feasible sets are convex sets in spaces of generalized finite sequences, they preserve many of the properties of polyhedral convex sets in finite dimensional spaces. These properties are fundamental in obtaining a geometrical interpretation of the pivot operation. The problem of finding a basic set is also analyzed.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01740508
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 40
    Electronic Resource
    Electronic Resource
    On efficiency of linear programming applied to discounted Markovian decision problems (1988)
    Springer
    OR spectrum 10 (1988), S. 153-160 
    Details
    ISSN: 1436-6304
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Description / Table of Contents: Zusammenfassung Die lineare Programmierung ist zwar bekannt als Lösungsverfahren für diskontierte Markovsche Entscheidungsprobleme, es gibt aber nur wenige numerische Erfahrungen. Bei Verwendung der Simplexmethode können die Einträge des Tableaus auch im Sinne der stochastischen dynamischen Optimierung interpretiert werden. Für lineare Programme, die diskontierte Markovsche Entscheidungsprobleme repräsentieren, stellt eine Simplexmethode, die die spezielle Struktur der Restriktionsmatrix ausnutzt, ein effizientes Verfahren dar, falls (i) der Diskontierungsfaktor nahe bei 1 liegt und die geforderte Genauigkeit groß ist und (ii) entweder die Zustandsräume nicht zu groß oder die Übergangsmatrizen periodisch strukturiert sind.
    Notes: Summary Linear programming is known as a tool for discounted Markovian decision problems, but there are only a few numerical experiences. If the simplex method is used, the entries of the tableau can be described in terms of stochastic dynamic optimization, too. A simplex method which exploits the special structure of linear programs corresponding to discounted Markovian decision problems turns out to be efficient for problems with (i) discounting factors close to unity and high accuracy, and (ii) either not too large state spaces or periodically structured transition probability matrices.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01740509
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 41
    Electronic Resource
    Electronic Resource
    A unified approach to adaptive control of average reward Markov decision processes (1988)
    Springer
    OR spectrum 10 (1988), S. 161-166 
    Details
    ISSN: 1436-6304
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Description / Table of Contents: Zusammenfassung Das klassische Verfahren für die adaptive Steuerung von Markovschen Entscheidungsprozessen mit einem unbekannten Parameter und Durchschnittsgewinn-Kriterium wählt auf jeder Stufe eine Entscheidung, die durchschnittsoptimal ist für das Problem mit dem gerade geschätzten Parameter. Aber in vielen Fällen ist es nicht effektiv oder unmöglich, jeweils die optimale Politik für unendlichen Planungshorizont zu berechnen. Deshalb wurden Verfahren der sukzessiven Approximation vorgeschlagen und untersucht. Hier wird nun ein allgemeiner Ansatz vorgestellt, der die beiden genannten Methoden enthält und darüber hinaus den Rahmen für eine Reihe weiterer Verfahren bietet.
    Notes: Summary The classical procedure for the adaptive control of average reward Markov decision processes with an unknown parameter chooses at each stage a decision which is optimal for the average reward problem with the presently estimated parameter. But in many cases it is inefficient or impossible to compute each time the long run optimal policy. So successive approximation methods were proposed and investigated. We present a unifying and generalizing approach including both types of methods mentioned above and generating a lot of new procedures, too.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01740510
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 42
    Electronic Resource
    Electronic Resource
    Tagungen (1988)
    Springer
    OR spectrum 10 (1988), S. 184-185 
    Details
    ISSN: 1436-6304
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01740513
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 43
    Electronic Resource
    Electronic Resource
    A criterion for selecting log-linear models for contingency tables (1988)
    Springer
    OR spectrum 10 (1988), S. 167-172 
    Details
    ISSN: 1436-6304
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Description / Table of Contents: Zusammenfassung Für die Auswahl log-linearer Modelle für Kontingenztafeln wird eine neue Diskrepanz eingeführt, die Gauss Diskrepanz zwischen den Logarithmen der Häufigkeiten. Unter der Annahme, daß die beobachteten Häufigkeiten Poisson-verteilt sind, wird das loglineare Modell für diese Diskrepanz orthogonal: das Modellauswahlkriterium ist die Summe der Beiträge (zum Kriterium) der Effekte im Modell. Zur Auswahl eines Modells genügt es also, die Beiträge der einzelnen Effekte des gesättigten Modells getrennt zu berechnen. Das ausgewählte Modell enthält dann alle Effekte mit negativen Beiträgen. Es ist nicht notwendig, den Wert des Kriteriums für jedes mögliche Modell neu zu berechnen. Zwei Beispiele werden durchgerechnet.
    Notes: Summary A new discrepancy, the Gauss discrepancy of the logarithms of frequencies, is introduced for the selection of log-linear models for contingency tables. Under the assumption of Poisson sampling the loglinear model becomes orthogonal for this discrepancy: the model selection criterion is the sum of the contributions (to the criterion) of the effects in the model. It is, therefore, sufficient for model selection to compute the contributions of the effects in the saturated model. The selected model contains then all effects with negative contributions. It is not necessary to recompute the value of the criterion for all possible models. Two examples are given.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01740511
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 44
    Electronic Resource
    Electronic Resource
    Tracing the composition changes of Japan's consumer budget, 1920–1980 (1988)
    Springer
    Empirical economics 13 (1988), S. 59-64 
    Details
    ISSN: 1435-8921
    Source: Springer Online Journal Archives 1860-2000
    Topics: Economics
    Notes: Abstract Data over a wide time span are used to verify the superiority of a demand system over simple alternatives.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01971886
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 45
    Electronic Resource
    Electronic Resource
    Innovative behaviour, agglomeration economies and R&D infrastructure (1988)
    Springer
    Empirical economics 13 (1988), S. 35-57 
    Details
    ISSN: 1435-8921
    Source: Springer Online Journal Archives 1860-2000
    Topics: Economics
    Notes: Summary The present paper aims at analyzing two important conditions that — according to conventional wisdom — are assumed to act as driving forces for innovative behaviour of firms. The first condition is reflected in the so-called urban size hypothesis, which presupposes a close relationship between agglomeration size and innovative behaviour. The second condition incorporates the R&D infrastructure hypothesis, which assumes a positive impact of the presence of a research and knowledge infrastructure on innovative behaviour. Both hypotheses are tested on the basis of Dutch micro data on entrepreneurial innovations. In this framework, this paper also designs and employs a new and detailed measure for spatial agglomeration economies. It is concluded that the first hypothesis is in general difficult to validate, because in the Netherlands central cities are not in general more innovative. In this context, a third factor has been introduced, viz. the industrial composition effect. It is asserted (and demonstrated by means of loglinear modelling) that this factor — in combination with agglomeration economies — is a major determinant of the geographical distribution of innovations. As far as the second hypothesis is concerned, the results — based on Kendall's concordance coefficient — do not indicate the existence of a close correlation between R&D infrastructure and the spatial dispersion of innovations either.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01971885
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 46
    Electronic Resource
    Electronic Resource
    Semiparametric and nonparametric econometrics (1988)
    Springer
    Empirical economics 13 (1988), S. 121-122 
    Details
    ISSN: 1435-8921
    Source: Springer Online Journal Archives 1860-2000
    Topics: Economics
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01972443
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 47
    Electronic Resource
    Electronic Resource
    Testing for short-run money neutrality in a small open economy: The case of Canada (1988)
    Springer
    Empirical economics 13 (1988), S. 103-120 
    Details
    ISSN: 1435-8921
    Source: Springer Online Journal Archives 1860-2000
    Topics: Economics
    Notes: Abstract This paper adopts an econometric methodology which is based on standard nested-hypotheses testing in order to test the policy ineffectiveness proposition in the context of the Canadian economy. It thus avoids some problems associated with the non-nested hypotheses framework used by Barro and numerous other writers. The substantial openness of the Canadian economy is taken into account through the use of a Mundell-Flemming aggregate demand side. The supply response of the economy is carefully modelled, in the same context, and the familiar Sargent-Wallace aggregate supply function is derived as a special case of a more general Keynesian function — by assuming instantaneous adjustment of prices to costs. Empirical tests based on a data sample spanning the period of Canada's recent experience with flexible exchange rates are unfavorable to the policy ineffectiveness proposition.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01973317
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 48
    Electronic Resource
    Electronic Resource
    Nonparametric kernel estimation applied to forecasting: An evaluation based on the bootstrap (1988)
    Springer
    Empirical economics 13 (1988), S. 141-154 
    Details
    ISSN: 1435-8921
    Source: Springer Online Journal Archives 1860-2000
    Topics: Economics
    Notes: Abstract The results reported in this paper lend support to the nonparametric approach to estimating regression functions. This conclusion is based on a comparison of two sets of eight quarterly forecasts of U.S. hog supply generated by a well specified parametric dynamic model and by nonparametric kernel estimation. Despite the relatively small sample size, the nonparametric point forecasts are found to be as accurate as the parametric forecasts according to the mean square error and mean absolute error criteria. Bootstrap resampling is used to estimate the distributions of the forecast errors. The results of this exercise favour the nonparametric forecasts, which are found to have a tighter distribution.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01972445
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 49
    Electronic Resource
    Electronic Resource
    Bayes prediction density and regression estimation — A semiparametric approach (1988)
    Springer
    Empirical economics 13 (1988), S. 209-222 
    Details
    ISSN: 1435-8921
    Source: Springer Online Journal Archives 1860-2000
    Topics: Economics
    Notes: Abstract This paper is concerned with the Bayes estimation of an arbitrary multivariate density,f(x), x ∃ R k. Such anf(x) may be represented as a mixture of a given parametric family of densities {h (x¦θ)} with support inR k, whereθ (inR d) is chosen according to a mixing distributionG. We consider the semiparametric Bayes approach in whichG, in turn, is chosen according to a Dirichlet process prior with given parameterα. We then specialize these results whenf is expressed as a mixture of multivariate normal densitiesΦ (x¦Μ, λ) whereΜ is the mean vector and λ is the precision matrix. The results are finally applied to estimating a regression parameter.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01972449
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 50
    Electronic Resource
    Electronic Resource
    The role of fiscal policy in the St. Louis model: Nonparametric estimates for a small open economy (1988)
    Springer
    Empirical economics 13 (1988), S. 169-186 
    Details
    ISSN: 1435-8921
    Source: Springer Online Journal Archives 1860-2000
    Topics: Economics
    Notes: Abstract This paper reevaluates the efficacy of monetary and fiscal policies and bidirectional causality between income and each of the policy instruments used in the St. Louis model for aggregate demand using nonparametric (or infinite parametric) spectral methods. We proceed by estimating the strength of the correlations (or partial coherences) between income and each of the policy instruments over various frequencies. Then we obtain the corresponding band regression and Hannan's efficient estimates of both the lead and lag coefficients in the St. Louis model. The analysis is carried out with seasonally adjusted quarterly data and is divided into the flexible, fixed, and managed flexible exchange rate regimes. We find that while estimates from parametric regressions yield the standard conclusions for the St. Louis model, results from the nonparametric analysis are quite different. Specifically, the results of our analysis reveal that (i) both monetary and fiscal instruments are strongly correlated with income over cycles of 10 quarters or longer for the most recent period of the managed flexible exchange rate regime, and (ii) bidirectional causality exists between income and the fiscal policy instrument. These results suggest that both monetary and fiscal policy have a long-lasting effect on aggregate demand and that bidirectional causality exists between income and policy instruments. An explanation for the existence of bidirectional causality might be that the Canadian government generally pursued a purposeful discretionary fiscal policy during the post-World War II period. Furthermore, it appears that discretionary policy action may have been anticipated by rational, farsighted, and forward-looking economic agents. Finally, our results for the flexible exchange rate and fixed rate regimes are in agreement with the Mundell-Fleming view of the role of monetary fiscal policy in an open economy.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01972447
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 51
    Electronic Resource
    Electronic Resource
    Some simulation studies of nonparametric estimators (1988)
    Springer
    Empirical economics 13 (1988), S. 251-266 
    Details
    ISSN: 1435-8921
    Source: Springer Online Journal Archives 1860-2000
    Topics: Economics
    Notes: Abstract This paper constructs a number of Monte Carlo studies to assess the quality of various nonparametric estimators that have been proposed recently for the estimation of nonlinear econometric models. We consider both kernel and Fourier series based methods of estimation, and also examine techniques that have been suggested to improve the bias properties of the kernel estimator. The two models examined are a production function and a model emphasising the effects of risk. The Fourier estimator does very well in estimating the first of these, but not the second, while the kernel estimator shows substantial bias for the first, which is only partially alleviated by the procedures advocated for bias correction, and good results for the second.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01972451
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 52
    Electronic Resource
    Electronic Resource
    Estimating a hedonic earnings function with a nonparametric method (1988)
    Springer
    Empirical economics 13 (1988), S. 267-294 
    Details
    ISSN: 1435-8921
    Source: Springer Online Journal Archives 1860-2000
    Topics: Economics
    Notes: Abstract In this paper we apply the nonparametric approach of Bierens and Hartog (1988) to estimating and testing an earnings function which emphasizes the simultaneous impact of supply characteristics (like education) and demand characteristics (like job level). The data support this emphasis and point to significant non-linearities. In particular, job level comes out as an important variable.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01972452
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 53
    Electronic Resource
    Electronic Resource
    Using parallel function evaluations to improve hessian approximation for unconstrained optimization (1988)
    Springer
    Annals of operations research 14 (1988), S. 167-193 
    Details
    ISSN: 1572-9338
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract This paper presents a new class of methods for solving unconstrained optimization problems on parallel computers. The methods are intended to solve small to moderate dimensional problems where function and derivative evaluation is the dominant cost. They utilize multiple processors to evaluate the function, (finite difference) gradient, and a portion of the finite difference Hessian simultaneously at each iterate. We introduce three types of new methods, which all utilize the new finite difference Hessian information in forming the new Hessian approximation at each iteration; they differ in whether and how they utilize the standard secant information from the current step as well. We present theoretical analyses of the rate of convergence of several of these methods. We also present computational results which illustrate their performance on parallel computers when function evaluation is expensive.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02186479
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 54
    Electronic Resource
    Electronic Resource
    A prolog-based decision support system for computer capacity planning (1988)
    Springer
    Annals of operations research 12 (1988), S. 337-357 
    Details
    ISSN: 1572-9338
    Keywords: Decision support systems ; logic programming ; prolog ; artificial intelligence ; computer capacity planning ; planning for resource acquisition
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract This paper describes a project to implement a decision support system for computer capacity planning. The system provides an intelligent interface to the various models needed for this type of planning by assisting the user in model formulation, data manipulation, model execution, interpretation and manipulation of results. The implementation strategy is based on the integration of relational model and database management with logic. A modified version of a Prolog interpreter is utilized as the vehicle for this integrated strategy.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02186375
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 55
    Electronic Resource
    Electronic Resource
    Decomposition of multiattribute expected-utility functions (1988)
    Springer
    Annals of operations research 16 (1988), S. 161-183 
    Details
    ISSN: 1572-9338
    Keywords: Decomposition ; multiattribute ; utility function ; utility independence
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract This paper integrates and extends the theory of the decomposition of multiattribute expected-utility functions based on “utility independence”. In a preliminary section, the standard decision model of expected utility is briefly discussed, including the fact that the decision maker's preference forlotteries with two outcomes determines the utility function uniquely. The decomposition possibilities of a utility function are captured by the concept ofautonomous sets of attributes, an “affine separability” of some kind known as “generalized utility independence”.Overlapping autonomous sets lead to biaffine-associative, i.e.multiplicative oradditive decompositions. The multiplicative representation shows that autonomy has strongerclosure properties than utility independence, for instance with respect to set-theoretic difference. Autonomy is also a concept with a wider scope since it applies to the decomposition of Boolean functions, games and a number of other topics in combinatorial optimization. This relationship to the well-known theory ofsubstitution decomposition in discrete mathematics also reveals a kind of “discrete core” behind the decomposition of utility functions. The entirety of autonomous sets can be represented by a compact data structure, the so-calledcomposition tree, which frequently corresponds to a natural hierarchy of attributes. Multiplicative/additive ormulti-affine functions correspond to the hierarchy steps. The known representation of multi-affine functions is shown to be given by aMoebius inversion formula. The entire approach has the advantage that it allows the application of more sophisticated representation methods on a detailed level, whereas it employs onlyfinite set theory andarithmetic on the main levels in the hierarchy.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02283743
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 56
    Electronic Resource
    Electronic Resource
    Data structures and dynamic programming background for editing highly structured texts (1988)
    Springer
    Annals of operations research 16 (1988), S. 267-280 
    Details
    ISSN: 1572-9338
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract The interactive editing and formatting of texts structured by a hierarchy of non-standard layout features requires a thorough study of the data structures and algorithms used. It is well known that many text processing systems in this field suffer either from bad performance or reduced quality of outputs and screen representation. The aim of this note is to demonstrate how to overcome these difficulties using dynamic programming algorithms and suitably designed data structures controlling the layout of structured texts.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02283748
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 57
    Electronic Resource
    Electronic Resource
    Aspects of decision support for the exploratory analysis of univariate data (1988)
    Springer
    Annals of operations research 16 (1988), S. 333-345 
    Details
    ISSN: 1572-9338
    Keywords: Exploratory data analysis ; decision support
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract In recent years, exploratory data analysis (EDA) became an important topic in addition to descriptive and inferential statistics. In EDA some of the traditional methods are seen on the basis of a new working and thinking approach combined with flexibility and an absence of models. Because of the ad-hoc-character of the applied methods, the integration of computer science and the cyclical interaction with a batch, it seems to be necessary to integrate elements of decision support systems in the implementation of EDA methods. Conversely EDA methods can represent an important part of statistical inference within a decision support system. For the description of the basic concepts, selected methods of EDA for univariate data may be sufficient.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02283752
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 58
    Electronic Resource
    Electronic Resource
    Designing risk management support systems (1988)
    Springer
    Annals of operations research 16 (1988), S. 439-446 
    Details
    ISSN: 1572-9338
    Keywords: Risk ; risk management ; decision support ; IRIMS ; risk analysis
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract The major movements emerging in the field of risk analysis over the past decades are reviewed with special emphasis placed on their treatment of non-technical issues and their relevance to risk management needs. With this background, the requirements for an effective system to support risk management activities are discussed and a user-oriented design process outlined. The Ispra Risk Management Support (IRIMS) System is briefly described.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02283758
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 59
    Electronic Resource
    Electronic Resource
    Scheduling flexible machining and assembly systems (1988)
    Springer
    Annals of operations research 15 (1988), S. 337-352 
    Details
    ISSN: 1572-9338
    Keywords: Flexible systems ; machining ; assembly ; scheduling ; algorithms
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract Most scheduling papers consider flexible machining and assembly systems as being independent. In this paper, a heuristic two-level scheduling algorithm for a system consisting of a machining and an assembly subsystem is developed. It is shown that the upper level problem is equivalent to the two machine flow shop problem. The algorithm at the lower level schedules jobs according to the established product and part priorities. Related issues, such as batching, due dates, process planning and alternative routes, are discussed. The algorithm and associated concepts are illustrated on a number of numerical examples.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02186802
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 60
    Electronic Resource
    Electronic Resource
    A perspective on artificial intelligence: Learning to learn (1988)
    Springer
    Annals of operations research 16 (1988), S. 33-52 
    Details
    ISSN: 1572-9338
    Keywords: Artificial intelligence ; collective learning systems theory ; machine learning ; massively parallel architectures ; parallel distributed processing ; data flow architectures
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract The classical approach to the acquisition of knowledge in artificial intelligence has been to program the intelligence into the machine in the form of specific rules for the application of the knowledge: expert systems. Unfortunately, the amount of time and resources required to program an expert system with sufficient knowledge for non-trivial problem-solving is prohibitively large. An alternative approach is to allow the machine tolearn the rules based upon trial-and-error interaction with the environment, much as humans do. This will require endowing the machine with a sophisticated set of sensors for the perception of the external world, the ability to generate trial actions based upon this perceived information, and a dynamic evaluation policy to allow it to measure the effectiveness of its trial actions and modify its repertoire accordingly. The principles underlying this paradigm, known ascollective learning systems theory, have already been applied to sophisticated gaming problems, demonstrating robust learning and dynamic adaptivity. The fundamental building block of a collective learning system is thelearning cell, which may be embedded in a massively parallel, hierarchical data communications network. Such a network comprising 100 million learning cells will approach the intelligence capacity of the human cortex. In the not-too-distant future, it may be possible to build a race of robotic slaves to perform a wide variety of tasks in our culture. This goal, while irresistibly attractive, is most certainly fraught with severe social, political, moral, and economic difficulties.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02283734
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 61
    Electronic Resource
    Electronic Resource
    Decision-theoretic analysis of envisaged income tax reforms for FRG and USA (1988)
    Springer
    Annals of operations research 16 (1988), S. 105-116 
    Details
    ISSN: 1572-9338
    Keywords: Tax reforms ; progressive taxation ; risk-taking ; certainty equivalent approach
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract There are essentially two alternatives to analyse the impacts of tax reform proposals on risk-taking: the two-asset model and the certainty equivalent approach. Here risk-taking is defined in terms of the certainty equivalent approach. The paper discusses the effects of current tax reform proposals in the Federal Republic of Germany and in the United States with respect to risk-taking. Among others it is shown that there are unambiguous effects of the reform proposals as far as the upper income class is considered. Furthermore, the paper studies some impacts of the transition from the FRG-scheduleT 88 (coming into force at the beginning of 1988) to an intended schedule characterized by a linearly increasing marginal tax rate.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02283739
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 62
    Electronic Resource
    Electronic Resource
    Utility function assessment on a micro-computer: An interactive procedure (1988)
    Springer
    Annals of operations research 16 (1988), S. 149-160 
    Details
    ISSN: 1572-9338
    Keywords: Utility theory ; utility function assessment ; bias ; incomplete information
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract The procedure UFAP is presented which allows a decision maker to interactively assess his von Neumann/Morgenstern single attribute utility function. UFAP puts special emphasis on potential biases in the assessment process. In the first part of the procedure three different assessment methods are used to derive ranges for the utility function. Using different methods enables us to point out a possible bias in the elicitation process. In the second part a consistent class of utility functions is derived based on the ranges assessed in the first part. In case inconsistencies between methods arise the decision maker has to reconsider selected preference statements previously given.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02283742
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 63
    Electronic Resource
    Electronic Resource
    List of participants (1988)
    Springer
    Annals of operations research 16 (1988), S. 465-468 
    Details
    ISSN: 1572-9338
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02283760
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 64
    Electronic Resource
    Electronic Resource
    A knowledge-based approach to scheduling in an F.M.S. (1988)
    Springer
    Annals of operations research 12 (1988), S. 109-134 
    Details
    ISSN: 1572-9338
    Keywords: Flexible manufacturing system ; production scheduling ; artificial intelligence ; predicate calculus ; state-operator framework ; knowledge-based system
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract This paper reports the development of a computer-based system for production scheduling in a dedicated FMS. The system is based on the state-operator framework commonly used in artificial intelligence. Such a system consists of three components: (i) a knowledge base of states, which describes both the current task domain situation and the goal to be achieved; (ii) a set of operators that are used to manipulate the knowledge base; and (iii) a control strategy to decide which operators to apply next and to resolve conflicts. Some of the interesting features of the scheduling system include: (i) the ability to detect resource conflicts; (ii) the ability to determine alternate routes for a given part in the event of a resource conflict; and (iii) the ability to amend plans if an alternate route is found. These features allow the system to take advantage of the flexible routing for parts that an FMS allows. The system has been implemented using the XLISP programming language. Implementation considerations are discussed. A small but comprehensive example is presented. Further research directions are suggested.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02186363
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 65
    Electronic Resource
    Electronic Resource
    A least commitment approach to avoiding protection violations in nonlinear planning (1988)
    Springer
    Annals of operations research 12 (1988), S. 135-145 
    Details
    ISSN: 1572-9338
    Keywords: Automated reasoning ; planning ; plan rationale ; protection intervals
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract We suggest one alternative approach to creating a valid plan in which all temporal constraints are mutually satisfiable and all preconditions for actions hold where required. While simultaneously maintaining information on the status of protection intervals for all required preconditions in the plan, our approach avoids premature imposition of temporal constraints to correct for protection violations. At the expense of additional bookkeeping, we adopt the least commitment strategy of attempting to correct those protection violations which can be corrected in only one way. By postponing choice as much as possible, we attempt to generate a search tree with fewer nodes. Since scheduling problems which arise in our planning context are inherently intractable, our approach does not rule out the possibility of extensive search. However, it might well be a preferable mechanism for a planner which adopts a general least commitment strategy.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02186364
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 66
    Electronic Resource
    Electronic Resource
    Intelligent decision support systems: A unique application in the petroleum industry (1988)
    Springer
    Annals of operations research 12 (1988), S. 277-283 
    Details
    ISSN: 1572-9338
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02186370
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 67
    Electronic Resource
    Electronic Resource
    Generalized resolution and cutting planes (1988)
    Springer
    Annals of operations research 12 (1988), S. 217-239 
    Details
    ISSN: 1572-9338
    Keywords: Propositional logic ; resolution ; integer programming ; theorem proving ; artificial intelligence
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract This paper illustrates how the application of integer programming to logic can reveal parallels between logic and mathematics and lead to new algorithms for inference in knowledge-based systems. If logical clauses (stating that at least one of a set of literals is true) are written as inequalities, then the resolvent of two clauses corresponds to a certain cutting plane in integer programming. By properly enlarging the class of cutting planes to cover clauses that state that at least a specified number of literals are true, we obtain a generalization of resolution that involves both cancellation-type and circulant-type sums. We show its completeness by proving that it generates all prime implications, generalizing an early result by Quine. This leads to a cutting-plane algorithm as well as a generalized resolution algorithm for checking whether a set of propositions, perhaps representing a knowledge base, logically implies a given proposition. The paper is intended to be readable by persons with either an operations research or an artificial intelligence background.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02186368
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 68
    Electronic Resource
    Electronic Resource
    A knowledge-based system for tactical situation assessment (1988)
    Springer
    Annals of operations research 12 (1988), S. 285-296 
    Details
    ISSN: 1572-9338
    Keywords: Situation assessment ; human-machine interface ; intelligent assistant ; intelligent interface ; human-machine system ; artificial intelligence ; operations research ; knowledge-based systems
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract To perform tactical situation assessment effectively, a system must be capable of performing tactical information integration, interpretation, and threat evaluation. This paper describes a prototype system for naval surface warfare which incorporates a human operator for integration, an artificial intelligence-based subsystem for interpretation, and an operations research-based system for evaluation. The system provides the operator with an interactive environment for displaying and managing tactical information and tools for interpreting and evaluating it.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02186371
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 69
    Electronic Resource
    Electronic Resource
    Shortest path algorithms (1988)
    Springer
    Annals of operations research 13 (1988), S. 1-79 
    Details
    ISSN: 1572-9338
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract Theshortest path problem is considered from a computational point of view. Eight algorithms which solve theshortest path tree problem on directed graphs are presented, together with the results of wide-ranging experimentation designed to compare their relative performances on different graph topologies. The focus of this paper is on the implementation of the different data structures used in the algorithms. A "Pidgin Pascal" description of the algorithms is given, containing enough details to allow for almost direct implementation in any programming language. In addition, Fortran codes of the algorithms and of the graph generators used in the experimentation are provided on the diskette.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02288320
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 70
    Electronic Resource
    Electronic Resource
    Algorithms and codes for the assignment problem (1988)
    Springer
    Annals of operations research 13 (1988), S. 191-223 
    Details
    ISSN: 1572-9338
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract This paper analyzes the most efficient algorithms for the Linear Min-Sum Assignment Problem and shows that they derive from a common basic procedure. For each algorithm, we evaluate the computational complexity and the average performance on randomly-generated test problems. Efficient FORTRAN implementations for the case of complete and sparse matrices are given.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02288323
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 71
    Electronic Resource
    Electronic Resource
    Planning under uncertainty using parallel computing (1988)
    Springer
    Annals of operations research 14 (1988), S. 1-16 
    Details
    ISSN: 1572-9338
    Keywords: Linear programming ; planning under uncertainty ; large-scale systems ; parallel processors ; stochastic programming ; decomposition principle
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract Industry and government routinely solve deterministic mathematical programs for planning and schelduling purposes, some involving thousands of variables with a linear or non-linear objective and inequality constraints. The solutions obtained are often ignored because they do not properly hedge against future contingencies. It is relatively easy to reformulate models to include uncertainty. The bottleneck has been (and is) our capability to solve them. The time is now ripe for finding a way to do so. To this end, we describe in this paper how large-scale system methods for solving multi-staged systems, such as Bender's Decomposition, high-speed sampling or Monte Carlo simulation, and parallel processors can be combined to solve some important planning problems involving uncertainty. For example, parallel processors may make it possible to come to better grips with the fundamental problems of planning, scheduling, design, and control of complex systems such as the economy, an industrial enterprise, an energy system, a water-resource system, military models for planning-and-control, decisions about investment, innovation, employment, and health-delivery systems.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02186471
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 72
    Electronic Resource
    Electronic Resource
    A parallel algorithm for solving the linear complementarity problem (1988)
    Springer
    Annals of operations research 14 (1988), S. 77-104 
    Details
    ISSN: 1572-9338
    Keywords: Combinatorial Optimization ; Linear Complementarity Problem ; Mathematical Programming ; Multitasking ; Parallel Processing
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract The concept of multitasking mathematical programs is discussed, and an application of multitasking to the multiple-cost-row linear programming problem is considered. Based on this, an algorithm for solving the Linear Complementarity Problem (LCP) in parallel is presented. A variety of computational results are presented using this multitasking approach on the CRAY X-MP/48. These results were obtained for randomly generated LCP's where thenxn dense matrixM has no special properties (hence, the problem is NP-hard). based on these results, an average time performance ofO(n 4) is observed.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02186475
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 73
    Electronic Resource
    Electronic Resource
    A computational comparison of the dinic and network simplex methods for maximum flow (1988)
    Springer
    Annals of operations research 13 (1988), S. 81-123 
    Details
    ISSN: 1572-9338
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract We study the implementation of two fundamentally different algorithms for solving the maximum flow problem: Dinic's method and the network simplex method. For the former, we present the design of a storage-efficient implementation. For the latter, we develop a "steepest-edge" pivot selection criterion that is easy to include in an existing network simplex implementation. We compare the computational efficiency of these two methods on a personal computer with a set of generated problems of up to 4 600 nodes and 27 000 arcs.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02288321
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 74
    Electronic Resource
    Electronic Resource
    Algorithms for finding optimum trees: Description, use and evaluation (1988)
    Springer
    Annals of operations research 13 (1988), S. 263-397 
    Details
    ISSN: 1572-9338
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract This work is devoted to the problem of finding an optimum spanning tree in an undirected graph. Both min-sum and min-max trees are sought. The five algorithms considered are among the most well-known proposed in the literature. They are described in sect. 1 as thoroughly as possible, using a simplified Pascal language; all min-sum algorithms are derived from a unique prototype formulation. In sect. 2, the algorithms are implemented in PFORT to enhance their portability and ad hoc data structures are utilized in order to obtain subroutines as efficient as possible. Finally, in sect. 3, the programs are evaluated, comparing their performances in handling several classes of randomly generated graphs. Various observations are reported, and some indications for choosing the most suitable algorithm in each case are provided.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02288325
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 75
    Electronic Resource
    Electronic Resource
    Parallel gradient projection successive overrelaxation for symmetric linear complementarity problems and linear programs (1988)
    Springer
    Annals of operations research 14 (1988), S. 41-59 
    Details
    ISSN: 1572-9338
    Keywords: Parallel algorithms ; SOR ; gradient projection ; linear programming ; linear complementarity problem
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract A gradient projection successive overrelaxation (GP-SOR) algorithm is proposed for the solution of symmetric linear complementary problems and linear programs. A key distinguishing feature of this algorithm is that when appropriately parallelized, the relaxation factor interval (0, 2) isnot reduced. In a previously proposed parallel SOR scheme, the substantially reduced relaxation interval mandated by the coupling terms of the problem often led to slow convergence. The proposed parallel algorithm solves a general linear program by finding its least 2-norm solution. Efficiency of the algorithm is in the 50 to 100 percent range as demonstrated by computational results on the CRYSTAL token-ring multicomputer and the Sequent Balance 21000 multiprocessor.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02186473
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 76
    Electronic Resource
    Electronic Resource
    Measurement of loading and operations flexibility in flexible manufacturing systems: An information-theoretic approach (1988)
    Springer
    Annals of operations research 15 (1988), S. 65-80 
    Details
    ISSN: 1572-9338
    Keywords: Manufacturing flexibility ; flexibility measurement ; flexible manufacturing systems (FMSs) ; information theory application ; entropy
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract An information-theoretic approach is applied for measuring the flexibility in flexible manufacturing systems (FMSs). The general relation between flexibility and entropy is discussed. The entropy for a Markovian process is obtained and then applied to closed queueing network models of FMSs to discuss loading flexibility which arises from the power to regulate the frequency of the visit of a part to different work stations. The concept of operations entropy as a measure of operations flexibility, which arises from the power to choose the work station and the corresponding operations, is introduced. The operations entropy has been decomposed into entropies within and between operations and entropies within and between groups of operations. This measure has been used to determine the next operation to be performed on a part by using the principle of least reduction of flexibility.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02186791
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 77
    Electronic Resource
    Electronic Resource
    Manufacturing technology policy and deployment of processing innovations (1988)
    Springer
    Annals of operations research 15 (1988), S. 1-20 
    Details
    ISSN: 1572-9338
    Keywords: Technology management ; modernization ; manufacturing ; technology policy ; computer-integrated manufacturing ; organizational change
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract This is a report of a study on the evolution of manufacturing technology policy during the deployment of domestic advanced manufacturing systems in thirty-four plants and two panels of data collection separated by one year. Changing firm environment was significantly correlated with pioneering product introduction business strategy (p〈0.05). More importantly, it was found that manufacturing technology policy is significantly (p〈0.05) associated with pioneering business strategy. Further, findings indicate that fine-tuning or modest adjustment in this policy (versus doing nothing or drastic change) was significantly (p〈0.05) associated with the maximum levels of reported utilization of these new systems in a subsample of second panel, complete data cases (n=21). This curvilinear relationship between the absolute value of changes in technology policy and performance measure did not hold for the percentage of target cycle time achieved nor uptime, although results concerning performance are considered preliminary at the time of this writing. Advertising this processing technology tends to be inversely related to the radicalness of the technology incorporated into the system (p=0.076) during the deployment period tracked thus far. That is, firms installing more radical systems tend to become very cautious about sharing information about the project once installation begins.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02186788
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 78
    Electronic Resource
    Electronic Resource
    An efficient method to determine the optimal configuration of a flexible manufacturing system (1988)
    Springer
    Annals of operations research 15 (1988), S. 207-225 
    Details
    ISSN: 1572-9338
    Keywords: Flexible manufacturing systems ; optimal configuration ; queueing network models ; product-form queueing networks ; lower configuration ; heuristic solution ; optimal solution
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract A frequently encountered design issue for a flexible manufacturing system (FMS) is to find the lowest cost configuration, i.e. the number of resources of each type (machines, pallets, ...), which achieves a given production rate. In this paper, an efficient method to determine this optimal configuration is presented. The FMS is modelled as a closed queueing network. The proposed procedure first derives a heuristic solution and then the optimal solution. The computational complexity for finding the optimal solution is very reasonable even for large systems, except in some extreme cases. Moreover, the heuristic solution can always be determined and is very close (and often equal) to the optimal solution. A comparison with the previous method of Vinod and Solberg shows that our method performs very well.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02186797
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 79
    Electronic Resource
    Electronic Resource
    A view of automated proof checking and proving (1988)
    Springer
    Annals of operations research 16 (1988), S. 61-79 
    Details
    ISSN: 1572-9338
    Keywords: Automated theorem proving ; proof checking
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract Different techniques of automated formal reasoning are described and their performance and requirements on the human user are evaluated. The main trade-off is between autonomy and flexibility in conducting proofs. Examples of the use of techniques and existing systems are given, but not attempt of an exhaustive overview is made. The goal is to provide the reader with an idea of what to look for when selecting an approach for his/her application.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02283736
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 80
    Electronic Resource
    Electronic Resource
    Planning systems and artificial intelligence (1988)
    Springer
    Annals of operations research 16 (1988), S. 1-12 
    Details
    ISSN: 1572-9338
    Keywords: Planning systems ; expert systems ; knowledge representation ; inspection plans ; construction plans
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract Traditional O.R. systems are compared with problem solving in Artificial Intelligence via Expert Systems. The discussion centers on explicit knowledge representation. The general aspects are illustrated by two planning systems: · LESP 2: A learning system for inspection plan generation · IDA: A system for finding functions and solutions in construction
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02283732
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 81
    Electronic Resource
    Electronic Resource
    Are intelligent systems old or new — an overview (1988)
    Springer
    Annals of operations research 16 (1988), S. 81-91 
    Details
    ISSN: 1572-9338
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract This overview is organized around three points: (a) Criteria for evaluating intelligence content: Reasoning spiral and Balance matrix; (b) Analysis of the known IS in the fields of Control, OR, Management Production Control, AIS& ES; and (c) Suggestions for improving IS are deduced from the results of the analysis. This is to obtaining static balance and dynamical preparation by using the concepts of situational reasoning.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02283737
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 82
    Electronic Resource
    Electronic Resource
    Theory of convex cones in multicriteria decision making (1988)
    Springer
    Annals of operations research 16 (1988), S. 131-147 
    Details
    ISSN: 1572-9338
    Keywords: Multicriteria decision making ; convex cones ; preference structure ; interactive methods
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract We develop the theory of convex polyhedral cones in the objective-function space of a multicriteria decision problem. The convex cones are obtained from the decision-maker's pairwise judgments of decision alternatives and are applicable to any quasiconcave utility function. Therefore, the cones can be used in any progressively articulated solution procedure that employs pairwise comparisons. The cones represent convex sets of solutions that are inferior to known solutions to a multicriteria problem. Therefore, these convex sets can be eliminated from consideration while solving the problem. We develop the underlying theory and a framework for representing knowledge about the decision-maker's preference structure using convex cones. This framework can be adopted in the interactive solution of any multicriteria problem after taking into account the characteristics of the problem and the solution procedure. Our computational experience with different multicriteria problems shows that this approach is both viable and efficient in solving practical problems of moderate size.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02283741
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 83
    Electronic Resource
    Electronic Resource
    Scheduling project networks with resource constraints and time windows (1988)
    Springer
    Annals of operations research 16 (1988), S. 199-240 
    Details
    ISSN: 1572-9338
    Keywords: Scheduling ; project networks ; MPM-networks ; time-windows ; order theoretic approach to scheduling ; disjunctive graph method
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract Project networks with time windows are generalizations of the well-known CPM and MPM networks that allow for the introduction of arbitrary minimal and maximal time lags between the starting and completion times of any pair of activities. We consider the problem to schedule such networks subject to arbitrary (even time dependent) resource constraints in order to minimize an arbitrary regular performance measure (i.e. a non-decreasing function of the vector of completion times). This problem arises in many standard industrial construction or production processes and is therefore particularly suited as a background model in general purpose decision support systems. The treatment is done by a structural approach that involves a generalization of both the disjunctive graph method in job shop scheduling [1] and the order theoretic methods for precedence constrained scheduling [18,23,24]. Besides theoretical insights into the problem structure, this approach also leads to rather powerful branch-and-bound algorithms. Computational experience with this algorithm is reported.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02283745
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 84
    Electronic Resource
    Electronic Resource
    Cause-effect relationships and partially defined Boolean functions (1988)
    Springer
    Annals of operations research 16 (1988), S. 299-325 
    Details
    ISSN: 1572-9338
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract This paper investigates the use of Boolean techniques in a systematic study of cause-effect relationships. The model uses partially defined Boolean functions. Procedures are provided to extrapolate from limited observations, concise and meaningful theories to explain the effect under study, and to prevent (or provoke) its occurrence.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02283750
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 85
    Electronic Resource
    Electronic Resource
    Knowledge-based manpower planning (1988)
    Springer
    Annals of operations research 16 (1988), S. 347-374 
    Details
    ISSN: 1572-9338
    Keywords: Knowledge-based systems ; manpower planning ; logic programming ; deductive databases ; PROLOG
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract The capacity performance of knowledge-based systems differs essentially from the one of traditional systems. The result is that already today these systems are employed in a number of application areas, and that the intensity of research and development in this field is very high. In this paper the development of a knowledge-based manpower planning system (KBMS) is described. The two main components of this system are a knowledge-based system developed for management planning and a model designed for manpower planning in personnel leasing companies. This model was realized as a KBMPS by applying the knowledge-based system, which was developed for management planning.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02283753
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 86
    Electronic Resource
    Electronic Resource
    Schedule-an expert-like system for machine scheduling (1988)
    Springer
    Annals of operations research 16 (1988), S. 425-438 
    Details
    ISSN: 1572-9338
    Keywords: Expert system ; learning system ; machine scheduling ; reduction digraph
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract The construction of an expert-like system for machine scheduling called SCHEDULE is presented. Essential parts of SCHEDULE were developed by students in a laboratory course “Operations Research on Microcomputers” at the University of Karlsruhe, Germany. SCHEDULE consists of the components data base, knowledge base, inference engine, explanation facility, dialog component, and knowledge acquisition component. The knowledge base contains an algorithm base for solving different types of scheduling problems. To establish the rules of the knowledge base the well-known three-field classification of deterministic machine scheduling problems and the concept of the reduction digraph are exploited. Experiences gained during building and demonstrating SCHEDULE are reported.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02283757
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 87
    Electronic Resource
    Electronic Resource
    A note on the representation of quantified statements in terms of the implication operation (1988)
    Springer
    Annals of operations research 12 (1988), S. 297-314 
    Details
    ISSN: 1572-9338
    Keywords: Fuzzy sets ; certainty factors ; expert systems ; linguistic values ; approximate reasoning ; imprecise probabilities
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract We first review Zadeh's theory for representing and reasoning with quantified statements of the formQ A's are B. We then suggest an equivalent representation in terms ofQ X's are (A → B). We briefly look at some implications of this new representation.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02186372
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 88
    Electronic Resource
    Electronic Resource
    The relax codes for linear minimum cost network flow problems (1988)
    Springer
    Annals of operations research 13 (1988), S. 125-190 
    Details
    ISSN: 1572-9338
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract We describe a relaxation algorithm [1,2] for solving the classical minimum cost network flow problem. Our implementation is compared with mature state-of-the-art primal simplex and primal-dual codes and is found to be several times faster on all types of randomly generated network flow problems. Furthermore, the speed-up factor increases with problem dimension. The codes, called RELAX-II and RELAXT-II, have a facility for efficient reoptimization and sensitivity analysis, and are in the public domain.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02288322
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 89
    Electronic Resource
    Electronic Resource
    Preface (1988)
    Springer
    Annals of operations research 14 (1988), S. IX 
    Details
    ISSN: 1572-9338
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02186470
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 90
    Electronic Resource
    Electronic Resource
    A parallelization of the simplex method (1988)
    Springer
    Annals of operations research 14 (1988), S. 17-40 
    Details
    ISSN: 1572-9338
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract This paper presents a parallelization of the simplex method for linear programming. Current implementations of the simplex method on sequential computers are based on a triangular factorization of the inverse of the current basis. An alternative decomposition designed for parallel computation, called the quadrant interlocking factorization, has previously been proposed for solving linear systems of equations. This research presents the theoretical justification and algorithms required to implement this new factorization in a simplex-based linear programming system.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02186472
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 91
    Electronic Resource
    Electronic Resource
    The auction algorithm: A distributed relaxation method for the assignment problem (1988)
    Springer
    Annals of operations research 14 (1988), S. 105-123 
    Details
    ISSN: 1572-9338
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract We propose a massively parallelizable algorithm for the classical assignment problem. The algorithm operates like an auction whereby unassigned persons bid simultaneously for objects thereby raising their prices. Once all bids are in, objects are awarded to the highest bidder. The algorithm can also be interpreted as a Jacobi — like relaxation method for solving a dual problem. Its (sequential) worst — case complexity, for a particular implementation that uses scaling, is O(NAlog(NC)), where N is the number of persons, A is the number of pairs of persons and objects that can be assigned to each other, and C is the maximum absolute object value. Computational results show that, for large problems, the algorithm is competitive with existing methods even without the benefit of parallelism. When executed on a parallel machine, the algorithm exhibits substantial speedup.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02186476
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 92
    Electronic Resource
    Electronic Resource
    A parallel quasi-Newton method for partially separable large scale minimization (1988)
    Springer
    Annals of operations research 14 (1988), S. 195-211 
    Details
    ISSN: 1572-9338
    Keywords: Quasi-Newton method ; updated conjugate subspaces method ; parallel computation ; partially separable minimization ; large scale minimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract The parallel quasi-Newton method based on updating conjugate subspaces proposed in [4] can be very effective for large-scale sparse minimization because conjugate subspaces with respect to sparse Hessians are usually easy to obtain. We demonstrate this point in this paper for the partially separable case with matrices updated by a quasi-Newton scheme ofGriewank andToint [2,3]. The algorithm presented is suitable for parallel computation and economical in computer storage. Some testing results of the algorithm on an Alliant FX/8 minisupercomputer are reported.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02186480
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 93
    Electronic Resource
    Electronic Resource
    Acknowledgements (1988)
    Springer
    Annals of operations research 15 (1988), S. IX 
    Details
    ISSN: 1572-9338
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02186787
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 94
    Electronic Resource
    Electronic Resource
    User-model interaction in decision support systems for risk management (1988)
    Springer
    Annals of operations research 16 (1988), S. 185-197 
    Details
    ISSN: 1572-9338
    Keywords: risk management ; decision analysis ; expert systems ; artificial intelligence ; operations research
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract This paper describes and evaluates three different approaches to building decision support systems: the Operations Research/Management Science approach, the Decision Analysis/Multiattribute Utility approach, and the Artificial Intelligence/Expert Systems approach. It evaluates the usefulness of the three approaches for risk management. In particular, it defines evaluation objectives of risk analysts, risk managers, and laypeople and provides a subjective assessment how the three approaches stack up against their objectives. The paper concludes that for most risk management applications a combination of the three approaches would be most desirable.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02283744
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 95
    Electronic Resource
    Electronic Resource
    Scheduling unit — time tasks on flow — shops under resource constraints (1988)
    Springer
    Annals of operations research 16 (1988), S. 255-266 
    Details
    ISSN: 1572-9338
    Keywords: Scheduling ; flow shops ; resource constraints ; message transmission
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract We consider the problem of scheduling tasks on flow shops when each task may also require the use of additional resources. It is assumed that all operations have unit lengths, the resource requirements are of 0–1 type and there is one type of the additional resource in the system. It is proved that when the number of machines is arbitrary, the problem of minimizing schedule length is NP-hard, even when only one unit of the additional resource is available in the system. On the other hand, when the number of machines is fixed, then the problem is solvable in polynomial time, even for an arbitrary number of resource units available. For the two machine case anO(n log 2 2 n) algorithm minimizing maximum lateness is also given. The presented results are also of importance in some message transmission systems.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02283747
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 96
    Electronic Resource
    Electronic Resource
    Simulated annealing: Use of a new tool in bin packing (1988)
    Springer
    Annals of operations research 16 (1988), S. 327-332 
    Details
    ISSN: 1572-9338
    Keywords: Monte Carlo technique ; cooling strategies ; scheduling
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract Simulated annealing (statistical cooling) is applied to bin packing problems. Different cooling strategies are compared empirically and for a particular 100 item problem a solution is given which is most likely the best known so far.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02283751
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 97
    Electronic Resource
    Electronic Resource
    The design of a database for multiperson decision support (1988)
    Springer
    Annals of operations research 16 (1988), S. 393-411 
    Details
    ISSN: 1572-9338
    Keywords: MEDIATOR ; conceptual modelling ; (group) decision support systems ; collaborative work ; database management ; multicriteria decision support ; negotiating support systems
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract The MEDIATOR approach to implementing negotiation support systems views collaborative decisions as complex, evolving data objects to be managed by an extended database management system. The paper outlines the requirements and a rough design for such a DBMS. Specifically, our approach represents decision problems as multispatial mappings that eventually lead from real-world observations to group utilities. Group decision processes are represented as nested transactions which collaboratively design this mapping data structure, controlled by group communication norms represented as integrity constraints. The paper concludes with some implementation considerations, using a conceptual model base management approach.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02283755
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 98
    Electronic Resource
    Electronic Resource
    Analysis and evolution of basic strategies in investment planning for modern flexible technologies (1988)
    Springer
    Annals of operations research 16 (1988), S. 447-464 
    Details
    ISSN: 1572-9338
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract Investment decisions for new technologies still contain a comparatively high degree of uncertainty. For reducing this uncertainty, the author proposes a process of “strategic-investment-planning” that is divided into four steps. First, the technologies under consideration are classified according to their degree of novelty, their position in the life cycle und their technological characteristics. Secondly, the impact of the new technologies on the enterprise's competitive position is determined. From the technology-portfolio, introduction strategies can be derived. Finally, the calendar of technologies demonstrates how to plan for future structural changes in manufacturing technology. The presented instruments are based on empirical research conducted by the author.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02283759
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 99
    Electronic Resource
    Electronic Resource
    A hybrid algorithm for finding thekth smallest ofn elements in O(n) time (1988)
    Springer
    Annals of operations research 13 (1988), S. 399-419 
    Details
    ISSN: 1572-9338
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract The problem of finding thekth smallest ofn elements can be solved either with O(n) algorithms or with O(n 2) algorithms. Although they require a higher number of operations in the worst case, O(n 2) algorithms are generally preferred to O(n) algorithms because of their better average performance. We present a hybrid algorithm which is O(n) in the worst case and efficient in the average case.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02288326
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 100
    Electronic Resource
    Electronic Resource
    Two-stage parallel iterative methods for the symmetric linear complementarity problem (1988)
    Springer
    Annals of operations research 14 (1988), S. 61-75 
    Details
    ISSN: 1572-9338
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract In this paper, we propose a two-stage parallel iterative method for solving the symmetric linear complementarity problem. When implemented in a parallel computing environment, the method decomposes the problem into subproblems which are solved by certain iterative procedures concurrently on separate processors. Convergence of the overall method is established under some mild assumptions on how the inner iterations are terminated. Applications of the proposed method to solve strictly convex quadratic programs are discused and numerical results on both a sequential computer (IBM 4381) and a super-computer (CRAYX-MP/24) are reported.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02186474
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...