Sciweavers

2976 search results - page 560 / 596
» On the bounded integer programming
Sort
View
MANSCI
2007
100views more  MANSCI 2007»
13 years 7 months ago
Dynamic Assortment with Demand Learning for Seasonal Consumer Goods
Companies such as Zara and World Co. have recently implemented novel product development processes and supply chain architectures enabling them to make more product design and ass...
Felipe Caro, Jérémie Gallien
JMMA
2002
90views more  JMMA 2002»
13 years 7 months ago
Implicit Convex Polygons
Convex polygons in the plane can be defined explicitly as an ordered list of vertices, or given implicitly, for example by a list of linear constraints. The latter representation h...
Francisco Gómez, Ferran Hurtado, Suneeta Ra...
MOR
2002
102views more  MOR 2002»
13 years 7 months ago
Facets of the Complementarity Knapsack Polytope
We present a polyhedral study of the complementarity knapsack problem. Traditionally, complementarity constraints are modeled by introducing auxiliary binary variables and additio...
Ismael R. de Farias Jr., Ellis L. Johnson, George ...
MP
2002
105views more  MP 2002»
13 years 7 months ago
Local behavior of an iterative framework for generalized equations with nonisolated solutions
An iterative framework for solving generalized equations with nonisolated solutions is presented. For generalized equations with the structure 0 F(z) + T (z), where T is a multifu...
Andreas Fischer
PKDD
2010
Springer
129views Data Mining» more  PKDD 2010»
13 years 6 months ago
Smarter Sampling in Model-Based Bayesian Reinforcement Learning
Abstract. Bayesian reinforcement learning (RL) is aimed at making more efficient use of data samples, but typically uses significantly more computation. For discrete Markov Decis...
Pablo Samuel Castro, Doina Precup