A heuristic algorithm for resource allocation/reallocation problem

DOI10.1155/2011/218078MaRDI QIDQ410767zbMATH OpenOpenAlexWikidataFDO

Authors S. Raja Balachandar, K. Kannan

Publication date 4 April 2012

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

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

computational complexitymultichoice multidimensional knapsack problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Recommendations

• scientific article; zbMATH DE number 1728442
• Heuristic algorithms for the multiple-choice multidimensional knapsack problem
• Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem
• A new polynomial time algorithm for 0-1 multiple knapsack problem based on dominant principles
• Heuristics for the 0-1 multidimensional knapsack problem

Cites work

• scientific article; zbMATH DE number 1728442 (Why is no real title available?)
• A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems
• A best first search exact algorithm for the multiple-choice multidimensional knapsack problem
• A column generation method for the multiple-choice multi-dimensional knapsack problem
• A heuristic approach for identification of redundant constraints in linear programming models
• A new polynomial time algorithm for 0-1 multiple knapsack problem based on dominant principles
• A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem
• A simulated annealing approach to the multiconstraint zero-one knapsack problem
• Advanced preprocessing techniques for linear and quadratic programming
• An Algorithm for Determining Irrelevant Constraints and all Vertices in Systems of Linear Inequalities
• Analysis of mathematical programming problems prior to applying the simplex algorithm
• Finding duplicate rows in a linear programming model
• Heuristic algorithms for the multiple-choice multidimensional knapsack problem
• Hybrid algorithms for the multiple-choice multi-dimensional knapsack problem
• Identifying Redundant Constraints and Implicit Equalities in Systems of Linear Constraints
• Presolve Analysis of Linear Programs Prior to Applying an Interior Point Method
• Redundancy in mathematical programming. A state-of-the-art survey
• Robust reduction of a class of large-scale linear programs
• Two direct methods in linear programming

Cited in

(1)

• REFING: heuristic to solve bi-objective resource allocation problem with bound and varying capacity

Describes a project that uses

Uses Software

• OR-Library

This page was built for publication: A heuristic algorithm for resource allocation/reallocation problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q410767)