{"type":"ScholarlyArticle","title":"A Hybrid Approach for the 01 Multidimensional Knapsack problem","authors":[{"name":"Michel Vasquez","slug":"michel-vasquez","given":"Michel","family":"Vasquez","affiliation":""},{"name":"Jin-Kao Hao","slug":"jin-kao-hao","given":"Jin-Kao","family":"Hao","affiliation":""}],"abstract":"We present a hybrid approach for the 0–1 multidimensional knapsack problem. The proposed approach combines linear programming and Tabu Search. The resulting algorithm improves significantly on the best known results of a set of more than 150 benchmark instances.","doi":null,"url":"https://ijcai.org/proceedings/2001/47","pdf":"https://ijcai.org/proceedings/2001/0047.pdf","markdown":"https://ijcai.org/proceedings/2001/47.md","bibtex":"https://ijcai.org/proceedings/2001/bibtex/47","volume":{"slug":"2001","title":"Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2001","url":"https://ijcai.org/proceedings/2001/","year":2001,"location":"Seattle, Washington, USA","dates":"","editors":"","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":47,"pages":{"first":328,"last":332},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}