Sciweavers

1617 search results - page 173 / 324
» Constraints in Weighted Averaging
Sort
View
EOR
2007
111views more  EOR 2007»
15 years 21 days ago
A pegging approach to the precedence-constrained knapsack problem
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ï...
Byungjun You, Takeo Yamada
AIR
2005
122views more  AIR 2005»
15 years 20 days ago
Retrieval Failure and Recovery in Recommender Systems
In case-based reasoning (CBR) approaches to product recommendation, descriptions of the available products are stored in a case library and retrieved in response to a query represe...
David McSherry
114
Voted
TR
2008
117views more  TR 2008»
15 years 20 days ago
Redundancy Allocation for Series-Parallel Systems Using Integer Linear Programming
We consider the problem of maximizing the reliability of a series-parallel system given cost and weight constraints on the system. The number of components in each subsystem and th...
Alain Billionnet
88
Voted
EOR
2008
80views more  EOR 2008»
15 years 9 days ago
An efficient implementation of a VNS/ILS heuristic for a real-life car sequencing problem
The car sequencing problem consists in sequencing a given set of cars to be produced in a single day. We address one of the variants of this problem, in which the objective of mini...
Celso C. Ribeiro, Daniel Aloise, Thiago F. Noronha...
113
Voted
IJDSN
2008
81views more  IJDSN 2008»
15 years 8 days ago
A Flexible Stochastic Automaton-Based Algorithm for Network Self-Partitioning
This article proposes a flexible and distributed stochastic automaton-based network partitioning algorithm that is capable of finding the optimal k-way partition with respect to a...
Yan Wan, Sandip Roy, Ali Saberi, Bernard C. Lesieu...