Abstracts - faqs.org

Abstracts

Business, international

Search abstracts:
Abstracts » Business, international

Monte Carlo versus Numerical Convolutions: Some Critical Remarks

Article Abstract:

Computer methodology for assisting in actuarial problems is considered. In this research, the computer is regarded only as calculation equipment. Initially, a problem is developed in a logical sense for the computer, and calculations or approximations ensue. In this case Monte Carlo simulation was preferred, although it is not always exact. A hypothetical situation based on a life insurance firm's portfolio of policies is given to demonstrate the numerical processes involved in middle stages of the process. Algorithms and discrete density considerations are delineated. Tables of numerical convolution data are included, as is an algorithm for general convolution calculations.

Author: Alting von Geusau, B.J.
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1984
Computers, Laws, regulations and rules, Digital computers

User Contributions:

Comment about this article or add new information about this topic:

CAPTCHA


K-Tree/K-Subgraph: a program package for minimal weighted K-cardinality trees and subgraphs

Article Abstract:

The K-Tree/K-Subgraph package is an implementation of several algorithms and heuristics for solving the minimal weighted K-cardinality tree and subgraph problem. K-Tree contains two branch-and-bound schemes written in Turbo-Pascal 5.0. KTreecut, the second program, presents a branch-and-cut algorithm in C on an IBM-RS 6000 under operating system AIX 3.1. K-Sub contains heuristic algorithms while KSubcut is the exact algorithm for the K-cardinality subgraph problem.

Author: Ehrgott, M., Freitag, J.
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1996
Usage, Software, Branch and bound algorithms

User Contributions:

Comment about this article or add new information about this topic:

CAPTCHA


An axiomatic characterization of some locations in trees

Article Abstract:

Several axioms are proposed for characterizing the absolute median and squared median of a tree. The axioms are based on the Consistency axiom of the first type used in characterizing a voting procedure called Borda's rule. They focus on the objective function of the tree rather than the location obtained via an optimization scheme. The axioms can be used in diverse topics such as the aggregation of expert opinions and the measurement of inequality.

Author: Vohra, Rakesh
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1996
Analysis, Evaluation, Axioms

User Contributions:

Comment about this article or add new information about this topic:

CAPTCHA


Subjects list: Trees (Graph theory)
Similar abstracts:
  • Abstracts: Adapting to diverse customers: a training matrix for international marketers. Italian multinationals
  • Abstracts: The conduct of marketing audits: a critical review and commentary. Business marketing and the ethics of gift giving
  • Abstracts: Nature rarely repeats itself. America smiles at itself
  • Abstracts: Reforming Latin America. Tortologies: reforming everything. Reforming the firm
  • Abstracts: Retailer response to environmental and competitive changes in the United States. Breathing new life into an old name
This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.
Some parts © 2025 Advameg, Inc.