Sciweavers

15485 search results - page 2801 / 3097
» Computing Optimal Subsets
Sort
View
DISOPT
2008
138views more  DISOPT 2008»
15 years 6 months ago
An algorithmic framework for convex mixed integer nonlinear programs
This paper is motivated by the fact that mixed integer nonlinear programming is an important and difficult area for which there is a need for developing new methods and software f...
Pierre Bonami, Lorenz T. Biegler, Andrew R. Conn, ...
EOR
2010
102views more  EOR 2010»
15 years 6 months ago
The Tree of Hubs Location Problem
The Tree-of-Hubs Location Problem is studied. This problem, which combines several aspects of some location, network design and routing problems, is inspired by those transportati...
Iván A. Contreras, Elena Fernández, ...
EAAI
2008
75views more  EAAI 2008»
15 years 6 months ago
Enacting agent-based services for automated procurement
Negotiation events in industrial procurement involving multiple, highly customisable goods pose serious challenges to buying agents when trying to determine the best set of provid...
Andrea Giovannucci, Juan A. Rodríguez-Aguil...
ALGORITHMICA
2006
94views more  ALGORITHMICA 2006»
15 years 6 months ago
Efficient Algorithms for k Maximum Sums
We study the problem of computing the k maximum sum subsequences. Given a sequence of real numbers x1, x2, . . . , xn and an integer parameter k, 1 k 1 2 n(n - 1), the problem in...
Fredrik Bengtsson, Jingsen Chen
AUTOMATICA
2006
101views more  AUTOMATICA 2006»
15 years 6 months ago
A risk-sensitive approach to total productive maintenance
While risk-sensitive (RS) approaches for designing plans of total productive maintenance are critical in manufacturing systems, there is little in the literature by way of theoret...
Abhijit Gosavi
« Prev « First page 2801 / 3097 Last » Next »