default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 833 matches
- 2024
- Elif Cesur, Muhammet Rasit Cesur, Ajith Abraham:
Enhanced Branch and Bound Algorithm: Minimizing Subproblem Complexity in Power Dispatch. IEEE Access 12: 93753-93760 (2024) - Zixiang Li, Celso Gustavo Stall Sikora, Ibrahim Kucukkoc:
Chance-constrained stochastic assembly line balancing with branch, bound and remember algorithm. Ann. Oper. Res. 335(1): 491-516 (2024) - Lei Liu, Marcello Urgo:
Robust scheduling in a two-machine re-entrant flow shop to minimise the value-at-risk of the makespan: branch-and-bound and heuristic algorithms based on Markovian activity networks and phase-type distributions. Ann. Oper. Res. 338(1): 741-764 (2024) - Jinxiang Wei, Zhaolin Hu, Jun Luo, Shushang Zhu:
Enhanced branch-and-bound algorithm for chance constrained programs with Gaussian mixture models. Ann. Oper. Res. 338(2): 1283-1315 (2024) - Anh H. G. Nguyen, Gwo-Ji Sheen:
Trimming-the-state-space mechanism embedded branch-and-bound algorithm for two-parallel machines scheduling with availability constraints. Comput. Ind. Eng. 190: 110002 (2024) - Eduardo Álvarez-Miranda, Jordi Pereira, Mariona Vilà:
A branch, bound and remember algorithm for maximizing the production rate in the simple assembly line balancing problem. Comput. Oper. Res. 166: 106597 (2024) - Xue Li, Zhengwen He, Nengmin Wang:
A branch-and-bound algorithm for the proactive resource-constrained project scheduling problem with a robustness maximization objective. Comput. Oper. Res. 166: 106623 (2024) - Tom Denat, Ararat Harutyunyan, Nikolaos Melissinos, Vangelis Th. Paschos:
Average-case complexity of a branch-and-bound algorithm for Min Dominating Set. Discret. Appl. Math. 345: 4-8 (2024) - Marcos M. Raimundo, Luis Gustavo Nonato, Jorge Poco:
Mining Pareto-optimal counterfactual antecedents with a branch-and-bound model-agnostic algorithm. Data Min. Knowl. Discov. 38(5): 2942-2974 (2024) - Claudio Sanavio, Edoardo Tignone, Elisa Ercolessi:
Hybrid Classical-Quantum Branch-and-Bound Algorithm for Solving Integer Linear Problems. Entropy 26(4): 345 (2024) - Shinya Korekane, Tatsushi Nishi, Kevin Tierney, Ziang Liu:
Neural network assisted branch and bound algorithm for dynamic berth allocation problems. Eur. J. Oper. Res. 319(2): 531-542 (2024) - Susanne Sass, Alexander Mitsos, Dominik Bongartz, Ian H. Bell, Nikolay I. Nikolov, Angelos Tsoukalas:
A branch-and-bound algorithm with growing datasets for large-scale parameter estimation. Eur. J. Oper. Res. 316(1): 36-45 (2024) - Philipp Schulze, Armin Scholl, Rico Walter:
R-SALSA: A branch, bound, and remember algorithm for the workload smoothing problem on simple assembly lines. Eur. J. Oper. Res. 312(1): 38-55 (2024) - Peiping Shen, Yaping Deng, Yafei Wang:
A one-dimensional branching rule based branch-and-bound algorithm for minimax linear fractional programming. J. Comput. Appl. Math. 448: 115900 (2024) - Yanzhen Zhang, Peiping Shen, Bingdi Huang, Yaping Deng:
An efficient branch-and-bound algorithm using an adaptive branching rule with quadratic convex relaxation for globally solving general linear multiplicative programs. J. Comput. Appl. Math. 450: 116035 (2024) - Michael Souza, Nilton Maia, Rômulo S. Marques, Carlile Lavor:
A Branch-and-Bound Algorithm for the Molecular Ordered Covering Problem. J. Comput. Biol. 31(6): 475-485 (2024) - Cheng Lu, Jitao Ma, Zhibin Deng, Wenxun Xing:
A graphic structure based branch-and-bound algorithm for complex quadratic optimization and applications to magnitude least-square problem. J. Glob. Optim. 88(1): 115-137 (2024) - Weitian Wu, Xinmin Yang:
Reference-point-based branch and bound algorithm for multiobjective optimization. J. Glob. Optim. 88(4): 927-945 (2024) - Bo Zhang, Hongyu Wang, Yuelin Gao:
Output-Space Outer Approximation Branch-and-Bound Algorithm for a Class of Linear Multiplicative Programs. J. Optim. Theory Appl. 202(3): 997-1026 (2024) - Bechir Naffeti, Hamadi Ammar, Walid Ben Aribi:
A Branch and Bound algorithm for multidimensional Holder optimization: Estimation of the age-dependent viral hepatitis A infection force. Math. Comput. Simul. 217: 311-326 (2024) - Gwenaël Samain, Sébastien Bourguignon, Jordan Ninin:
Techniques for accelerating branch-and-bound algorithms dedicated to sparse optimization. Optim. Methods Softw. 39(1): 4-41 (2024) - Xueqing Yan, Yongming Li:
A hierarchical branch and bound algorithm for Mahjong deficiency. Soft Comput. 28(4): 3321-3340 (2024) - Jeongsun Ahn, Hyun-Jung Kim:
A Branch and Bound Algorithm for Scheduling of Flexible Manufacturing Systems. IEEE Trans Autom. Sci. Eng. 21(3): 4382-4396 (2024) - Rahele Mohammadi, Peyman Neamatollahi, Morteza Moradi, Mahmoud Naghibzadeh, Abdorreza Savadi:
Efficient Motif Discovery in Protein Sequences Using a Branch and Bound Algorithm. IEEE J. Biomed. Health Informatics 28(4): 2437-2444 (2024) - Yihao Liu, Yaoyao Ye:
An Efficient Branch-and-Bound Routing Algorithm for Optical NoCs. ASPDAC 2024: 860-865 - Koki Aoki, Kenji Koide, Shuji Oishi, Masashi Yokozuka, Atsuhiko Banno, Junichi Meguro:
3D-BBS: Global Localization for 3D Point Cloud Scan Matching Using Branch-and-Bound Algorithm. ICRA 2024: 1796-1802 - Jinghui Xue, Jiongzhi Zheng, Mingming Jin, Kun He:
An Effective Branch-and-Bound Algorithm with New Bounding Methods for the Maximum s-Bundle Problem. CoRR abs/2402.03736 (2024) - Ayman Chaouki, Jesse Read, Albert Bifet:
Branches: A Fast Dynamic Programming and Branch & Bound Algorithm for Optimal Decision Trees. CoRR abs/2406.02175 (2024) - 2023
- Bo Zhang, Yuelin Gao:
An Output-Space Based Branch-and-Bound Algorithm for Sum-of-Linear-Ratios Problem. Asia Pac. J. Oper. Res. 40(2): 2250010:1-2250010:23 (2023) - Nikolaos P. Theodorakatos, Rohit Babu, Angelos P. Moschoudis:
The Branch-and-Bound Algorithm in Optimizing Mathematical Programming Models to Achieve Power Grid Observability. Axioms 12(11): 1040 (2023)
skipping 803 more matches
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-09-20 09:42 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint