8413 search results - page 151 / 1683 » Ordering Problem Subgoals |
118
Voted
EOR
2007
15 years 2 months ago
2007
The knapsack problem (KP) is generalized to the case where items are partially ordered through a set of precedence relations. As in ordinary KPs, each item is associated with proï...
112
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. The coalition structure formation problem represents an active research area in multi-agent systems. A coalition structure is defined as a partition of the agents involve...
123
click to vote
MP
2008
15 years 2 months ago
2008
Abstract. Two corrector-predictor interior point algorithms are proposed for solving monotone linear complementarity problems. The algorithms produce a sequence of iterates in the ...
101
click to vote
EOR
2007
15 years 2 months ago
2007
We analyze an extension of the classical multi-period, single-item, linear cost inventory problem where the objective function is a coherent risk measure. Properties of coherent r...
PAIRING
2007
Springer
15 years 8 months ago
2007
Springer
— In EUROCRYPT 2006, Cheon proposed breakthrough algorithms for pairing-related problems such as the q-weak/strong Diffie-Hellman problem. Using that the exponents of an element ...