Sciweavers

9810 search results - page 339 / 1962
» Problems, Descriptions and Objects
Sort
View
NHM
2010
87views more  NHM 2010»
15 years 1 months ago
The coolest path problem
We introduce the coolest path problem, which is a mixture of two well-known problems from distinct mathematical fields. One of them is the shortest path problem from combinatorial ...
Martin Frank, Armin Fügenschuh, Michael Herty...
COR
2006
99views more  COR 2006»
15 years 6 months ago
Waste collection vehicle routing problem with time windows
In this paper, we address a real life waste collection vehicle routing problem with time windows (VRPTW) with consideration of multiple disposal trips and drivers' lunch brea...
Byung-In Kim, Seongbae Kim, Surya Sahoo
ICPR
2008
IEEE
16 years 8 months ago
Solving quadratically constrained geometrical problems using lagrangian duality
In this paper we consider the problem of solving different pose and registration problems under rotational constraints. Traditionally, methods such as the iterative closest point ...
Carl Olsson, Anders Eriksson
SODA
2012
ACM
297views Algorithms» more  SODA 2012»
13 years 9 months ago
Constant factor approximation algorithm for the knapsack median problem
We give a constant factor approximation algorithm for the following generalization of the k-median problem. We are given a set of clients and facilities in a metric space. Each fa...
Amit Kumar
FOCS
2005
IEEE
16 years 12 days ago
How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems
Robust optimization has traditionally focused on uncertainty in data and costs in optimization problems to formulate models whose solutions will be optimal in the worstcase among ...
Kedar Dhamdhere, Vineet Goyal, R. Ravi, Mohit Sing...