Found 97029 papers in total
An examination of the effectiveness of multi-dimensional decision-making methods: A decision-making paradox
1989,
This paper presents the results of a study that compared four decision-making methods. The methods...
Generalization of the expected utility criterion to choices under regular uncertainty
1989,
Regular uncertainty denotes any situation where data concerning the events are consistent with a set of...
The evaluation of decision-aiding systems: Guidelines and methods
1989,
Few decision-aiding systems, such as Expert or Decision Support Systems, are formally evaluated. Yet when...
A streamlined approach for calculating expected utility and expected value of perfect information
1990,
An approach based on the criteria of maximizing expected utility was developed for comparing alternatives,...
Simulation computerbased decision-support-systems on an oligopolistic market with EUSTOPIC
1990,
The contribution describes a complex man-machine-simulation-model. It simulates what happens, if on an...
Fuzzy mathematical programming with compensation for non equivalent objectives
1988,
In many realistic decision situations the aspiration levels for criteria and various other parameters used...
A method to control Flexible Manufacturing Systems
1989,
During the last decade manufacturing has again become a prime area of interest. New concepts have emerged,...
Conflict models in graph form: Solution concepts and their interrelationships
1989,
A comprehensive approach for modeling conflicts is the recently developed graph form of conflict models....
Utilization of the preceding evaluation based on KPV Method
1989,
The KPV Method is an evaluation method of candidate moves. The method was developed for a knowledge based...
Silent mixed duels
1989,
The paper considers a class of a zero-sum two-person games of timing on [0,1], in which Player 1 possesses...
Cores of games with restricted cooperation
1989,
Games with restricted cooperation are cooperative N- person games with sidepayments, where the collection...
A modification of Lipski-Preparata’s algorithm for the maximum matching problem on bipartite convex graphs
1988,
The fastest algorithms appeared in the literature to solve the maximum matching problem on bipartite...
Experiment and matching of algorithms for absolute centre of a network
1988,
Authors explain this problem in all aspects and presents three algorithms (Kariv-Hakimi, Minieka e...
The upper and lower bounds on the area of a generalized graph embedding
1989,
The authors discuss the upper and lower bounds on an area to embed an n- vertex and d -degree graph (...
Facets of the balanced (acyclic) induced subgraph polytope
1989,
A signed graph is a graph whose edges are labelled positive or negative. A signed graph is said to be...
Forest covers and a polyhedral intersection theorem
1989,
A forest cover of a graph is a spanning forest for which each component has at least two nodes. The...
Properties of minimum Isolated Line Failure Immune graphs with Hamiltonian cycle
1989,
This paper presents properties of an ILFI graph with Hamiltonian cycle. A graph which is immune to...
On dual integrality in matching problems
1989,
Edmonds and Johnson proved an integrality property of optimal dual solutions of matching problems, under...
New lower bounds for the Symmetric Travelling Salesman Problem
1989,
In this paper new lower bounds for the Symmetric Travelling Salesman Problem are proposed and combined in...
Odd cycles and matrices with integrality properties
1989,
A cycle of a bipartite graph G(V’+,V’-;E) is odd if its length is 2 (mod 4), even...
Four problems on graphs with excluded minors
1989,
The four problems the authors consider are the Chinese postman, odd cut, co-postman, and odd circuit...
A necessary and sufficient condition for the total unimodularity of a matrix in terms of graph theory
1989,
The authors present a necessary and sufficient condition for an arbitrary matrix A to be totally...
Graphs-theoretical properties and chain code picture languages
1989,
The paper describes pictures by words over the alphabet {up, down, right, left} whose elements are...
Norms and perfect graphs
1990,
The weak Berge hypothesis states that a graph is perfect if and only if its complement is perfect....
Papers per page:

Paper Filter