Sciweavers

5 search results - page 1 / 1
» The Dynamic Uncapacitated Hub Location Problem
Sort
View
TRANSCI
2011
80views more  TRANSCI 2011»
13 years 6 months ago
The Dynamic Uncapacitated Hub Location Problem
This paper presents a dynamic (or multi-period) hub location problem. It proposes a branch-and-bound algorithm that uses a Lagrangean relaxation to obtain lower and upper bounds a...
Ivan Contreras, Jean-François Cordeau, Gilb...
CPAIOR
2006
Springer
14 years 2 months ago
AND/OR Branch-and-Bound Search for Pure 0/1 Integer Linear Programming Problems
Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...
Radu Marinescu 0002, Rina Dechter
CONSTRAINTS
2010
101views more  CONSTRAINTS 2010»
13 years 11 months ago
Evaluating the impact of AND/OR search on 0-1 integer linear programming
AND/OR search spaces accommodate advanced algorithmic schemes for graphical models which can exploit the structure of the model. We extend and evaluate the depth-first and best-fi...
Radu Marinescu 0002, Rina Dechter
ERCIMDL
2003
Springer
106views Education» more  ERCIMDL 2003»
14 years 4 months ago
Topical Crawling for Business Intelligence
Abstract. The Web provides us with a vast resource for business intelligence. However, the large size of the Web and its dynamic nature make the task of foraging appropriate inform...
Gautam Pant, Filippo Menczer
ADBIS
2004
Springer
147views Database» more  ADBIS 2004»
14 years 4 months ago
A Hybrid Keyword Search across Peer-to-Peer Federated Databases
The need for Keyword search in databases is suggested both by Web integration with legacy database management system and by dynamic Web publication. However, it sacrifices the inh...
Jungkee Kim, Geoffrey Fox