Sciweavers

16596 search results - page 156 / 3320
» Generalized Assignment Problems
Sort
View
ATAL
2009
Springer
15 years 4 months ago
Adaptive price update in distributed Lagrangian relaxation protocol
Distributed Lagrangian Relaxation Protocol (DisLRP) has been proposed to solve a distributed combinatorial maximization problem called the Generalized Mutual Assignment Problem (G...
Katsutoshi Hirayama, Toshihiro Matsui, Makoto Yoko...
DISOPT
2006
101views more  DISOPT 2006»
14 years 10 months ago
Greedy-type resistance of combinatorial problems
This paper gives a sufficient condition for a combinatorial problem to be greedy-type-resistant, i.e. such that, on some instances of the problem, any greedy-type algorithm will o...
Gareth Bendall, François Margot
EOR
2006
104views more  EOR 2006»
14 years 10 months ago
An linear programming based lower bound for the simple assembly line balancing problem
The simple assembly line balancing problem is a classical integer programming problem in operations research. A set of tasks, each one being an indivisible amount of work requirin...
Marc Peeters, Zeger Degraeve
ACISP
2003
Springer
15 years 3 months ago
The Unsolvable Privacy Problem and Its Implications for Security Technologies
Abstract. Privacy presents many puzzles. In particular, why is it eroding, given the high value people assign to their privacy? This extended argues that there are strong incentive...
Andrew M. Odlyzko
MWCN
2004
Springer
15 years 3 months ago
Minimum Power Symmetric Connectivity Problem in Wireless Networks: A New Approach
We consider the problem of assigning transmission powers to the nodes of a wireless network in such a way that all the nodes of the network are connected by bidirectional links and...
Roberto Montemanni, Luca Maria Gambardella