Login
EN
[EN] English
[FR] Français
Login
EN
[EN] English
[FR] Français
Give us feedback
Explore
Search
Special collections
Statistics
News
Help
Start on ORBi
Deposit
Profile
Publication List
Add your ORCID
Tutorials
Legal Information
Training sessions
About
What's ORBi ?
Impact and visibility
Around ORBi
About statistics
About metrics
OAI-PMH
ORBi team
Release Notes
Back
Home
Detailled Reference
Download
Scientific conference in universities or research centers (Scientific conferences in universities or research centers)
Complexity results and exact algorithms for robust knapsack problems
Talla Nobibon, Fabrice
;
Leus, Roel
2011
Permalink
https://hdl.handle.net/2268/96726
Files (1)
Send to
Details
Statistics
Bibliography
Similar publications
Files
Full Text
Robust_KP_ROADEF2011.pdf
Author preprint (101.58 kB)
Download
All documents in ORBi are protected by a
user license
.
Send to
RIS
BibTex
APA
Chicago
Permalink
X
Linkedin
copy to clipboard
copied
Details
Keywords :
knapsack problem; complexity; scenario-relaxation algorithm
Disciplines :
Quantitative methods in economics & management
Author, co-author :
Talla Nobibon, Fabrice
;
Université de Liège - ULiège > HEC-Ecole de gestion : UER > UER Opérations : Supply Chain Management
Leus, Roel
Language :
English
Title :
Complexity results and exact algorithms for robust knapsack problems
Publication date :
04 March 2011
Number of pages :
2
Event name :
ROADEF
Event organizer :
ROADEF
Event place :
Saint-Etiènne, France
Event date :
du 2 au 4 mars 2011
Audience :
International
Available on ORBi :
since 06 August 2011
Statistics
Number of views
71 (0 by ULiège)
Number of downloads
294 (0 by ULiège)
More statistics
Bibliography
Similar publications
Contact ORBi