Sciweavers

221 search results - page 8 / 45
» New formulations for the Kissing Number Problem
Sort
View
HEURISTICS
2008
124views more  HEURISTICS 2008»
14 years 9 months ago
A variable neighborhood search for the capacitated arc routing problem with intermediate facilities
In this talk we present a unified Variable Neighborhood Search (VNS) algorithm for the Capacitated Arc Routing Problem (CARP) and some of its variants - the Capacitated Arc Routin...
Michael Polacek, Karl F. Doerner, Richard F. Hartl...
KDD
2004
ACM
173views Data Mining» more  KDD 2004»
15 years 10 months ago
A microeconomic data mining problem: customer-oriented catalog segmentation
The microeconomic framework for data mining [7] assumes that an enterprise chooses a decision maximizing the overall utility over all customers where the contribution of a custome...
Martin Ester, Rong Ge, Wen Jin, Zengjian Hu
AIPS
2000
14 years 11 months ago
Admissible Heuristics for Optimal Planning
hsp and hspr are two recent planners that search the state-space using an heuristic function extracted from Strips encodings. hsp does a forward search from the initial state reco...
Patrik Haslum, Hector Geffner
ANOR
2002
57views more  ANOR 2002»
14 years 9 months ago
Redefining Event Variables for Efficient Modeling of Continuous-Time Batch Processing
Abstract: We define events so as to reduce the number of events and decision variables needed for modeling batchscheduling problems such as described in [Westenberger and Kallrath ...
Siqun Wang, Monique Guignard
ESA
2007
Springer
143views Algorithms» more  ESA 2007»
15 years 3 months ago
Two's Company, Three's a Crowd: Stable Family and Threesome Roommates Problems
We investigate Knuth’s eleventh open question on stable matchings. In the stable family problem, sets of women, men, and dogs are given, all of whom state their preferences among...
Chien-Chung Huang