Hybrid Variable Neighbourhood Decomposition Search for 0-1 Mixed Integer Programming Problem

In this paper we propose new hybrid heuristics for the 0-1 mixed integer programming problem, based on the variable neighbourhood decomposition search principle and on exploiting information obtained from a series of relaxations. In the case of a maximization problem, we add iteratively pseudo-cuts...

Full description

Bibliographic Details

Published in:	Electronic notes in discrete mathematics Vol. 36; pp. 883 - 890
Main Authors:	Hanafi, Saïd, Lazić, Jasmina, Mladenović, Nenad, Wilbaut, Christophe, Crévits, Igor
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.08.2010
Subjects:	0-1 Mixed Integer Programming Multidimensional Knapsack Problem Variable Neighbourhood Search Variable Neighbourhood Search 0-1 Mixed Integer Programming Multidimensional Knapsack Problem
ISSN:	1571-0653, 1571-0653
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!