Approximating the min–max (regret) selecting items problem - Peeref

标题

Approximating the min–max (regret) selecting items problem

作者

关键词

-

出版物

INFORMATION PROCESSING LETTERS

Volume 113, Issue 1-2, Pages 23-29

出版商

Elsevier BV

发表日期

2012-10-09

DOI

10.1016/j.ipl.2012.10.001

向作者/读者发起求助以获取更多资源

Protocol

Reagent

Reprint

Discover Peeref hubs

Discuss science. Find collaborators. Network.

Join a conversation

Find the ideal target journal for your manuscript

Explore over 38,000 international journals covering a vast array of academic fields.

Search

© Peeref 2019-2024. All rights reserved.