Sciweavers

4118 search results - page 74 / 824
» Efficient Algorithms for Airline Problem
Sort
View
JOC
2000
100views more  JOC 2000»
14 years 9 months ago
Computing Discrete Logarithms in Quadratic Orders
We present efficient algorithms for computing discrete logarithms in the classgroupofaquadraticorderandforprincipalitytestinginarealquadraticorder,based on the work of D
Michael J. Jacobson Jr.
ACL
2006
14 years 11 months ago
An Improved Redundancy Elimination Algorithm for Underspecified Representations
We present an efficient algorithm for the redundancy elimination problem: Given an underspecified semantic representation (USR) of a scope ambiguity, compute an USR with fewer mut...
Alexander Koller, Stefan Thater
EOR
2010
98views more  EOR 2010»
14 years 10 months ago
Lagrangean duals and exact solution to the capacitated p-center problem
In this work we study the Capacitated p-Center Problem (CpCP) and we propose an exact algorithm to solve it. We study two auxiliary problems and their relation to CpCP, and we pro...
Maria Albareda-Sambola, Juan A. Díaz, Elena...
4OR
2005
104views more  4OR 2005»
14 years 9 months ago
The robust shortest path problem with interval data via Benders decomposition
Many real problems can be modelled as robust shortest path problems on digraphs with interval costs, where intervals represent uncertainty about real costs and a robust path is not...
Roberto Montemanni, Luca Maria Gambardella
SODA
2000
ACM
106views Algorithms» more  SODA 2000»
14 years 11 months ago
Algorithms for optimizing production DNA sequencing
We discuss the problem of optimally "finishing" a partially sequenced, reconstructed DNA segment. At first sight, this appears to be computationally hard. We construct a...
Éva Czabarka, Goran Konjevod, Madhav V. Mar...