Sciweavers

929 search results - page 63 / 186
» heuristics 2008
Sort
View
SAINT
2008
IEEE
14 years 2 months ago
Variable Neighborhood Search for a Prize Collecting Capacity Constrained Connected Facility Location Problem
We present a Variable Neighborhood Search approach for a network design problem occurring in real world when the bandwidth of an existing network shall be enhanced. Using two diff...
Markus Leitner, Günther R. Raidl
HEURISTICS
2008
124views more  HEURISTICS 2008»
13 years 7 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...
ICPR
2008
IEEE
14 years 9 months ago
Combining content and structure similarity for XML document classification using composite SVM kernels
Combination of structure and content features is necessary for effective retrieval and classification of XML documents. Composite kernels provide a way for fusion of content and s...
Pabitra Mitra, Saptarshi Ghosh
ANOR
2008
90views more  ANOR 2008»
13 years 7 months ago
Multiple orders per job batch scheduling with incompatible jobs
: The growth in demand for semiconductors has been accompanied by intense competition between semiconductor manufacturers to satisfy customer on-time delivery needs. This paper is ...
Vishnu Erramilli, Scott J. Mason
COR
2008
99views more  COR 2008»
13 years 7 months ago
Repairing MIP infeasibility through local branching
Finding a feasible solution to a generic Mixed-Integer Program (MIP) is often a very difficult task. Recently, two heuristic approaches called Feasibility Pump and Local Branching...
Matteo Fischetti, Andrea Lodi