Sciweavers

6562 search results - page 134 / 1313
» Noetherianity and Combination Problems
Sort
View
UAI
2001
15 years 6 months ago
A Clustering Approach to Solving Large Stochastic Matching Problems
In this work we focus on efficient heuristics for solving a class of stochastic planning problems that arise in a variety of business, investment, and industrial applications. The...
Milos Hauskrecht, Eli Upfal
EOR
2006
118views more  EOR 2006»
15 years 4 months ago
A random-key genetic algorithm for the generalized traveling salesman problem
The Generalized Traveling Salesman Problem is a variation of the well known Traveling Salesman Problem in which the set of nodes is divided into clusters; the objective is to find...
Lawrence V. Snyder, Mark S. Daskin
NETWORKS
2008
15 years 4 months ago
New dynamic programming algorithms for the resource constrained elementary shortest path problem
The resource-constrained elementary shortest path problem arises as a pricing subproblem in branch-and-price algorithms for vehicle routing problems with additional constraints. W...
Giovanni Righini, Matteo Salani
ICCV
2005
IEEE
16 years 6 months ago
Globally Optimal Estimates for Geometric Reconstruction Problems
We introduce a framework for computing statistically optimal estimates of geometric reconstruction problems. While traditional algorithms often suffer from either local minima or ...
Fredrik Kahl, Didier Henrion
ICIC
2007
Springer
15 years 11 months ago
A Hybrid Electromagnetism-Like Algorithm for Single Machine Scheduling Problem
Electromagnetism-like algorithm (EM) is a population-based meta-heuristic which has been proposed to solve continuous problems effectively. In this paper, we present a new meta-h...
Shih-Hsin Chen, Pei-Chann Chang, Chien-Lung Chan, ...