Van-Dat Cung, Salah Dowaji, Bertrand Le Cun, Catherine Roucairol  Home/Search
Context
Related
| enslyon.fr/pub/users...versailles.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: xoom.com/killough/heaps (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Introduction Exact methods used to solve difficult Combinatorial Optimization problems belong to a generic type. Widely used in Operations Research (OR) and Artificial Intelligence (AI), they consist of exploring a search space : -- the tree of subproblems generated by recursive partitioning of the initial problem (OR : Branch-and-Bound, denoted B&B and Branch-and-Cut algorithms) , -- the graph of transitions between states (AI : A* algorithm, ff \Gamma fi). Exhaustive search of the space... (Update)
Similar documents (at the sentence level):
8.4%: Parallel and Distributed Branch-and-Bound/A* Algorithms - Cung, Dowaji, Le Cun.. (1994) (Correct)
Active bibliography (related documents): More All
1.8: BOB : a Unified Platform for Implementing Branch-and-Bound.. - Le Cun, Team (1995) (Correct)
1.1: An Efficient Implementation of Parallel A* - Cung, Le Cun (1994) (Correct)
0.9: Portable Distributed Priority Queues with MPI - Mans (1995) (Correct)
Similar documents based on text: More All
0.5: Parallel Branch-and-Bound Algorithms using Semidefinite.. - van Hoeve (1999) (Correct)
0.4: Constrained Two-Dimensional Cutting Stock Problems - A.. - Cung, Hifi, Le Cun (1997) (Correct)
0.3: Load Balancing Strategy and Priority of Tasks in Distributed .. - Dowaji, ROUCAIROL (Correct)
BibTeX entry: (Update)
@misc{ cung-outcome,
author = "Van-Dat Cung and Salah Dowaji and Bertrand Le Cun and Catherine Roucairol",
title = "The Outcome of a Know-how: a Branch-and-Bound Library",
url = "citeseer.ist.psu.edu/120398.html" }
Citations (may not include all citations):192 Self-adjusting binary search trees (context) - Tarjan, Sleator - 1985
106 Priority search trees (context) - McCreight - 1985
80 Efficient locking for concurrent operation on b-tree (context) - Lehman, Yao - 1981
49 The pairing heap: A new form of self-adjusting heap (context) - Fredman, Sedgewick et al. - 1986
46 Anomalies in parallel branch-and-bound algorithms - Lai, Sahni - 1984
38 Concurrent operations on priority queues (context) - Jones - 1989
37 ACM Transactions on Programming Languages and Systems (context) - Finkel, Manber et al. - 1987
31 Simultaneous update of priority structures (context) - Bitwas, Browne - 1987
28 Parallel branch-and-bound algorithms for general mixed integ.. (context) - Eckstein - 1993
27 Implementation and analysis of binomial queue algorithmms (context) - Brown - 1978
23 A new exact algorithm for the solution of quadratic assignme.. (context) - Mautor, Roucairol - 1993
22 Concurrent search and insertion in 2-3 trees (context) - Ellis - 1980
22 Concurrent search and insertion in avl trees (context) - Ellis - 1981
22 Concurrent manipulation of binary search trees (context) - Kung, Lehman - 1980
21 Pairing heap: Experiments and analysis (context) - Stasko, Vitter - 1987
21 Parallel heap: An optimal parallel priority queue (context) - Deo, Prasad - 1992
16 A dynamic scheduling strategy for the chare kernel system (context) - Shu, Kal'e - 1989
14 Reducing reexpansions in iterative-deepening search by contr.. (context) - Sarkar, Charkrabarti et al. - 1991
13 Manip-a multicomputer architecture for solving combinatorial.. (context) - Wah, Ma - 1984
11 A parallel integer linear programming algorithm (context) - Boehning, Butler et al. - 1988
10 Concurrency control mechanisms and the serializability of co.. (context) - Calhoun, Ford - 1984
10 Two strategies for solving the vertex cover problem on a tra.. (context) - Luling, Monien - 1989
9 Managing a parallel heap efficiently (context) - Das, Horng - 1991
8 Computational efficiency of parallel approximate branch and .. (context) - Li, Wah - 1984
7 This article was processed using the L a T E X macro package.. (context) - Williams, Heapsort et al. - 1964
7 Distributed enumeration on networks computers (context) - Dessouki, Huen - 1980
7 Concurrent insertions and deletions in a priority queue (context) - Rao, Kumar - 1988
7 Branch and bound as a higher order function (context) - McKeown, Rayward-Smith et al. - 1991
6 Difficulties of exact methods for solving the quadratic assi.. (context) - Mautor, Roucairol - 1994
6 A parallel branch and bound algorithm for solving large asym.. (context) - Pekny, Miller - 1990
6 An evaluation of concurrent priority queue algorithms (context) - Huang - 1991
5 eles pour l (context) - Mautor, r'esolution et al. - 1993
5 ele : Exploration d (context) - Cung, Non et al. - 1994
5 Concurrency in priority queues for branch and bound algorith.. (context) - Mans, Roucairol - 1990
4 Large-scale 0-1 linear programming on distributed workstatio.. (context) - Cannon, Hoffman - 1990
4 Parallel state-space search for a first solution with consis.. (context) - Kal'e, Saletore - 1990
3 Performances of parallel branch-and-bound algorithms with be.. - Mans, Roucairol - 1993
3 An empirical comparaison of priority queue and event set imp.. (context) - Jones - 1986
3 Parallel branch-and-bound on fine grained hypercubes multipr.. (context) - Dehne, Ferreira et al. - 1990
3 Implementing best first branch and bound algorithm on hyperc.. (context) - Quinn - 1987
3 Data structures for parallel computation on shared-memory ma.. (context) - Deo - 1989
3 Comparison of concurrent priority queues for branch and boun.. (context) - Cun, Mans et al. - 1992
3 Computational experiments with an asynchronous parallel bran.. - Trienekens - 1989
3 Data structures for parallel computation on shared memory ma.. (context) - Deo - 1990
3 Recherche arborescente en parall`ele (context) - Roucairol - 1990
2 A parallel best first b&b with synchronization phases (context) - Gengler, Coray - 1992
2 Parallel processing and combinatorial optimization (context) - Burton, Keown et al. - 1982
2 The Art of Programming: Sorting and Searching (context) - Knuth - 1973
2 Priority of tasks and performances of branch-andbound load b.. - Dowaji, Roucairol - 1994
2 Branch-and-bound algorithms on a hypercube (context) - Pargas, Wooster - 1988
2 ele : une biblioth`eque branch-and-bound bob. Technical repo.. (context) - Benaichouche, Cung et al. - 1995
2 An efficient implementation of parallel - Cung, Le Cun - 1994
2 Parallel processing for difficult combinatorial optimization.. (context) - Roucairol - 1994
1 Characterization of data structures for parallel branch and .. (context) - Mans, Roucairol - 1991
1 Analyzing the scability of parallel algorithms and architect.. (context) - Kumar, Gupta - 1991
1 ele d'arbres minimax (context) - Cung, Roucairol - 1991
1 chapter Parallel Branch and Bound Algorithms : an Overview (context) - Roucairol, Distributed - 1988
1 Dcabb : A distributed control architecture for b&b computati.. (context) - Kudva, Pekny - 1993
1 Pico : Parallel implementation of combinatorial optimization (context) - Diamond, Kimbel et al. - 1991
1 Parallel computing in combinatorial optimization (context) - Roucairol - 1989
1 Parallel processing and a branch and bound algorithm (context) - Pruul - 1975
Documents on the same site (http://members.xoom.com/killough/heaps.html): More
Data Structures and Amortized Complexity in a Functional Setting - Schoenmakers (1992) (Correct)
Binary Tournaments and Priority Queues: PRAM and BSP - Marín (Correct)
Analysis of an Efficient Algorithm for the Hard-Shere Problem - Krantz (1996) (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