Operations Research ’92
Latest Publications

TOTAL DOCUMENTS

160

(FIVE YEARS 0)

H-INDEX

2

(FIVE YEARS 0)

Published By Physica-Verlag HD

9783790806793, 9783662126295

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

On Integrity Constraints for a Waste Management Information System

Operations Research ’92 ◽

10.1007/978-3-662-12629-5_11 ◽

1993 ◽

pp. 39-41

Author(s):

Dirk Schreiber ◽

Manfred Grauer

Keyword(s):

Information System ◽

Waste Management ◽

Management Information System ◽

Integrity Constraints ◽

Management Information

Natural Growth Population Models

Operations Research ’92 ◽

10.1007/978-3-662-12629-5_98 ◽

1993 ◽

pp. 343-345

Author(s):

Drago Čepar ◽

Erika Uršič

Keyword(s):

Population Models ◽

Natural Growth

Development of an Energy—Emission Model Using Fuzzy Sets

Operations Research ’92 ◽

10.1007/978-3-662-12629-5_9 ◽

1993 ◽

pp. 32-35

Author(s):

Carsten Oder ◽

Otto Rentz

Keyword(s):

Fuzzy Sets ◽

Emission Model ◽

Energy Emission

The Selection of the Optimum Offers in Crude Oil Market by Linear Programming

Operations Research ’92 ◽

10.1007/978-3-662-12629-5_88 ◽

1993 ◽

pp. 306-309

Author(s):

Gheorghe Barbatu ◽

C. E. Marius ◽

V. Ionescu

Keyword(s):

Linear Programming ◽

Crude Oil ◽

Oil Market ◽

Selection Of

Load Sharing in a Heterogeneous Distributed Object-based System

Operations Research ’92 ◽

10.1007/978-3-662-12629-5_81 ◽

1993 ◽

pp. 278-280

Author(s):

Josef Matulka

Keyword(s):

Load Sharing ◽

Distributed Object ◽

Object Based

Some Adaptive Clustering Algorithms

Operations Research ’92 ◽

10.1007/978-3-662-12629-5_8 ◽

1993 ◽

pp. 27-31

Author(s):

Hans-Joachim Mucha

Keyword(s):

Clustering Algorithms ◽

Adaptive Clustering

Analysis of the Degree of Parallelism for Non-Polynomial, Polynomial, Strongly Polynomial Algorithms for Solving the Minimum Cost Flow Problem

Operations Research ’92 ◽

10.1007/978-3-662-12629-5_41 ◽

1993 ◽

pp. 142-144

Author(s):

Cosimo Spera ◽

Massimiliano Ugolini

Keyword(s):

Flow Problem ◽

Minimum Cost ◽

Polynomial Algorithms ◽

Minimum Cost Flow ◽

Strongly Polynomial Algorithms ◽

Minimum Cost Flow Problem ◽

Cost Flow ◽

Strongly Polynomial

Boltzmann Machine Solution N-Person Games

Operations Research ’92 ◽

10.1007/978-3-662-12629-5_40 ◽

1993 ◽

pp. 139-141

Author(s):

Franciszek Seredynski

Keyword(s):

Boltzmann Machine

Bicriteria Transportation Problem

Operations Research ’92 ◽

10.1007/978-3-662-12629-5_38 ◽

1993 ◽

pp. 135-137

Author(s):

Peter Neumayer

Keyword(s):

Transportation Problem

Traveling Salesman Problem with Path Dependent Costs —Generalization of One-Dimensional Search with Traveling Costs

Operations Research ’92 ◽

10.1007/978-3-662-12629-5_32 ◽

1993 ◽

pp. 118-120

Author(s):

Buyang Cao ◽

Klaus Rinderle

Keyword(s):

Traveling Salesman Problem ◽

Traveling Salesman ◽

One Dimensional ◽

Path Dependent