Solving efficiently the 0–1 multi-objective knapsack problem

descriptionPublicationkeyboard_double_arrow_right Article 01 Jan 2009 France English Publisher:Elsevier BVJournal:Computers & Operations Research, volume 36, pages 260-279 (issn: 0305-0548,

Copyright policy )

Authors: Cristina Bazgan; Hadrien Hugot; Daniel Vanderpooten;

doi: 10.1016/j.cor.2007.09.009

Solving efficiently the 0–1 multi-objective knapsack problem

- Summary
- Subjects
- Metrics

Abstract

zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Country

France

Related Organizations

Paris Dauphine University
France

Keywords

Efficient solutions, dynamic programming, Combinatorial optimization, 511, Dominance relations, Dynamic programming, 650, efficient solutions, 004, Principes généraux des mathématiques, non-dominated criterion vectors, Boolean programming, Non-dominated criterion vectors, Multi-objective knapsack problem, Multi-objective and goal programming, dominance relations

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	113
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 1%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 1%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Top 10%