A heuristic algorithm for resource allocation/reallocation problem

DOI10.1155/2011/218078zbMath1236.90149WikidataQ58690291 ScholiaQ58690291MaRDI QIDQ410767

K. Kannan, S. Raja Balachandar

Publication date: 4 April 2012

Published in: Journal of Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2011/218078

zbMATH Keywords

computational complexity; multichoice multidimensional knapsack problem

Mathematics Subject Classification ID

90C59: Approximation methods and heuristics in mathematical programming

90C27: Combinatorial optimization

91B32: Resource and cost allocation (including fair division, apportionment, etc.)

Uses Software

• OR-Library

Cites Work

• Unnamed Item
• Redundancy in mathematical programming. A state-of-the-art survey
• Hybrid algorithms for the multiple-choice multi-dimensional knapsack problem
• A new polynomial time algorithm for 0-1 multiple knapsack problem based on dominant principles
• A column generation method for the multiple-choice multi-dimensional knapsack problem
• Finding duplicate rows in a linear programming model
• A simulated annealing approach to the multiconstraint zero-one knapsack problem
• Advanced preprocessing techniques for linear and quadratic programming
• A best first search exact algorithm for the multiple-choice multidimensional knapsack problem
• A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem
• Robust Reduction of a Class of Large-Scale Linear Programs
• Identifying Redundant Constraints and Implicit Equalities in Systems of Linear Constraints
• A heuristic approach for identification of redundant constraints in linear programming models
• A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems
• Analysis of mathematical programming problems prior to applying the simplex algorithm
• Presolve Analysis of Linear Programs Prior to Applying an Interior Point Method
• Heuristic algorithms for the multiple-choice multidimensional knapsack problem
• An Algorithm for Determining Irrelevant Constraints and all Vertices in Systems of Linear Inequalities
• Two direct methods in linear programming