Search results for "branch and bound algorithms"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
3	Chee Fen Yu, Benjamin W. Wah	Efficient Branch-and-Bound Algorithms on a Two-Level Memory System.	IEEE Trans. Software Eng.	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
2	Martin Röder, Jean Cardinal, Raouf Hamzaoui	Branch and bound algorithms for rate-distortion optimized media streaming.	IEEE Transactions on Multimedia	2006	DBLP DOI BibTeX RDF
2	H. 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.	J. Scheduling	2005	DBLP DOI BibTeX RDF	set-up time, scheduling, branch and bound, families, batches, single machine
2	Randi Moe, Tor Sørevik	Parallel Branch and Bound Algorithms on Internet Connected Workstations.	HPCC	2005	DBLP DOI BibTeX RDF
2	Daniel Keysers, Thomas M. Breuel	Optimal Line and Arc Detection on Run-Length Representations.	GREC	2005	DBLP DOI BibTeX RDF	Line Drawings, Graphics Recognition, Branch-and-Bound algorithms, Technical Drawings
2	Jordi Planes	Improved Branch and Bound Algorithms for Max-2-SAT and Weighted Max-2-SAT.	CP	2003	DBLP DOI BibTeX RDF
2	Koen M. J. De Bontridder, B. J. Lageweg, Jan Karel Lenstra, James B. Orlin, Leen Stougie	Branch-and-Bound Algorithms for the Test Cover Problem.	ESA	2002	DBLP DOI BibTeX RDF
2	Andries Stam	A Framework for Coordinating Parallel Branch and Bound Algorithms.	COORDINATION	2002	DBLP DOI BibTeX RDF
2	Thomas M. Breuel	A Comparison of Search Strategies for Geometric Branch and Bound Algorithms.	ECCV	2002	DBLP DOI BibTeX RDF
2	Boris Goldengorin, Diptesh Ghosh, Gerard Sierksma	Improving the Efficiency of Branch and Bound Algorithms for the Simple Plant Location Problem.	Algorithm Engineering	2001	DBLP DOI BibTeX RDF
2	Yuji Shinano, Kenichi Harada, Ryuichi Hirabayashi	Control Schemes in a Generalized Utility for Parallel Branch-and-Bound Algorithms. (PDF / PS)	IPPS	1997	DBLP DOI BibTeX RDF
2	Paul Helman	A common schema for dynamic programming and branch and bound algorithms.	J. ACM	1989	DBLP DOI BibTeX RDF
2	Toshihide Ibaraki	The Power of Dominance Relations in Branch-and-Bound Algorithms.	J. ACM	1977	DBLP DOI BibTeX RDF
1	Renato Carmo, Alexandre P. Züge	Branch and bound algorithms for the maximum clique problem under a unified framework.	J. Braz. Comp. Soc.	2012	DBLP DOI BibTeX RDF
1	Remco Germs, Boris Goldengorin, Marcel Turkensteen	Lower tolerance-based Branch and Bound algorithms for the ATSP.	Computers & OR	2012	DBLP DOI BibTeX RDF
1	Mohammad Ranjbar, Morteza Davari, Roel Leus	Two branch-and-bound algorithms for the robust parallel machine scheduling problem.	Computers & OR	2012	DBLP DOI BibTeX RDF
1	Luidi Simonetti, Fábio Protti, Yuri Frota, Cid C. de Souza	New branch-and-bound algorithms for k-cardinality tree problems.	Electronic Notes in Discrete Mathematics	2011	DBLP DOI BibTeX RDF
1	Jordan Ninin, Frédéric Messine	A metaheuristic methodology based on the limitation of the memory of interval branch and bound algorithms.	J. Global Optimization	2011	DBLP DOI BibTeX RDF
1	J. F. Sanjuan-Estrada, Leocadio G. Casado, Inmaculada García	Adaptive parallel interval branch and bound algorithms based on their performance for multicore architectures.	The Journal of Supercomputing	2011	DBLP DOI BibTeX RDF
1	Toshihide Ibaraki, Takashi Imamichi, Yuichi Koga, Hiroshi Nagamochi, Koji Nonobe, Mutsunori Yagiura	Efficient branch-and-bound algorithms for weighted MAX-2-SAT.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Stefano Mor, Nicolas Maillard	Dynamic workload balancing deques for branch and bound algorithms in the message passing interface.	IJHPSA	2011	DBLP DOI BibTeX RDF
1	Hongbo Ren, Weisheng Zhou, Weijun Gao, Qiong Wu	A Mixed-Integer Linear Optimization Model for Local Energy System Planning Based on Simplex and Branch-and-Bound Algorithms.	LSMS/ICSEE	2010	DBLP DOI BibTeX RDF
1	Alper Atamtürk, Vishnu Narayanan	Conic mixed-integer rounding cuts.	Math. Program.	2010	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 90C11, 90C25, 90C57
1	Sang-Oh Shim	Generating subproblems in branch and bound algorithms for parallel machines scheduling problem.	Computers & Industrial Engineering	2009	DBLP DOI BibTeX RDF
1	N. Madhushini, Chandrasekharan Rajendran, Y. Deepa	Branch-and-bound algorithms for scheduling in permutation flowshops to minimize the sum of weighted flowtime/sum of weighted tardiness/sum of weighted flowtime and weighted tardiness/sum of weighted flowtime, weighted tardiness and weighted earliness of jobs.	JORS	2009	DBLP DOI BibTeX RDF
1	Ying Zhao, Jianpei Zhang, Jing Yang	Parallel Branch and Bound Algorithms on Semi-supervised SVMs.	DBTA	2009	DBLP DOI BibTeX RDF
1	Gio K. Kao, Edward C. Sewell, Sheldon H. Jacobson	A branch, bound, and remember algorithm for the 1\| r i \| Sigma t i scheduling problem.	J. Scheduling	2009	DBLP DOI BibTeX RDF	Scheduling theory and algorithms, Dynamic programming, Branch and bound algorithms
1	Ioannis P. Androulakis	MINLP: Branch and Bound Global Optimization Algorithm.	Encyclopedia of Optimization	2009	DBLP DOI BibTeX RDF	Global optimization, Branch and bound algorithms, Mixed integer nonlinear programming
1	Yuri Evtushenko, Mikhail Posypkin, Israel Sigal	A framework for parallel large-scale global optimization.	Computer Science - R&D	2009	DBLP DOI BibTeX RDF	Parallel global optimization, Nonlinear programming, knapsack problems, Heuristic methods, Branch-and-bound methods
1	Alessandro Agnetis, Gianluca de Pascale, Dario Pacciarelli	A Lagrangian approach to single-machine scheduling problems with two competing agents.	J. Scheduling	2009	DBLP DOI BibTeX RDF	Multi-agent scheduling, Branch-and-bound, Lagrangian relaxation, Single-machine scheduling
1	Satoshi Taoka, Daisuke Takafuji, Toshimasa Watanabe	Enhancing PC Cluster-Based Parallel Branch-and-Bound Algorithms for the Graph Coloring Problem.	IEICE Transactions	2008	DBLP DOI BibTeX RDF
1	Marcel Turkensteen, Diptesh Ghosh, Boris Goldengorin, Gerard Sierksma	Tolerance-based Branch and Bound algorithms for the ATSP.	European Journal of Operational Research	2008	DBLP DOI BibTeX RDF
1	Louise Leenen, Aditya Ghose	Branch and Bound Algorithms to Solve Semiring Constraint Satisfaction Problems.	PRICAI	2008	DBLP DOI BibTeX RDF
1	Alexandre Goldsztejn, Yahia Lebbah, Claude Michel, Michel Rueher	Revisiting the Upper Bounding Process in a Safe Branch and Bound Algorithm.	CP	2008	DBLP DOI BibTeX RDF
1	João Marques-Silva, Vasco M. Manquinho	Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms.	SAT	2008	DBLP DOI BibTeX RDF
1	Jaroslav Janácek, Lubos Buzna	An acceleration of Erlenkotter-Körkel's algorithms for the uncapacitated facility location problem.	Annals OR	2008	DBLP DOI BibTeX RDF	Uncapacitated facility location problem, Dual ascent algorithm, DualLoc, PDLoc, Branch and bound
1	Andrés Cano, Manuel Gómez, Serafín Moral, Joaquín Abellán	Hill-climbing and branch-and-bound algorithms for exact and approximate inference in credal networks.	Int. J. Approx. Reasoning	2007	DBLP DOI BibTeX RDF
1	Jaime Davila, Sudha Balla, Sanguthevar Rajasekaran	Fast and Practical Algorithms for Planted (l, d) Motif Search.	IEEE/ACM Trans. Comput. Biology Bioinform.	2007	DBLP DOI BibTeX RDF	Planted motif search problem, challenging instances, exact algorithms, branch and bound algorithms
1	Ernst Althaus, Tobias Baumann, Elmar Schömer, Kai Werth	Trunk Packing Revisited.	WEA	2007	DBLP DOI BibTeX RDF	branch and cut algorithms, weighted independent set, approximation algorithms, linear programming, graph algorithms, branch and bound algorithms, packing problems
1	Ana Graça, João Marques-Silva, Inês Lynce, Arlindo L. Oliveira	Efficient Haplotype Inference with Pseudo-boolean Optimization.	AB	2007	DBLP DOI BibTeX RDF	pure parsimony, pseudo-Boolean optimization, haplotype inference
1	Yong-Ming Wang, Nan-Feng Xiao, Hong-Li Yin, En-Liang Hu	A Novel Heuristic Approach for Job Shop Scheduling Problem.	FAW	2007	DBLP DOI BibTeX RDF	Heuristic algorithm, Job shop scheduling, Production scheduling, Simulated annealing algorithm
1	Alper Atamtürk, Vishnu Narayanan	Cuts for Conic Mixed-Integer Programming.	IPCO	2007	DBLP DOI BibTeX RDF	Integer programming, branch-and-cut, conic programming
1	Yunpeng Pan, Leyuan Shi	Branch-and-bound algorithms for solving hard instances of the one-machine sequencing problem.	European Journal of Operational Research	2006	DBLP DOI BibTeX RDF
1	Torsten Fahle, Karsten Tiemann	A faster branch-and-bound algorithm for the test-cover problem based on set-covering techniques.	ACM Journal of Experimental Algorithmics	2006	DBLP DOI BibTeX RDF	test-cover problem, variable fixing, Branch-and-bound, Lagrangian relaxation, set-cover problem
1	Isabel Dorta, Coromoto León, Casiano Rodríguez	Performance Analysis of Branch-and-Bound Skeletons.	PDP	2006	DBLP DOI BibTeX RDF
1	Christoph Buchheim, Lanbo Zheng	Fixed Linear Crossing Minimization by Reduction to the Maximum Cut Problem.	COCOON	2006	DBLP DOI BibTeX RDF
1	Josep Argelich, Felip Manyà	Exact Max-SAT solvers for over-constrained problems.	J. Heuristics	2006	DBLP DOI BibTeX RDF	Soft constraints, Solvers, Max-SAT
1	Mihály Csaba Markót, J. Fernández, Leocadio G. Casado, Tibor Csendes	New interval methods for constrained global optimization.	Math. Program.	2006	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 65G10, 90B85, 90C30, 65K05
1	Simon Dunstall, Andrew Wirth	A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines.	European Journal of Operational Research	2005	DBLP DOI BibTeX RDF
1	Dimitris Papadias, Yufei Tao, Greg Fu, Bernhard Seeger	Progressive skyline computation in database systems.	ACM Trans. Database Syst.	2005	DBLP DOI BibTeX RDF	branch-and-bound algorithms, Skyline query, multidimensional access methods
1	Abraham Bachrach, Kevin Chen, Chris Harrelson, Radu Mihaescu, Satish Rao, Apurva Shah	Lower Bounds for Maximum Parsimony with Gene Order Data.	Comparative Genomics	2005	DBLP DOI BibTeX RDF
1	Josep Argelich, Felip Manyà	Solving Over-Constrained Problems with SAT Technology.	SAT	2005	DBLP DOI BibTeX RDF
1	Elias Frentzos, Kostas Gratsias, Nikos Pelekis, Yannis Theodoridis	Nearest Neighbor Search on Moving Object Trajectories.	SSTD	2005	DBLP DOI BibTeX RDF
1	Torsten Fahle, Karsten Tiemann	An Improved Branch-and-Bound Algorithm for the Test Cover Problem.	WEA	2005	DBLP DOI BibTeX RDF
1	Glencora Borradaile, Pascal Van Hentenryck	Safe and tight linear estimators for global optimization.	Math. Program.	2005	DBLP DOI BibTeX RDF
1	Ph. Mauguière, Jean-Charles Billaut, Jean-Louis Bouquard	New Single Machine and Job-Shop Scheduling Problems with Availability Constraints.	J. Scheduling	2005	DBLP DOI BibTeX RDF	unavailability constraints, scheduling, branch-and-bound, job-shop, single machine
1	Antonio Corral, Yannis Manolopoulos, Yannis Theodoridis, Michael Vassilakopoulos	Multi-Way Distance Join Queries in Spatial Databases.	GeoInformatica	2004	DBLP DOI BibTeX RDF	distance join queries, spatial databases, R-trees, branch-and-bound algorithms, approximate techniques
1	Martin Röder, Jean Cardinal, Raouf Hamzaoui	On the Complexity of Rate-Distortion Optimal Streaming of Packetized Media.	Data Compression Conference	2004	DBLP DOI BibTeX RDF
1	Hsin-Fu Chen, Maw-Shang Chang	An Efficient Exact Algorithm for the Minimum Ultrametric Tree Problem.	ISAAC	2004	DBLP DOI BibTeX RDF
1	Vasco M. Manquinho, João P. Marques Silva	Satisfiability-Based Algorithms for Boolean Optimization.	Ann. Math. Artif. Intell.	2004	DBLP DOI BibTeX RDF	binate covering problem, non-chronological backtracking, branch-and-bound, backtrack search, propositional satisfiability
1	Vincent T'Kindt, Federico Della Croce, Carl Esswein	Revisiting Branch and Bound Search Strategies for Machine Scheduling Problems.	J. Scheduling	2004	DBLP DOI BibTeX RDF	search tree strategies, dominance properties, branch and bound
1	Ted K. Ralphs, Laszlo Ladányi, Matthew J. Saltzman	A Library Hierarchy for Implementing Scalable Parallel Search Algorithms.	The Journal of Supercomputing	2004	DBLP DOI BibTeX RDF	parallel branch and bound, optimization, parallel algorithm, integer programming, parallel search
1	Thomas M. Breuel	On the use of interval arithmetic in geometric branch and bound algorithms.	Pattern Recognition Letters	2003	DBLP DOI BibTeX RDF
1	José Carlos Ferreira da Rocha, Fabio Gagliardi Cozman	Inference in Credal Networks with Branch-and-Bound Algorithms.	ISIPTA	2003	DBLP BibTeX RDF
1	Minghe Sun	The transportation problem with exclusionary side constraints and two branch-and-bound algorithms.	European Journal of Operational Research	2002	DBLP DOI BibTeX RDF
1	Vasco M. Manquinho, João P. Marques Silva	Search pruning techniques in SAT-based branch-and-bound algorithmsfor the binate covering problem.	IEEE Trans. on CAD of Integrated Circuits and Systems	2002	DBLP DOI BibTeX RDF
1	Antonio Corral, Joaquín Cañadas, Michael Vassilakopoulos	Approximate Algorithms for Distance-Based Queries in High-Dimensional Data Spaces Using R-Trees.	ADBIS	2002	DBLP DOI BibTeX RDF
1	Antonio Corral, Michael Vassilakopoulos, Yannis Manolopoulos	The Impact of Buffering on Closest Pairs Queries Using R-Trees.	ADBIS	2001	DBLP DOI BibTeX RDF
1	Rina Dechter, Kalev Kask, Javier Larrosa	A General Scheme for Multiple Lower Bound Computation in Constraint Optimization.	CP	2001	DBLP DOI BibTeX RDF
1	Antonio Corral, Joaquín Cañadas, Michael Vassilakopoulos	Processing Distance-Based Queries in Multidimensional Data Spaces Using R-trees.	Panhellenic Conference on Informatics	2001	DBLP DOI BibTeX RDF
1	Gerd Behrmann, Ansgar Fehnker	Efficient Guiding Towards Cost-Optimality in UPPAAL.	TACAS	2001	DBLP DOI BibTeX RDF
1	Faiz A. Al-Khayyal, Hanif D. Sherali	On Finitely Terminating Branch-and-Bound Algorithms for Some Global Optimization Problems.	SIAM Journal on Optimization	2000	DBLP DOI BibTeX RDF
1	Avaneendra Gupta, John P. Hayes	CLIP: integer-programming-based optimal layout synthesis of 2D CMOS cells.	ACM Trans. Design Autom. Electr. Syst.	2000	DBLP DOI BibTeX RDF	CMOS networks, circuit clustering, diffusion sharing, leaf cell synthesis, transistor chains, two-dimensional layout, integer programming, integer linear programming, layout optimization, module generation
1	Matthew J. Realff, P. H. Kvam, W. E. Taylor	Combined analytical and empirical learning framework for branch and bound algorithms: the knapsack problem.	AI in Engineering	1999	DBLP DOI BibTeX RDF
1	Nihar R. Mahapatra, Douglas E. Covelli, Yuval Beres	A Quantitative Evaluation of Limited-Memory Branch-and-Bound Algorithms.	IC-AI	1999	DBLP BibTeX RDF
1	Jan Jonsson	Effective Complexity Reduction for Optimal Scheduling of Distributed Real-Time Applications.	ICDCS	1999	DBLP DOI BibTeX RDF	precedence-constrained tasks, task assignment and scheduling, multiprocessor systems, branch-and-bound algorithms, real-time constraints, complexity reduction
1	Ricardo C. Corrêa, Afonso Ferreira	A Polynomial-Time Branching Procedure for the Multiprocessor Scheduling Problem.	Euro-Par	1999	DBLP DOI BibTeX RDF
1	Matthew J. Realff, George Stephanopoulos	On the Application of Explanation-Based Learning to Acquire Control Knowledge for Branch and Bound Algorithms.	INFORMS Journal on Computing	1998	DBLP DOI BibTeX RDF
1	R. N. Uma, Joel Wein	On the Relationship Between Combinatorial and LP-Based Approaches to NP-Hard Scheduling Problems.	IPCO	1998	DBLP DOI BibTeX RDF
1	Jose Libano Alonso, H. Schmidt, Vassil N. Alexandrov	Parallel Branch and Bound Algorithms for Integer and Mixed Integer Linear Programming Problems under PVM.	PVM/MPI	1997	DBLP DOI BibTeX RDF
1	Cliff T. Ragsdale, Gerald W. Shapiro	Incumbent solutions in branch-and-bound algorithms: Setting the record straight.	Computers & OR	1996	DBLP DOI BibTeX RDF
1	Bernard Mans, Catherine Roucairol	Performances of Parallel Branch and Bound Algorithms with Best-first Search.	Discrete Applied Mathematics	1996	DBLP DOI BibTeX RDF
1	Yuji Shinano, Masahiro Higaki, Ryuichi Hirabayashi	An Interface Design for General Parallel Branch-and-Bound Algorithms.	IRREGULAR	1996	DBLP DOI BibTeX RDF
1	Ricardo C. Corrêa, Afonso Ferreira	On the Effectiveness of Synchronous Parallel Branch-and-Bound Algorithms.	Parallel Processing Letters	1995	DBLP BibTeX RDF
1	Beniamino Di Martino, Nicola Mazzocca, Stefano Russo	Paradigms for the Parallelization of Branch and Bound Algorithms.	PARA	1995	DBLP DOI BibTeX RDF
1	Ricardo C. Corrêa	A Parallel Formulatiion for General Branch-and-Bound Algorithms.	IRREGULAR	1995	DBLP DOI BibTeX RDF
1	Stefan Tschöke, Reinhard Lüling, Burkhard Monien	Solving the traveling salesman problem with a distributed branch-and-bound algorithm on a 1024 processor network. (PDF / PS)	IPPS	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
1	Jens Clausen, Jesper Larsson Träff	Do Inherently Sequential Branch-and-Bound Algorithms Exist?	Parallel Processing Letters	1994	DBLP BibTeX RDF
1	Subhada K. Mishra, Vijay V. Raghavan	Design Issues in Randomized Branch and Bound Algorithms: A Study of Graph Partitioning.	IFIP Congress	1994	DBLP BibTeX RDF
1	François Fages	On the Semantics of Optimization Predicates in CLP Languages.	FSTTCS	1993	DBLP DOI BibTeX RDF
1	Sabine R. Öhring, Sajal K. Das	Mapping Dynamic Data and Algorithm Structures into Product Networks.	ISAAC	1993	DBLP DOI BibTeX RDF	dynamic embedding, folded Petersen, hyper-de Bruijn, hyper Petersen, product-shuffle, grid, hypercube, tree, de Bruijn
1	Reinhard Lüling, Burkhard Monien	Load Balancing for Distributed Branch and Bound Algorithms.	IPPS	1992	DBLP BibTeX RDF
1	Michael J. Quinn	Analysis and Implementation of Branch-and Bound Algorithms on a Hypercube Multicomputer.	IEEE Trans. Computers	1990	DBLP DOI BibTeX RDF
1	José M. Troya, M. Ortega	A study of parallel branch-and-bound algorithms with best-bound-first search.	Parallel Computing	1989	DBLP DOI BibTeX RDF
1	V. Nageshwara Rao, Vipin Kumar	Superlinear Speedup in Parallel State-Space Search.	FSTTCS	1988	DBLP DOI BibTeX RDF
1	Oliver Vornberger	Fault Tolerant Parallelization of Branch-and-Bound Algorithms.	ICDCS	1987	DBLP BibTeX RDF
1	Ten-Hwang Lai, Alan P. Sprague	A Note on Anomalies in Parallel Branch-and-Bound Algorithms with One-to-One Bounding Functions.	Inf. Process. Lett.	1986	DBLP DOI BibTeX RDF
1	Guo-Jie Li, Benjamin W. Wah	Coping with Anomalies in Parallel Branch-and-Bound Algorithms.	IEEE Trans. Computers	1986	DBLP DOI BibTeX RDF
1	Michael J. Quinn, Narsingh Deo	An Upper Bound for the Speedup of Parallel Best-Bound Branch-And-Bound Algorithms.	BIT	1986	DBLP BibTeX RDF
1	Benjamin W. Wah, Chee Fen Yu	Stochastic Modeling of Branch-and-Bound Algorithms with Best-First Search.	IEEE Trans. Software Eng.	1985	DBLP DOI BibTeX RDF