Improved convergent heuristics for the 0-1 multidimensional knapsack problem

At the end of the seventies, Soyster et al. (Eur. J. Oper. Res. 2:195–201, 1978 ) proposed a convergent algorithm that solves a series of small sub-problems generated by exploiting information obtained through a series of linear programming relaxations. This process is suitable for the 0-1 mixed int...

Full description

Saved in:

Bibliographic Details
Published in:	Annals of operations research Vol. 183; no. 1; pp. 125 - 142
Main Authors:	Hanafi, Saïd, Wilbaut, Christophe
Format:	Journal Article
Language:	English
Published:	Boston Springer US 01.03.2011 Springer Science + Business Media Springer Springer Nature B.V Springer Verlag
Subjects:	Algorithms Business and Management Combinatorics Computer Science Convergence Dominance Dynamic programming Heuristic Integer programming Knapsack problem Linear programming Mathematical analysis Methods Mixed integer Operations Research Operations Research/Decision Theory Optimization Optimization techniques Studies Theory of Computation Variables Multidimensional knapsack problem Relaxation Heuristic Multidimensional knapsack problem
ISSN:	0254-5330, 1572-9338
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!