The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase branch and bound (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1966-1973 (15) 1974-1976 (20) 1977-1981 (18) 1982-1984 (17) 1985-1986 (20) 1987-1988 (19) 1989 (18) 1990 (22) 1991 (18) 1992 (21) 1993 (23) 1994 (36) 1995 (47) 1996 (27) 1997 (37) 1998 (44) 1999 (48) 2000 (58) 2001 (53) 2002 (60) 2003 (90) 2004 (101) 2005 (114) 2006 (132) 2007 (131) 2008 (145) 2009 (114) 2010 (53) 2011 (49) 2012 (62) 2013 (66) 2014 (61) 2015 (46) 2016 (61) 2017 (68) 2018 (45) 2019 (17)
Publication types (Num. hits)
article(1003) book(1) incollection(33) inproceedings(925) phdthesis(14)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 1272 occurrences of 727 keywords

Results
Found 1976 publication records. Showing 1976 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
83Kai Kwong Lau, Mohan J. Kumar, N. R. Achuthan Parallel implementation of branch and bound algorithm for solving vehicle routing problem on NOWs. Search on Bibsonomy ISPAN The full citation details ... 1997 DBLP  DOI  BibTeX  RDF parallel branch and bound, super-linear speedup, real time, load balancing, optimisation, Networks of Workstations, vehicle routing problem, VRP, operations research, operational research, branch and bound algorithm
77Zi Li, Yueming Cai Maximum-likelihood detection based on branch and bound algorithm for MIMO systems. Search on Bibsonomy Science in China Series F: Information Sciences The full citation details ... 2008 DBLP  DOI  BibTeX  RDF active set, branch and bound, detection, Cholesky factorization, multiple-input multiple-output (MIMO), dual
77Stefan Tschöke, Reinhard Lüling, Burkhard Monien Solving the traveling salesman problem with a distributed branch-and-bound algorithm on a 1024 processor network. Search on Bibsonomy IPPS The full citation details ... 1995 DBLP  DOI  BibTeX  RDF distributed branch-and-bound algorithm, 1024 processor network, 1-tree relaxation, direct-neighbor dynamic load-balancing strategy, parallel algorithms, parallelization, travelling salesman problems, travelling salesman problem, massively parallel computer, sequential algorithm
74Dominique Quadri, Éric Soutif, Pierre Tolla A Branch-and-Bound Algorithm to Solve Large Scale Integer Quadratic Multi-Knapsack Problems. Search on Bibsonomy SOFSEM (1) The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
68Krzysztof Walkowiak Branch-and-Bound Algorithm for Anycast Flow Assignment in Connection-Oriented Networks. Search on Bibsonomy ICCSA (3) The full citation details ... 2007 DBLP  DOI  BibTeX  RDF branch-and-bound, anycast, connection-oriented network
65Samuel Burer, Dieter Vandenbussche A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations. Search on Bibsonomy Math. Program. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Nonconcave quadratic maximization, Nonconvex quadratic programming, Lift-and-project relaxations, Branch-and-bound, Semidefinite programming
64Satoshi Fujita, Masayuki Masukawa, Shigeaki Tagashira A Fast Branch-and-Bound Algorithm with an Improved Lower Bound for Solving the Multiprocessor Scheduling Problem. Search on Bibsonomy ICPADS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF lower bound on the execution time, quadratic algorithm, Branch-and-bound algorithm, multiprocessor scheduling problem
62Michèle Dion, Marc Gengler, Stéphane Ubéda Comparing two Probabilistic Models of the Computational Complexity of the Branch and Bound Algorithm. Search on Bibsonomy CONPAR The full citation details ... 1994 DBLP  DOI  BibTeX  RDF modelization, complexity, parallel computing, combinatorial optimization, Branch and bound algorithm
62Toshihide Ibaraki The Power of Dominance Relations in Branch-and-Bound Algorithms. Search on Bibsonomy J. ACM The full citation details ... 1977 DBLP  DOI  BibTeX  RDF
60Isabel Dorta, Coromoto León, Casiano Rodríguez A Comparison between MPI and OpenMP Branch-and-Bound Skeletons. Search on Bibsonomy IPDPS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF MPI, Skeletons, Branch and Bound, OpenMP
59Torsten Fahle Simple and Fast: Improving a Branch-And-Bound Algorithm for Maximum Clique. Search on Bibsonomy ESA The full citation details ... 2002 DBLP  DOI  BibTeX  RDF branch-and-bound, constraint programming, maximum clique, cost based filtering
59Chee Fen Yu, Benjamin W. Wah Efficient Branch-and-Bound Algorithms on a Two-Level Memory System. Search on Bibsonomy IEEE Trans. Software Eng. The full citation details ... 1988 DBLP  DOI  BibTeX  RDF two-level memory system, storage management, virtual-memory, storage allocation, depth-first search, branch-and-bound algorithms, virtual storage, best-first search
59Christian Artigues, Dominique Feillet A branch and bound method for the job-shop problem with sequence-dependent setup times. Search on Bibsonomy Annals OR The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Dynamic programming, Branch and bound, Constraint propagation, Job-shop scheduling, Sequence-dependent setup times
59Vincent T'Kindt, Federico Della Croce, Carl Esswein Revisiting Branch and Bound Search Strategies for Machine Scheduling Problems. Search on Bibsonomy J. Scheduling The full citation details ... 2004 DBLP  DOI  BibTeX  RDF search tree strategies, dominance properties, branch and bound
59N. R. Achuthan, A. Hardjawidjaja Project Scheduling under Time Dependent Costs - A Branch and Bound Algorithm. Search on Bibsonomy Annals OR The full citation details ... 2001 DBLP  DOI  BibTeX  RDF project compression, branch and bound, project scheduling
57Rafael Andrade, Abdel Lisser, Nelson Maculan, Gérard Plateau B&B Frameworks for the Capacity Expansion of High Speed Telecommunication Networks Under Uncertainty. Search on Bibsonomy Annals OR The full citation details ... 2005 DBLP  DOI  BibTeX  RDF stochastic integer programming, integer L-shaped decomposition, branch and bound, network design
56Satoshi Fujita, Masayuki Masukawa, Shigeaki Tagashira A Fast Branch-and-Bound Scheme for the Multiprocessor Scheduling Problem with Communication Time. Search on Bibsonomy ICPP Workshops The full citation details ... 2003 DBLP  DOI  BibTeX  RDF lower bound on the execution time, Branch-and-bound algorithm, communication time, multiprocessor scheduling problem
56Débora P. Ronconi A Branch-and-Bound Algorithm to Minimize the Makespan in a Flowshop with Blocking. Search on Bibsonomy Annals OR The full citation details ... 2005 DBLP  DOI  BibTeX  RDF lower bound, branch-and-bound, blocking, makespan, flowshop
56Jan Jonsson, Kang G. Shin A Parametrized Branch-and-Bound Strategy for Scheduling Precedence-Constrained Tasks on a Multiprocessor System. Search on Bibsonomy ICPP The full citation details ... 1997 DBLP  DOI  BibTeX  RDF real-time scheduling precedence-constrained tasks, branch-and-bound strategy, multiprocessor systems, hard real-time systems
53Torsten Fahle, Karsten Tiemann A faster branch-and-bound algorithm for the test-cover problem based on set-covering techniques. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2006 DBLP  DOI  BibTeX  RDF test-cover problem, variable fixing, Branch-and-bound, Lagrangian relaxation, set-cover problem
53Thomas M. Breuel A Comparison of Search Strategies for Geometric Branch and Bound Algorithms. Search on Bibsonomy ECCV (3) The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
53Martin Paluszewski, Pawel Winter Protein Decoy Generation Using Branch and Bound with Efficient Bounding. Search on Bibsonomy WABI The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
53Yuji Shinano, Kenichi Harada, Ryuichi Hirabayashi Control Schemes in a Generalized Utility for Parallel Branch-and-Bound Algorithms. Search on Bibsonomy IPPS The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
53Boris Goldengorin, Diptesh Ghosh, Gerard Sierksma Improving the Efficiency of Branch and Bound Algorithms for the Simple Plant Location Problem. Search on Bibsonomy Algorithm Engineering The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
51Zhi-Long Chen Simultaneous Job Scheduling and Resource Allocation on Parallel Machines. Search on Bibsonomy Annals OR The full citation details ... 2004 DBLP  DOI  BibTeX  RDF resource allocation, branch and bound, column generation, production scheduling
51Martin Pelikan, Helmut G. Katzgraber, Sigismund Kobe Finding ground states of Sherrington-Kirkpatrick spin glasses with hierarchical boa and genetic algorithms. Search on Bibsonomy GECCO The full citation details ... 2008 DBLP  DOI  BibTeX  RDF hBOA, sherrington-kirkpatrick spin glass, sk spin glass, genetic algorithm, evolutionary computation, branch and bound, estimation of distribution algorithms, EDA, hierarchical boa
50Jeff Linderoth A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs. Search on Bibsonomy Math. Program. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Nonconvex quadratic programming, Global optimization, Branch-and-bound, Convex envelope
50H. A. J. Crauwels, Chris N. Potts, Dirk Van Oudheusden, Luk N. Van Wassenhove Branch and Bound Algorithms for Single Machine Scheduling with Batching to Minimize the Number of Late Jobs. Search on Bibsonomy J. Scheduling The full citation details ... 2005 DBLP  DOI  BibTeX  RDF set-up time, scheduling, branch and bound, families, batches, single machine
50Zhaohui Fu, Sharad Malik Solving the minimum-cost satisfiability problem using SAT based branch-and-bound search. Search on Bibsonomy ICCAD The full citation details ... 2006 DBLP  DOI  BibTeX  RDF MinCostSAT, optimization, branch-and-bound, Boolean satisfiability
50Guo-Hui Lin, Dong Xu 0002, Zhi-Zhong Chen, Tao Jiang 0001, Jianjun Wen, Ying Xu 0001 An Efficient Branch-and-Bound Algorithm for the Assignment of Protein Backbone NMR Peaks. Search on Bibsonomy CSB The full citation details ... 2002 DBLP  DOI  BibTeX  RDF chemical shift, peak assignment, combinatorial technique, branch-and-bound, greedy algorithm, protein structure, bipartite matching, NMR
50Myung K. Yang, Chita R. Das A Parallel Optimal Branch-and-Bound Algorithm for MIN-Based Multiprocessors. Search on Bibsonomy ICPP The full citation details ... 1999 DBLP  DOI  BibTeX  RDF MIN-based multiprocessor systems, Simulation, Analysis, Computation time, Branch-and-Bound algorithm, Communication time
50Mohand-Said Mezmaz, Nouredine Melab, El-Ghazali Talbi A Grid-based Parallel Approach of the Multi-Objective Branch and Bound. Search on Bibsonomy PDP The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Grid Computing, Multi-Objective Optimization, Branch and Bound
50Byeungwoo Jeon, David A. Landgrebe Fast Parzen Density Estimation Using Clustering-Based Branch and Bound. Search on Bibsonomy IEEE Trans. Pattern Anal. Mach. Intell. The full citation details ... 1994 DBLP  DOI  BibTeX  RDF fast Parzen density estimation, clustering-based branch and bound, nonparametric discriminant analysis, multivariant case, data reduction technique, pattern recognition, estimation theory, kernel functions, nonparametric statistics, computational load, data samples
50Francis Sourd, Safia Kedad-Sidhoum A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem. Search on Bibsonomy J. Scheduling The full citation details ... 2008 DBLP  DOI  BibTeX  RDF One-machine scheduling, Earliness-tardiness, Branch-and-bound, Lagrangean relaxation
50Antanas Zilinskas, Julius Zilinskas Branch and bound algorithm for multidimensional scaling with city-block metric. Search on Bibsonomy J. Global Optimization The full citation details ... 2009 DBLP  DOI  BibTeX  RDF City-block metric, Branch and bound, Multidimensional scaling
50Gintaras Palubeckis A Heuristic-Based Branch and Bound Algorithm for Unconstrained Quadratic Zero One Programming. Search on Bibsonomy Computing The full citation details ... 1995 DBLP  DOI  BibTeX  RDF Integer quadratic programming, graphs, branch and bound
50F. Körner An efficient branch and bound algorithm to solve the quadratic integer programming problem. Search on Bibsonomy Computing The full citation details ... 1983 DBLP  DOI  BibTeX  RDF Integer quadratic programming, branch and bound
48Benjamin W. Wah, Y. W. Eva Ma MANIP - A Multicomputer Architecture for Solving Combinatorial Extremum-Search Problems. Search on Bibsonomy IEEE Trans. Computers The full citation details ... 1984 DBLP  DOI  BibTeX  RDF Approximate branch-and-bound, parallel branch-and-bound, vertex-covering problem, selection, virtual memory, NP-hard problems, ring network
48Zaichen Qian, Evangeline F. Y. Young Multi-voltage floorplan design with optimal voltage assignment. Search on Bibsonomy ISPD The full citation details ... 2009 DBLP  DOI  BibTeX  RDF multi-voltage assignment optimization branch-and-bound
48Teresa Alsinet, Felip Manyà, Jordi Planes A Max-SAT Solver with Lazy Data Structures. Search on Bibsonomy IBERAMIA The full citation details ... 2004 DBLP  DOI  BibTeX  RDF data structures, heuristics, lower bound, branch and bound, Max-SAT
47Lung Chiang Wu, Harry K. Edwards A mixed integer mathematical programming model solution using branch and bound techniques (abstract only). Search on Bibsonomy ACM Conference on Computer Science The full citation details ... 1987 DBLP  DOI  BibTeX  RDF
47Cédric Pessan, Jean-Louis Bouquard, Emmanuel Néron Genetic Branch-and-Bound or Exact Genetic Algorithm?. Search on Bibsonomy Artificial Evolution The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
45Kun-Ming Yu, Jiayi Zhou, Chun-Yuan Lin, Chuan Yi Tang An Efficient Parallel Algorithm for Ultrametric Tree Construction Based on 3PR. Search on Bibsonomy ISPA Workshops The full citation details ... 2006 DBLP  DOI  BibTeX  RDF minimum ultrametric tree, parallel branch-and-bound algorithm, 3-point relationship, 4-point relationship, phylogenetic tree
45Dominique Quadri, Éric Soutif, Pierre Tolla Exact solution method to solve large scale integer quadratic multidimensional knapsack problems. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Separable quadratic function, Surrogate relaxation, Integer programming, Branch-and-bound, Linearization
45Alberto Ceselli Two exact algorithms for the capacitated p-median problem. Search on Bibsonomy 4OR The full citation details ... 2003 DBLP  DOI  BibTeX  RDF branch and bound, column generation, Lagrangean relaxation, Location theory
44Shinichi Morishita, Akihiro Nakaya Parallel Branch-and-Bound Graph Search for Correlated Association Rules. Search on Bibsonomy Large-Scale Parallel Data Mining The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
44Martin Röder, Jean Cardinal, Raouf Hamzaoui Branch and bound algorithms for rate-distortion optimized media streaming. Search on Bibsonomy IEEE Trans. Multimedia The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
44Andries Stam A Framework for Coordinating Parallel Branch and Bound Algorithms. Search on Bibsonomy COORDINATION The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
42Daniel Keysers, Thomas M. Breuel Optimal Line and Arc Detection on Run-Length Representations. Search on Bibsonomy GREC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Line Drawings, Graphics Recognition, Branch-and-Bound algorithms, Technical Drawings
42Malek Mouhoub, Samira Sadaoui Systematic versus Non-systematic Methods for Solving Incremental Satisfiability. Search on Bibsonomy IEA/AIE The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Genetic Algorithms, Local Search, Branch and Bound, Propositional Satisfiability
42Mario Vanhoucke, Erik Demeulemeester, Willy Herroelen An Exact Procedure for the Resource-Constrained Weighted Earliness-Tardiness Project Scheduling Problem. Search on Bibsonomy Annals OR The full citation details ... 2001 DBLP  DOI  BibTeX  RDF weighted earliness-tardinesss costs, branch-and-bound, resource-constrained project scheduling
42Jun Han, Zhaohao Sun, Jinpeng Huai, Xian Li An Efficient Node Partitioning Algorithm for the Capacitated Minimum Spanning Tree Problem. Search on Bibsonomy ACIS-ICIS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Partition, Branch and bound, Pruning, Search tree, Neighborhood search
42Joachim Biskup, Lena Wiese On Finding an Inference-Proof Complete Database for Controlled Query Evaluation. (PDF / PS) Search on Bibsonomy DBSec The full citation details ... 2006 DBLP  DOI  BibTeX  RDF confidentiality of data, complete database systems, Branch and Bound, propositional logic, inference control, SAT solving, lying, Controlled Query Evaluation
42Baudoin Collard, François-Xavier Standaert, Jean-Jacques Quisquater Improved and Multiple Linear Cryptanalysis of Reduced Round Serpent. Search on Bibsonomy Inscrypt The full citation details ... 2007 DBLP  DOI  BibTeX  RDF multiple linear cryptanalysis, Advanced Encryption Standard, branch-and-bound, linear cryptanalysis, linear approximations, Serpent
42Jean-Louis Bouquard, Christophe Lenté Two-machine flow shop scheduling problems with minimal and maximal delays. Search on Bibsonomy 4OR The full citation details ... 2006 DBLP  DOI  BibTeX  RDF branch-and-bound procedure, Flow shop, Max-Plus algebra
42Mohand-Said Mezmaz, Nouredine Melab, El-Ghazali Talbi Towards a Coordination Model for Parallel Cooperative P2P Multi-objective Optimization. Search on Bibsonomy EGC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Parallelism and Coordination, Multi- objective Optimization, Branch-and-Bound, Flow-Shop, P2P Computing
42Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang Approximation and Exact Algorithms for Constructing Minimum Ultrametric Trees from Distance Matrices. Search on Bibsonomy COCOON The full citation details ... 1998 DBLP  DOI  BibTeX  RDF ultrametric trees, approximation algorithms, branch and bound, computational biology
42Eun Hye Choi, Tatsuhiro Tsuchiya, Tohru Kikuno Optimal k-Coteries That Maximize Availability in General Networks. Search on Bibsonomy ICOIN (2) The full citation details ... 2002 DBLP  DOI  BibTeX  RDF k-mutual exclusion, k-coterie, availability, branch-and-bound, combinatorial optimization problem
42Dragos Cvetkovic, Mirjana Cangalovic, Vera Kovacevic-Vujcic Semidefinite Programming Methods for the Symmetric Traveling Salesman Problem. Search on Bibsonomy IPCO The full citation details ... 1999 DBLP  DOI  BibTeX  RDF Traveling salesman problem, Semidefinite programming, Branch-and-bound methods
42Michael O. Neary, Peter R. Cappello Internet-Based TSP Computation with Javelin++. Search on Bibsonomy ICPP Workshops The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
42Gio K. Kao, Edward C. Sewell, Sheldon H. Jacobson A branch, bound, and remember algorithm for the 1| r i | Sigma t i scheduling problem. Search on Bibsonomy J. Scheduling The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Scheduling theory and algorithms, Dynamic programming, Branch and bound algorithms
42Ernst Althaus, Tobias Baumann, Elmar Schömer, Kai Werth Trunk Packing Revisited. Search on Bibsonomy WEA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF branch and cut algorithms, weighted independent set, approximation algorithms, linear programming, graph algorithms, branch and bound algorithms, packing problems
41Brian Borchers MINLP: Branch and Bound Methods. Search on Bibsonomy Encyclopedia of Optimization The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Branch and bound, Mixed integer programming, MINLP
41Eva K. Lee, John E. Mitchell 0001 Integer Programming: Branch and Bound Methods. Search on Bibsonomy Encyclopedia of Optimization The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Integer program, Branch and bound, Exact algorithms
41Tibor Csendes Interval Analysis: Subdivision Directions in Interval Branch and Bound Methods. Search on Bibsonomy Encyclopedia of Optimization The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Subdivision direction, Optimization, Branch-and-bound, Interval arithmetic
41Ioannis P. Androulakis MINLP: Branch and Bound Global Optimization Algorithm. Search on Bibsonomy Encyclopedia of Optimization The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Global optimization, Branch and bound algorithms, Mixed integer nonlinear programming
41Jakob Puchinger, Peter J. Stuckey Automating branch-and-bound for dynamic programs. Search on Bibsonomy PEPM The full citation details ... 2008 DBLP  DOI  BibTeX  RDF dynamic programming, branch and bound, automatic transformation
41A. Djerrah, Bertrand Le Cun, Van-Dat Cung, Catherine Roucairol Bob++: Framework for Solving Optimization Problems with Branch-and-Bound methods. Search on Bibsonomy HPDC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF INRIA Apache project, Bob++ framework, optimization problem solving, sequential search algorithm, parallel search algorithm, SMP machines, global priority queue, sequential data structure encapsulation, Bob++ library, Athapascan parallel programming interface, C++ library, dynamic programming, sequential machines, cluster architecture, branch-and-bound method, divide-and-conquer method, grid architecture, load balancing strategy
41Shabbir Ahmed, Mohit Tawarmalani, Nikolaos V. Sahinidis A finite branch-and-bound algorithm for two-stage stochastic integer programs. Search on Bibsonomy Math. Program. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF stochastic integer programming, finite algorithms, branch-and-bound
41Rica Gonen, Daniel J. Lehmann Optimal solutions for multi-unit combinatorial auctions: branch and bound heuristics. Search on Bibsonomy EC The full citation details ... 2000 DBLP  DOI  BibTeX  RDF branch and bound, combinatorial auctions
41Myung K. Yang, Chita R. Das Evaluation of a Parallel Branch-and-Bound Algorithm on a Class of Multiprocessors. Search on Bibsonomy IEEE Trans. Parallel Distrib. Syst. The full citation details ... 1994 DBLP  DOI  BibTeX  RDF parallel branch-and-bound algorithm, MIN-based multiprocessorsystems, serial best-first search, conflict-free mapping scheme, performance evaluation, parallel algorithms, multiprocessor interconnection networks, multiprocessing systems, probabilistic model, communication overheads, computation overheads
41Patrenahalli M. Narendra, Keinosuke Fukunaga A Branch and Bound Algorithm for Feature Subset Selection. Search on Bibsonomy IEEE Trans. Computers The full citation details ... 1977 DBLP  DOI  BibTeX  RDF feature selection, combinatorial optimization, Branch and bound, recursive computation
41Warren L. G. Koontz, Patrenahalli M. Narendra, Keinosuke Fukunaga A Branch and Bound Clustering Algorithm. Search on Bibsonomy IEEE Trans. Computers The full citation details ... 1975 DBLP  DOI  BibTeX  RDF clustering, pattern recognition, combinatorial optimization, Branch and bound
41Keinosuke Fukunaga, Patrenahalli M. Narendra A Branch and Bound Algorithms for Computing k-nearest Neighbors. Search on Bibsonomy IEEE Trans. Computers The full citation details ... 1975 DBLP  DOI  BibTeX  RDF tree-search algorithm, Branch and bound, k-nearest neighbors, hierarchical decomposition, distance computation
39Alessandro Agnetis, Gianluca de Pascale, Dario Pacciarelli A Lagrangian approach to single-machine scheduling problems with two competing agents. Search on Bibsonomy J. Scheduling The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Multi-agent scheduling, Branch-and-bound, Lagrangian relaxation, Single-machine scheduling
39C. D. Randazzo, Henrique Pacca Loureiro Luna A Comparison of Optimal Methods for Local Access Uncapacitated Network Design. Search on Bibsonomy Annals OR The full citation details ... 2001 DBLP  DOI  BibTeX  RDF branch-and-bound, network design, branch-and-cut, Benders decomposition
39Chao-Yang Gau, Mark A. Stadtherr Parallel interval-Newton using message passing: dynamic load balancing strategies. Search on Bibsonomy SC The full citation details ... 2001 DBLP  DOI  BibTeX  RDF branch-and-prune, parallel computing, global optimization, branch-and-bound, interval analysis, nonlinear equations
39Myun-Seok Cheon, Shabbir Ahmed, Faiz A. Al-Khayyal A branch-reduce-cut algorithm for the global optimization of probabilistically constrained linear programs. Search on Bibsonomy Math. Program. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Probabilistically Constrained Linear Programs, Chance Constrained Programs, Global Optimization, Branch-and-bound
39Ted K. Ralphs, Laszlo Ladányi, Matthew J. Saltzman A Library Hierarchy for Implementing Scalable Parallel Search Algorithms. Search on Bibsonomy The Journal of Supercomputing The full citation details ... 2004 DBLP  DOI  BibTeX  RDF parallel branch and bound, optimization, parallel algorithm, integer programming, parallel search
39Giorgio Carpaneto, Mauro Dell'Amico, Paolo Toth Exact Solution of Large Scale Asymmetric Travelling Salesman Problems. Search on Bibsonomy ACM Trans. Math. Softw. The full citation details ... 1995 DBLP  DOI  BibTeX  RDF reduction procedure, subtour elimination, branch and bound, assignment problem, asymmetric traveling salesman problem
39Chu Min Li, Felip Manyà, Jordi Planes Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers. Search on Bibsonomy CP The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
38Sanjay Jain Branch and Bound on the Network Model. Search on Bibsonomy FSTTCS The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
38Mathias Stolpe, Atsushi Kawamoto Design of planar articulated mechanisms using branch and bound. Search on Bibsonomy Math. Program. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000): 74P10, 70B15, 90C90
36Ronald Armstrong, Su Gao, Lei Lei A zero-inventory production and distribution problem with a fixed customer sequence. Search on Bibsonomy Annals OR The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Zero-inventory production and distribution problem, Product lifespan, Branch and bound search procedure, Heuristic lower bound, Time windows
36Jaroslav Janácek, Lubos Buzna An acceleration of Erlenkotter-Körkel's algorithms for the uncapacitated facility location problem. Search on Bibsonomy Annals OR The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Uncapacitated facility location problem, Dual ascent algorithm, DualLoc, PDLoc, Branch and bound
36Qian Wang, Rajan Batta, Christopher M. Rump Algorithms for a Facility Location Problem with Stochastic Customer Demand and Immobile Servers. Search on Bibsonomy Annals OR The full citation details ... 2002 DBLP  DOI  BibTeX  RDF heuristics, tabu search, branch and bound, queueing, facility location
36Alain Billionnet, Marie-Christine Costa, Alain Sutter An Efficient Algorithm for a Task Allocation Problem. Search on Bibsonomy J. ACM The full citation details ... 1992 DBLP  DOI  BibTeX  RDF quadratic 0-1 optimization, task allocation, interprocessor communication, branch-and-bound algorithm, Lagrangean relaxation
36Teresa Alsinet, Felip Manyà, Jordi Planes An efficient solver for weighted Max-SAT. Search on Bibsonomy J. Global Optimization The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Weighted Branch and bound, Data structures, Heuristics, Lower bound, Max-SAT
36R. N. Uma, Joel Wein On the Relationship Between Combinatorial and LP-Based Approaches to NP-Hard Scheduling Problems. Search on Bibsonomy IPCO The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
36Ernst Althaus, Stefan Canzar A Lagrangian relaxation approach for the multiple sequence alignment problem. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Branch and bound, Lagrangian relaxation, Sequence comparison
36Wen-Lin Yang Solving the MCOP Problem Optimally. Search on Bibsonomy LCN The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
35Radu Marinescu 0002, Rina Dechter AND/OR Branch-and-Bound Search for Pure 0/1 Integer Linear Programming Problems. Search on Bibsonomy CPAIOR The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
35Isabel Dorta, Coromoto León, Casiano Rodríguez A comparison between MPI and OpenMP Branch-and-Bound Skeletons. Search on Bibsonomy HIPS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
35Evguenii I. Goldberg, Luca P. Carloni, Tiziano Villa, Robert K. Brayton, Alberto L. Sangiovanni-Vincentelli Negative thinking in branch-and-bound: the case of unate covering. Search on Bibsonomy IEEE Trans. on CAD of Integrated Circuits and Systems The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
35Paul Helman A common schema for dynamic programming and branch and bound algorithms. Search on Bibsonomy J. ACM The full citation details ... 1989 DBLP  DOI  BibTeX  RDF
35Javier Larrosa, Robert Nieuwenhuis, Albert Oliveras, Enric Rodríguez-Carbonell Branch and Bound for Boolean Optimization and the Generation of Optimality Certificates. Search on Bibsonomy SAT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
35Ninad Thakoor, Jean Gao, Venkat Devarajan Multistage Branch-and-Bound Merging for Planar Surface Segmentation in Disparity Space. Search on Bibsonomy IEEE Trans. Image Processing The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
35Paul Horton Tsukuba BB: A Branch and Bound Algorithm for Local Multiple Sequence Alignment. Search on Bibsonomy CPM The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
35Vasco M. Manquinho, João P. Marques Silva Search pruning techniques in SAT-based branch-and-bound algorithmsfor the binate covering problem. Search on Bibsonomy IEEE Trans. on CAD of Integrated Circuits and Systems The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
35Jonathan Eckstein Control strategies for parallel mixed integer branch and bound. Search on Bibsonomy SC The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 1976 (100 per page; Change: )
Pages: [1][2][3][4][5][6][7][8][9][10][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license