Rankings
Publications
Search Publications
Cited-by Search
Sources
Publishers
Scholars
Scholars
Top Cited Scholars
Organizations
About
Scilit
About Us
Advisory Board
Data Sources
Career
Support / Contact
User Guide
Publisher User
Search Function
Rankings Function
API Resource
Scilit Knowledge
Metrics
Scilit Recognitions
Publications Classification
Media
News
Blog
Login
Register
Home
Publications
An improved algorithm for selecting p items with uncertain returns according to the minmax-regret criterion
Home
Publications
An improved algorithm for selecting p items with uncertain returns according to the minmax-regret criterion
An improved algorithm for selecting p items with uncertain returns according to the minmax-regret criterion
Author:
EC
Eduardo Conde
Eduardo Conde
Article Alert
Citation Alert
Add to Library
Cite
Download
Share
Download
Download PDF
Download
Publisher website
Google Scholar
1 June 2004
journal article
Published by
Springer Nature
in
Mathematical Programming
Vol. 100
(2)
,
345-353
DOI:
10.1007/s10107-003-0474-7
Abstract
No abstract available
Keywords
POLYNOMIAL ALGORITHM
COMPLEXITY
ROBUST OPTIMIZATION
KNAPSACK PROBLEM
Cited
Cited by 50 articles
Scroll to top