Sciweavers

850 search results - page 49 / 170
» heuristics 2006
Sort
View
JMLR
2006
145views more  JMLR 2006»
15 years 20 days ago
Ensemble Pruning Via Semi-definite Programming
An ensemble is a group of learning models that jointly solve a problem. However, the ensembles generated by existing techniques are sometimes unnecessarily large, which can lead t...
Yi Zhang 0006, Samuel Burer, W. Nick Street
90
Voted
IOR
2010
99views more  IOR 2010»
14 years 11 months ago
Dynamic Pricing with a Prior on Market Response
We study a problem of dynamic pricing faced by a vendor with limited inventory, uncertain about demand, aiming to maximize expected discounted revenue over an infinite time horiz...
Vivek F. Farias, Benjamin Van Roy
82
Voted
EOR
2007
95views more  EOR 2007»
15 years 19 days ago
A hybrid genetic algorithm for the two-dimensional single large object placement problem
In the two-dimensional single large object placement problem, we are given a rectangular master surface which has to be cut into a set of smaller rectangular items, with the aim o...
Eleni Hadjiconstantinou, Manuel Iori
98
Voted
EOR
2007
93views more  EOR 2007»
15 years 19 days ago
Location-routing: Issues, models and methods
This paper is a survey of location-routing: a relatively new branch of locational analysis that takes into account vehicle routing aspects. We propose a classification scheme and...
Gábor Nagy, Saïd Salhi
98
Voted
IJCGA
1998
97views more  IJCGA 1998»
15 years 11 days ago
Triangulation of Branching Contours Using Area Minimization
This paper presents a new method for reconstructing piecewise linear surfaces from planar polygonal contours that branch. For non-branching contours, experience has shown that the...
Mu Hong, Thomas W. Sederberg, Kris Klimaszewski, K...