Reference : Complexity results and exact algorithms for robust knapsack problems

	Document type :	Scientific conferences in universities or research centers : Scientific conference in universities or research centers
	Discipline(s) :	Business & economic sciences : Quantitative methods in economics & management
	To cite this reference:	http://hdl.handle.net/2268/96726

Title :	Complexity results and exact algorithms for robust knapsack problems
Language :	English
Author, co-author :	Talla Nobibon, Fabrice [Université de Liège - ULg > HEC-Ecole de gestion de l'ULg : UER > UER Opérations : Supply Chain Management >]
	Leus, Roel [ > > ]
Publication date :	4-Mar-2011
Page number :	2
Audience :	International
Event name :	ROADEF
Event date :	du 2 au 4 mars 2011
Event organizer :	ROADEF
Event place (city) :	Saint-Etiènne
Event country :	France
Keywords :	[en] knapsack problem ; complexity ; scenario-relaxation algorithm
Target :	Researchers
Permalink :	http://hdl.handle.net/2268/96726

	File(s) associated to this reference
	Fulltext file(s): File Commentary Version Size Access Open access Robust_KP_ROADEF2011.pdf Author preprint 99.2 kB View/Open

All documents in ORBi are protected by a user license.

 

© ULg Library Network |  Feedback |  ORBi legal notices

Dspace v1.5