Sciweavers

142 search results - page 11 / 29
» eor 2007
Sort
View
EOR
2007
90views more  EOR 2007»
13 years 7 months ago
Further results on concordance relations
The purpose of this note is to sharpen the results in Bouyssou and Pirlot (2005) giving an axiomatic characterization of concordance relations. We show how the conditions used in ...
Denis Bouyssou, Marc Pirlot
EOR
2007
99views more  EOR 2007»
13 years 7 months ago
Computing the asymptotic worst-case of bin packing lower bounds
This paper addresses the issue of computing the asymptotic worst-case of lower bounds for the Bin Packing Problem. We introduce a general result that allows to bound the asymptoti...
Teodor Gabriel Crainic, Guido Perboli, Miriam Pezz...
EOR
2007
147views more  EOR 2007»
13 years 7 months ago
Routing and wavelength assignment in optical networks using bin packing based algorithms
This paper addresses the problem of routing and wavelength assignment (RWA) of static lightpath requests in wavelength routed optical networks. The objective is to minimize the nu...
Nina Skorin-Kapov
EOR
2007
105views more  EOR 2007»
13 years 7 months ago
Newton's method and its use in optimization
Newton’s method is a basic tool in numerical analysis and numerous applications, including operations research and data mining. We survey the history of the method, its main ide...
Boris T. Polyak
EOR
2007
111views more  EOR 2007»
13 years 7 months 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