Average performance of greedy heuristics for the integer knapsack problem
Article Abstract:
A lower bound on the average performance of a total-value greedy heuristic for the integer knapsack problem is derived. It is shown that the average performance bound for the total-value heuristic dominates the corresponding bound for the density-ordered greedy heuristic.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2004
User Contributions:
Comment about this article or add new information about this topic:
Solving fuzzy transportation problems based on extension principle
Article Abstract:
A procedure to derive the fuzzy objective value of the fuzzy transportation problem, based on the extension principle, is developed. Two types of fuzzy transportation problems, with inequality constraints and equality constraints, are discussed.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2004
User Contributions:
Comment about this article or add new information about this topic:
- Abstracts: Directional decomposition heuristic for a linear machine-cell location problem. An evolutionary heuristic for the index tracking problem
- Abstracts: Hierarchical coordination mechanisms within the supply chain
- Abstracts: Cooperative games with stochastic payoffs. An extension of the Tau-value to games with coalition structures. The structure of the set of equilibria for two person multicriteria games