Abstracts - faqs.org

Abstracts

Business, international

Search abstracts:
Abstracts » Business, international

Maximizing a concave function over the efficient or weakly-efficient set

Article Abstract:

An algorithm of branch and bound type was proposed for the problem of maximizing a concave function over the efficient or weakly-efficient set. Analysis of the problem shows that it can be formulated as a special global optimization problem in the space of the extreme criteria of the underlying multiple criteria linear program. Global optimization techniques are utilized only in the space of extreme criteria to address efficiently problems with a small number of criteria.

Author: Thoai, Nguyen V., Horst, Reiner
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1999
Mathematical optimization, Optimization theory, Mathematical programming

User Contributions:

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

CAPTCHA


A polynomial-time algorithm for message routing in hierarchical communication networks

Article Abstract:

The application of an algorithm for message routing in a hierarchical communication network is analyzed. The network under study carries two levels where messages are communicated through network node pairs. The first level network features capacitated arcs, while the other level represents a spanning tree. It is shown that a time algorithm defined as O(n2 + nw) solves the network's decision problem involving communication breakdown.

Author: Polak, George G., Ahuja, Ravindra K.
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1995
Models, Decision support systems

User Contributions:

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

CAPTCHA


Computational investigations of maximum flow algorithms

Article Abstract:

Maximum flow problems are situations that are commonly encountered in network optimization. Analysis of the utility of maximum flow algorithms using representative operation counts indicated the efficiency of the pre-flow push algorithms compared to the augmenting path algorithm. Implementation of the Goldberg-Tarjan preflow-push algorithm also indicated the efficient empirical performance of the highest-label preflow-push algorithm.

Author: Mishra, Ajay K., Ahuja, Ravindra K., Kodialam, Murali, Orlin, James B.
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1997
Scheduling (Management), Mathematical analysis

User Contributions:

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

CAPTCHA


Subjects list: Research, Analysis, Algorithms
Similar abstracts:
  • Abstracts: The pros and cons of the new pensions act. Consider the pension scheme, or count the cost. Prospects for Italian acquisitions
  • Abstracts: Hong Kong: voters' motivation. Now, the focus is on Taiwan. Australians debate diversity
  • Abstracts: Innovative financing of Mauritian power project. National Power selected for Polish power plant. Beijing aims to test the Laibin B model
  • Abstracts: Taxing times. The shock of the new. A stranger in town
  • Abstracts: A shrunken cyclic inspection schedule for deteriorating production stages. A note on the rule for sequential selection
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.