W.J. van Hoeve, M. Milano  Home/Search
Context
Related
| homepages.cwi.nl/~wjvh/papers...dbs.pdf cornell.edu/~vanhoeve/papers/dbs.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: homepages.cwi.nl/~wjvh/publ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this paper we present and evaluate a search strategy called Decomposition Based Search (DBS) which is based on two steps: subproblem generation and subproblem solution. The generation of subproblems is done through value ranking and domain splitting. subdomains are explored so as to generate, according to the heuristic chosen, promising subproblems first. (Update)
Active bibliography (related documents): More All
0.6: Postponing Branching Decisions - Willem Jan Van (Correct)
0.2: A Hybrid Constraint Programming and Semidefinite Programming.. - van Hoeve (2003) (Correct)
0.2: A Decomposition-Based Implementation of Search Strategies - Michel, Van Hentenryck (2002) (Correct)
Similar documents based on text: More All
0.9: Reduced Cost-Based Ranking for Generating Promising Subproblems - Milano, van Hoeve (2002) (Correct)
0.4: Integration into Constraint Programming and Parallelization of.. - Perron (1999) (Correct)
0.4: The Mobile Agent Technology to Support and to Access Museum .. - Bellavista, Corradi (2000) (Correct)
BibTeX entry: (Update)
@misc{ hoeve-decomposition,
author = "W.J. van Hoeve and M. Milano",
title = "Decomposition Based Search - a Theoretical And Experimental Evaluation",
url = "citeseer.ist.psu.edu/vanhoeve03decomposition.html" }
Citations (may not include all citations):134 Limited Discrepancy Search - Harvey, Ginsberg - 1995
124 TSPLIB - a Traveling Salesman Problem Library (context) - Reinelt - 1991
92 Reference Manual (context) - Solver - 2001
92 Reference Manual (context) - Cplex - 2001
91 Artificial Intelligence (context) - Ginsberg, Harvey - 1992
34 Depth-Bounded Discrepancy Search - Walsh - 1997
15 Search procedures and parallelism in constraint programming (context) - Perron - 1999
10 Reduced cost-based ranking for generating promising subprobl.. - Milano, van Hoeve - 2002
8 ACM Transactions on Computational Logic (context) - van Hentenryck, Perron et al. - 2000
8 Completing Quasigroups or Latin Squares: A Structured Graph .. (context) - Gomes, Shmoys - 2002
6 Solving Combinatorial Optimization Problems in Constraint Pr.. (context) - Focacci - 2001
3 Discrepancy based additive bounding (context) - Lodi, Milano et al. - 2003
1 lsencode: a generator of quasigroup with holes and quasigrou.. (context) - Gomes, Kautz et al. - 2001
Documents on the same site (http://homepages.cwi.nl/~wjvh/publ.html): More
Parallel Branch-and-Bound Algorithms using Semidefinite.. - van Hoeve (1999) (Correct)
The alldifferent Constraint: A Survey - van Hoeve (2001) (Correct)
Reduced Cost-Based Ranking for Generating Promising Subproblems - Milano, van Hoeve (2002) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC