Sciweavers

673 search results - page 60 / 135
» Preference-Based Problem Solving for Constraint Programming
Sort
View
CP
2005
Springer
14 years 1 months ago
Conditional Symmetry Breaking
Conditional symmetry arises in a sub-problem of a constraint satisfaction problem, where the sub-problem satisfies some condition under which additional symetries hold. Typically...
Ian P. Gent, Tom Kelsey, Steve Linton, Iain McDona...
ICCV
2009
IEEE
15 years 20 days ago
Constrained Clustering by Spectral Kernel Learning
Clustering performance can often be greatly improved by leveraging side information. In this paper, we consider constrained clustering with pairwise constraints, which specify s...
Zhenguo Li, Jianzhuang Liu
OSN
2007
185views more  OSN 2007»
13 years 7 months ago
Comparison of ILP formulations for the RWA problem
— We present a review of the various integer linear programming (ILP) formulations that have been proposed for the routing and wavelength assignment problem in WDM optical networ...
Brigitte Jaumard, Christophe Meyer, B. Thiongane
CPAIOR
2008
Springer
13 years 9 months ago
The Accuracy of Search Heuristics: An Empirical Study on Knapsack Problems
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
Daniel H. Leventhal, Meinolf Sellmann
EOR
2011
134views more  EOR 2011»
13 years 2 months ago
Linear programming based decomposition methods for inventory distribution systems
We consider an inventory distribution system consisting of one warehouse and multiple retailers. The retailers face random demand and are supplied by the warehouse. The warehouse ...
Sumit Kunnumkal, Huseyin Topaloglu