Abstracts - faqs.org

Abstracts

Business, international

Search abstracts:
Abstracts » Business, international

Two linear approximation algorithms for the subset-sum problem

Article Abstract:

Issues relating to the calculation of approximation algorithms are examined in detail in order to tackle the subset problem, including an assessment of worst case performance.

Author: Kellerer, Hans, Mansini, Renata, Speranza, Maria Grazia
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2000

User Contributions:

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

CAPTCHA


Mixed-integer generation algorithms and the probabilistic maximum satisfiability problem

Article Abstract:

The feasibility of using column generation algorithms, such as dual and primal algorithms, on probabilistic maximum satisfiability problem (PMAXSAT) remains high since the number of integer variables present in the problem is small. Also, the problem's variables corresponding to the implicit columns were found to be lacking in upper bounds. Another feature of the PMAXSAT which makes it easy to be resolved by column generation algorithms is its ability to be solved repeatedly whenever few new constraints are added.

Author: Hansen, Pierre, Jaumard, Brigitte, Aragao, Marcus Poggi de
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1998
Analysis, Linear programming

User Contributions:

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

CAPTCHA


Heuristic algorithms for the portfolio selection problem with minimum transaction lots

Article Abstract:

The problem of portfolio selection with minimum transaction lots was solved using three different heuristic algorithms. Searching for the most viable solution, however, is NP-complete and is not dependent on risk function. Data used were derived from the Milan Stock Exchange in Italy in two unrelated time periods. Results show that the high degree of complexity of the problem makes it difficult to obtain the prime solution in a time period that is most acceptable. The model used could potentially be used in the management of derivatives-based selection portfolio problem.

Author: Mansini, Renata, Speranza, Maria Grazia
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1999
Portfolio Management, Financial Management, Methods, Models, Heuristic programming

User Contributions:

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

CAPTCHA


Subjects list: Research, Algorithms, Integer programming, Mathematics
Similar abstracts:
  • Abstracts: Combining path relinking and genetic algorithms for the multiple-level warehouse layout problem. Warehouse design and control: framework and literature review
  • Abstracts: Building agent-based corporate information systems: an application to telemedicine. Service network design in freight transportation
  • Abstracts: Modeling and analysis of decision making problems for mitigating natural disaster risks. A system approach to the management of catastrophic risks
  • Abstracts: Single machine batch scheduling with resource dependent setup and processing times. Scheduling with batching: a review
  • Abstracts: Scheduling the production of two-component jobs on a single machine. Complexity of mixed shop scheduling problems: a survey
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.