Efficient algorithms for the capacitated concentrator location problem
Computers and Operations Research
Knapsack problems: algorithms and computer implementations
Knapsack problems: algorithms and computer implementations
Variable Neighborhood Decomposition Search
Journal of Heuristics
Quality adaptation in a multisession multimedia system: model, algorithms, and architecture
Quality adaptation in a multisession multimedia system: model, algorithms, and architecture
Exploring relaxation induced neighborhoods to improve MIP solutions
Mathematical Programming: Series A and B
A Reactive Local Search-Based Algorithm for the Multiple-Choice Multi-Dimensional Knapsack Problem
Computational Optimization and Applications
Parametric tabu-search for mixed integer programs
Computers and Operations Research - Anniversary focused issue of computers & operations research on tabu search
Computers and Operations Research
A grasp-knapsack hybrid for a nurse-scheduling problem
Journal of Heuristics
Hard multidimensional multiple choice knapsack problems, an empirical study
Computers and Operations Research
A hybrid approach for the 0-1 multidimensional knapsack problem
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Variable neighbourhood decomposition search for 0-1 mixed integer programs
Computers and Operations Research
A multi-level search strategy for the 0-1 Multidimensional Knapsack Problem
Discrete Applied Mathematics
A column generation method for the multiple-choice multi-dimensional knapsack problem
Computational Optimization and Applications
A New Heuristic for Solving the Multichoice Multidimensional Knapsack Problem
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
International Journal of Applied Metaheuristic Computing
A fast and scalable multidimensional multiple-choice knapsack heuristic
ACM Transactions on Design Automation of Electronic Systems (TODAES) - Special Section on Networks on Chip: Architecture, Tools, and Methodologies
| Hi-index | 0.01 |
Recently several hybrid methods combining exact algorithms and heuristics have been proposed for solving hard combinatorial optimization problems. In this paper, we propose new iterative relaxation-based heuristics for the 0-1 Mixed Integer Programming problem (0-1 MIP), which generate a sequence of lower and upper bounds. The upper bounds are obtained from relaxations of the problem and refined iteratively by including pseudo-cuts in the problem. Lower bounds are obtained from the solving of restricted problems generated by exploiting information from relaxation and memory of the search process. We propose a new semi-continuous relaxation (SCR) that relaxes partially the integrality constraints to force the variables values close to 0 or 1. Several variants of the new iterative semi-continuous relaxation based heuristic can be designed by a given update procedure of multiplier of SCR. These heuristics are enhanced by using local search procedure to improve the feasible solution found and rounding procedure to restore infeasibility if possible. Finally we present computational results of the new methods to solve the multiple-choice multidimensional knapsack problem which is an NP-hard problem, even to find a feasible solution. The approach is evaluated on a set of problem instances from the literature, and compared to the results reached by both CPLEX solver and an efficient column generation-based algorithm. The results show that our algorithms converge rapidly to good lower bounds and visit new best-known solutions.