Abstracts - faqs.org

Abstracts

Business, international

Search abstracts:
Abstracts » Business, international

Testing integer knapsacks for feasibility

Article Abstract:

A new method for determining whether there are nonnegative integers x1, x2,....,xn, satisfying a1x1 + a2x2 + ... + anxn = b, where a1 < a2 < ... < an and b are nonnegative integers, is presented. Its worst case time complexity is O(a superscript 2; subscript 1) + n and its space complexity is O(a1). One important feature of the new algorithm is that its feasibility can be tested for an additional right hand side in O(1) time, i.e. the work requiring O(a superscript 2; subscript 1 + n) time is independent of b.

Author: Ryan, Jennifer, Hansen, Paul
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1996
Models, Integer programming, Dynamic programming

User Contributions:

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

CAPTCHA


New polynomial bounds for matroidal knapsacks

Article Abstract:

The matroidal knapsack problem with the objective function of maximizing the weight basis for a given matroid under a knapsack constraint is considered. Specifically, a relaxation procedure for deriving an upper bound on the optimal value of the matroidal knapsack problem in polynomial time is introduced. The procedure is applicable to both the multiple choice knapsack and the capacitated minimal spanning tree problems.

Author: Amado, Ligia, Barcia, Paulo
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1996
Operations research, Research, Management science, Case studies, Relaxation methods (Mathematics)

User Contributions:

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

CAPTCHA


Heuristic method for a mixed capacitated arc routing problem: Aa refucse collection application

Article Abstract:

A new heuristic method that provides viable solutions for a mixed arc routing problem for household refuce collection on mixed graphs is presented. The results of the method indicate us to fix the service direction.

Author: Mourao, Maria Candida, Amado, Ligia
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2005
Portugal, Refuse systems, Solid Waste Collection, Methods, Analysis, Reports, Graphic methods, Sanitation services, Heuristic programming, Refuse collection

User Contributions:

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

CAPTCHA

Similar abstracts:
  • Abstracts: Improvement heuristics for the vehicle routing problem based on simulated annealing. On solving complex multi-period location models using simulated annealing
  • Abstracts: First insights into export sales forecasting practice: a qualitative study. International strategic alliance relationships within the foreign investment decision process
  • Abstracts: Cracks in the ceiling. Comeback kids: China's prodigals come home to prosper in Shanghai. The radio radicals
  • Abstracts: All-units quantity-freight discounts with disposals. A note on the design of a two-sided, two-stage screening procedure with a prescribed outgoing quality
  • Abstracts: Approximate representation of probabilistic data in expert systems. AMOS - a probability-driven, customer-oriented decision support system for target marketing of solo mailings
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.