Sciweavers

229 search results - page 13 / 46
» Solving a Supply Chain Optimization Problem Collaboratively
Sort
View
WECWIS
2002
IEEE
129views ECommerce» more  WECWIS 2002»
14 years 14 days ago
On the Sensitivity of Incremental Algorithms for Combinatorial Auctions
Despite the large amounts of runtime needed to adequately solve a combinatorial auction (CA), existing iterative CA auction protocols require winner determination during every rou...
Ryan Kastner, Christina Hsieh, Miodrag Potkonjak, ...
DEXAW
2009
IEEE
141views Database» more  DEXAW 2009»
13 years 8 months ago
Improving Practical Performance on Secure and Private Collaborative Linear Programming
Although information sharing in supply chain management dramatically reduces costs, parties are reluctant to do so, mainly due to fear of information leakage. Solutions based on se...
Rafael Deitos, Florian Kerschbaum
ATAL
2006
Springer
13 years 11 months ago
Adaptive Pricing for Customers with Probabilistic Valuations
Abstract. In this paper, we examine the problem of choosing discriminatory prices for customers with probabilistic valuations and a seller with indistinguishable copies of a good. ...
Michael Benisch, James Andrews, Norman M. Sadeh
STOC
2004
ACM
107views Algorithms» more  STOC 2004»
14 years 7 months ago
Primal-dual algorithms for deterministic inventory problems
We consider several classical models in deterministic inventory theory: the single-item lot-sizing problem, the joint replenishment problem, and the multi-stage assembly problem. ...
Retsef Levi, Robin Roundy, David B. Shmoys
SIGECOM
2004
ACM
96views ECommerce» more  SIGECOM 2004»
14 years 29 days ago
A stochastic programming approach to scheduling in TAC SCM
In this paper, we combine two approaches to handling uncertainty: we use techniques for finding optimal solutions in the expected sense to solve combinatorial optimization proble...
Michael Benisch, Amy R. Greenwald, Victor Narodits...