Sciweavers

3875 search results - page 173 / 775
» Approximation algorithms for the 0-extension problem
Sort
View
CCE
2004
15 years 4 months ago
Computational studies using a novel simplicial-approximation based algorithm for MINLP optimization
Significant advances have been made in the last two decades for the effective solution of mixed integer non-linear programming (MINLP) problems, mainly by exploiting the special s...
Vishal Goyal, Marianthi G. Ierapetritou
163
Voted
ALGORITHMICA
2010
141views more  ALGORITHMICA 2010»
15 years 5 months ago
Parameterized Complexity and Local Search Approaches for the Stable Marriage Problem with Ties
Abstract. We consider the variant of the classical Stable Marriage problem where preference lists can be incomplete and may contain ties. In such a setting, finding a stable matchi...
Dániel Marx, Ildikó Schlotter
ICDAR
1999
IEEE
15 years 9 months ago
Models and Algorithms for Duplicate Document Detection
This paper introduces a framework for clarifying and formalizing the duplicate document detection problem. Four distinct models are presented, each with a corresponding algorithm ...
Daniel P. Lopresti
118
Voted
AAIM
2008
Springer
90views Algorithms» more  AAIM 2008»
15 years 11 months ago
Facility Location Problems: A Parameterized View
Facility Location can be seen as a whole family of problems which have many obvious applications in economics. They have been widely explored in the Operations Research community, ...
Michael R. Fellows, Henning Fernau
147
Voted
ESA
1998
Springer
145views Algorithms» more  ESA 1998»
15 years 9 months ago
Moving-Target TSP and Related Problems
Previous literature on the Traveling Salesman Problem (TSP) assumed that the sites to be visited are stationary. Motivated by practical applications, we introduce a time-dependent ...
Christopher S. Helvig, Gabriel Robins, Alexander Z...