Ricardo Correa, Afonso Ferreira  Home/Search
Context Related
| rutgers.edu/pub/dimacs/Te...9503.ps.gz enslyon.fr/pub/users/LIP/f...lyon.ps.Z 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: rutgers.edu/TechnicalRepor...1995 (more) From: fermivista.math...ftp.enslyon.fr (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this report, parallelism is used as a way to solve discrete optimization problems. We search for an optimal solution x 2 S , where S is the set of all best solutions in a domain S, defined as the discrete set of all vectors x in the solution space that satisfy a set of constraints. Improving the search efficiency is of considerable importance since exhaustive search is often impracticable. The method called branch-and-bound (noted B&B) is a tree search algorithm often used as an... (Update)
Context of citations to this paper: More
...offer efficient components. Moreover, parallelism seems to be an interesting option to resolve larger problems more quickly [3, 5, 12, 16, 24, 36]. However, when someone writes an efficient sequential Branch and Bound application, he rarely ports it on a parallel machine....
...on the number of iterations. However, this reduction can deviate considerably from CCS 95 53 linear due to possible speedup anomalies [3]. This kind of parallel branch and bound is considered as an irregular parallel algorithm due to the fact that the shape of the search...
Cited by: More
A Library Hierarchy for Implementing Scalable Parallel.. - Ralphs, Ladanyi.. (2004) (Correct)
A Parallel General Branch-and-Bound Library and Applications.. - Correa, al. (Correct)
BOB : a Unified Platform for Implementing Branch-and-Bound.. - Le Cun, Team (1995) (Correct)
Active bibliography (related documents): More All
1.3: Asynchronous Parallel Branch and Bound and Anomalies - de Bruin, Kindervater.. (1995) (Correct)
1.1: Parallel Processing of Discrete Optimization Problems - Ananth, Kumar, Pardalos (1992) (Correct)
1.1: A Survey of Parallel Search Algorithms for Discrete.. - Grama, Kumar (1993) (Correct)
Similar documents based on text: More All
0.2: A Randomized BSP/CGM Algorithm for the Maximal Independent Set.. - Schabanel (Correct)
0.2: Public Debt Neutrality And Private Consumption Some Evidence From .. - Afonso (1999) (Correct)
0.2: Ultra-Fast Parallel Contour Tracking, With Applications to.. - Ferreira, Ubéda (Correct)
Related documents from co-citation: More All
2: A Distributed Processing Algorithm For Solving Integer Programs Using a Cluster .. - Hai, et et al. - 1994
2: ACM Transactions on Programming Languages and Systems (context) - Finkel, Manber et al. - 1987
BibTeX entry: (Update)
Correa (R.) et Ferreira (A.). -- Parallel best-first branch-and-bound in discrete optimization : a framework. -- Rapport technique n 95--03, DIMACS, Rutgers University, Mars 1995. http://citeseer.ist.psu.edu/article/et95parallel.html More
@inproceedings{ correa96parallel,
author = "Ricardo C. Correa and Afonso Ferreira",
title = "Parallel best-first branch-and-bound in discrete optimization: a framework",
booktitle = "Solving Combinatorial Optimization Problems in Parallel",
pages = "171-200",
year = "1996",
url = "citeseer.ist.psu.edu/article/et95parallel.html" }
Citations (may not include all citations):4212 Computers and Intractability: A Guide to the Theory of NP-Co.. (context) - Garey, Johnson - 1979
3972 Introduction to Algorithms (context) - Cormen, Leiserson et al. - 1990
518 Integer and Combinatorial Optimization (context) - Nemhauser, Wolsey - 1988
348 Parallel and Distributed Computation: Numerical Methods (context) - Bertsekas, Tsitsiklis - 1989
288 Introduction to Parallel Computing: Design and Analysis of A.. (context) - Kumar, Grama et al. - 1994
266 Heuristics - Intelligent Search Strategies for Computer Prob.. (context) - Pearl - 1984
98 The Handbook of Artificial Intelligence (context) - Barr, Feigenbaum - 1981
49 A randomized parallel branch-and-bound procedure (context) - Karp, Zhang - 1988
46 Anomalies in parallel branch-and-bound algorithms - Lai, Sahni - 1984
42 Randomized parallel algorithms for backtrack search and bran.. (context) - Karp, Zhang - 1993
37 ACM Transactions on Programming Languages and Systems (context) - Finkel, Manber et al. - 1987
35 Prentice Hall Inc (context) - Papadimitriou, Steiglitz et al. - 1982
29 Parallel best-first search of state-space graphs: A summary .. - Kumar, Ramesh et al. - 1988
28 Parallel branch-and-bound algorithms for general mixed integ.. (context) - Eckstein - 1994
25 Parallel algorithms for the quadratic assignment problem (context) - Li, Pardalos - 1992
25 A parallel algorithm for the quadratic assignment problem (context) - Pardalos, Crouse - 1989
25 An algorithm for the traveling salesman problem (context) - Little, Murty et al. - 1963
18 A parallel branch and bound algorithm for the quadratic assi.. (context) - Roucairol - 1987
18 Branch-and-bound methods: General formulation and properties (context) - Mitten - 1970
16 The consequences of fixed time performance measurement (context) - Gustafson - 1992
16 Analysis and Implementation of Branch and Bound Algorithms o.. (context) - Quinn - 1990
15 Theoretical comparisons of search strategies in branch-and-b.. (context) - Ibaraki - 1976
14 IEEE Transactions on Computers (context) - Horowitz, Zorat et al. - 1983
13 MANIP - A multicomputer architecture for solving combinatori.. (context) - Wah, Eva - 1984
12 Load balancing for distributed branch & bound algorithms - Luling, Monien - 1993
12 Load balancing for distributed branch & bound algorithms - Luling, Monien - 1992
11 The power of dominance relations in branch-and-bound algorit.. (context) - Ibaraki - 1977
10 Coping with anomalies in parallel branch-and-bound algorithm.. (context) - Li, Wah - 1986
9 Simple approaches to parallel Branch and Bound (context) - Laursen - 1993
9 The CDP: a unifying formulation for heuristic search (context) - Kumar, Kanal - 1983
9 Efficient parallel algorithms for search problems: Applicati.. (context) - Arvindam, Kumar et al. - 1990
8 Parallel processing of discrete optimization problems - Ananth, Kumar et al. - 1993
8 Parallel branch and bound algorithms on hypercube multiproce.. (context) - Abdelrahman, Mudge - 1988
7 Performance of parallel branch-and-bound algorithms (context) - Lai, Sprague - 1985
6 Parallel Branch and Bound Algorithms (context) - Trienekens - 1990
6 A parallel branch and bound algorithm for solving large asym.. (context) - Pekny, Miller - 1992
6 A dynamic load balancer for a parallel branch and bound algo.. (context) - Ma, Tsung et al. - 1988
6 Do inherently sequential branch-and-bound algorithms exist (context) - Clausen - 1994
5 Branch-and-bound strategies for dynamic programming (context) - Morin, Marsten - 1976
5 Control strategies for parallel mixed integer branch and bou.. (context) - Eckstein - 1994
5 Branch-and-bound and parallel computation: a historical note (context) - Pruul, Nemhauser et al. - 1988
5 Results from a parallel branch and bound algorithm for the a.. (context) - Miller, Pekny - 1989
5 Dynamic programming as graph searching: An algebraic approac.. (context) - Gnesi, Montanari et al.
4 Branching from the largest upper bound: folklore and facts (context) - Fox, Lenstra et al. - 1978
4 ele : Parall (context) - Mans, Non et al. - 1992
4 Process and workload migration for a parallel branch-and-bou.. (context) - Schawan, Gawkowski et al. - 1988
3 Parallel branch-and-bound algorithms for combinatorial optim.. (context) - Pardalos, Li - 1990
2 A distributed implementation of asynchronous parallel branch.. (context) - Correa, Ferreira - 1994
2 A parallel best-first B&B with synchronization phases (context) - Gengler, Coray - 1992
2 and its relation to A and AO (context) - Nau, Kumar et al. - 1984
1 Solving Irregular Problems in Parallel: State of the Art (context) - Ferreira, Rolim - 1995
1 Random trees and the analysis of branch and bound (context) - Smith - 1984
1 Modeling parallel branch-and-bound for asynchronous implemen.. (context) - Correa, Ferreira - 1994
1 A comparision of two paradigms for distributed shared memory (context) - Levelt, Kaashoek et al. - 1992
1 LITH - Ecole Polytechnique F'ed'erale de Lausanne (context) - Gengler, bound - 1992
1 A parallel integer LP algorithm (context) - Boehning, Butler et al. - 1988
1 An upper bound for the speedup of parallel best-first branch.. (context) - Quinn, Deo - 1986
1 the effectiveness of synchronous branch-and-bound algorithms (context) - Correa, Ferreira - 1994
Documents on the same site (http://dimacs.rutgers.edu/TechnicalReports/1995.html): More
Localizing a Robot with Minimum Travel - Dudek, Romanik, Whitesides (1995) (Correct)
On a Metric Generalization of Ramsey's Theorem - Erdös, Hajnal, Pach (1995) (Correct)
On the Approximability of Numerical Taxonomy.. - Agarwala, Bafna.. (1995) (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