Relevant bibliographies by topics / Branching problem

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Branching problem'

Author: Grafiati
Published: 4 June 2021
Last updated: 8 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Branching problem.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Branching problem"

1

Ravitch, M. M., and E. A. Brunner. "Branching cases in problem-based learning." Academic Medicine 71, no. 5 (1996): 542–3. http://dx.doi.org/10.1097/00001888-199605000-00064.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Kakimura, Naonori, Naoyuki Kamiyama, and Kenjiro Takazawa. "The b-branching problem in digraphs." Discrete Applied Mathematics 283 (September 2020): 565–76. http://dx.doi.org/10.1016/j.dam.2020.02.005.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Gurevich, Yuri, and Saharon Shelah. "The decision problem for branching time logic." Journal of Symbolic Logic 50, no. 3 (1985): 668–81. http://dx.doi.org/10.2307/2274321.

Full text
Abstract:
AbstractThe theory of trees with additional unary predicates and quantification over nodes and branches embraces a rich branching time logic. This theory was reduced in the companion paper to the first-order theory of binary, bounded, well-founded trees with additional unary predicates. Here we prove the decidability of the latter theory.
APA, Harvard, Vancouver, ISO, and other styles
4

Popov, I. Yu, and P. I. Smirnov. "Spectral problem for branching chain quantum graph." Physics Letters A 377, no. 6 (2013): 439–42. http://dx.doi.org/10.1016/j.physleta.2012.12.021.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Jiang, Dihua, Baiying Liu, and Bin Xu. "A reciprocal branching problem for automorphic representations and global Vogan packets." Journal für die reine und angewandte Mathematik (Crelles Journal) 2020, no. 765 (2020): 249–77. http://dx.doi.org/10.1515/crelle-2019-0016.

Full text
Abstract:
AbstractLet G be a group and let H be a subgroup of G. The classical branching rule (or symmetry breaking) asks: For an irreducible representation π of G, determine the occurrence of an irreducible representation σ of H in the restriction of π to H. The reciprocal branching problem of this classical branching problem is to ask: For an irreducible representation σ of H, find an irreducible representation π of G such that σ occurs in the restriction of π to H. For automorphic representations of classical groups, the branching problem has been addressed by the well-known global Gan–Gross–Prasad c
APA, Harvard, Vancouver, ISO, and other styles
6

Kupferman, Orna, and Moshe Y. Vardi. "Church's Problem Revisited." Bulletin of Symbolic Logic 5, no. 2 (1999): 245–63. http://dx.doi.org/10.2307/421091.

Full text
Abstract:
AbstractIn program synthesis, we transform a specification into a system that is guaranteed to satisfy the specification. When the system is open, then at each moment it reads input signals and writes output signals, which depend on the input signals and the history of the computation so far. The specification considers all possible input sequences. Thus, if the specification is linear, it should hold in every computation generated by the interaction, and if the specification is branching, it should hold in the tree that embodies all possible input sequences.Often, the system cannot read all t
APA, Harvard, Vancouver, ISO, and other styles
7

JIN, FENG, SHI-JI SONG, and CHENG WU. "A SIMULATED ANNEALING BASED BEAM SEARCH ALGORITHM FOR THE FLOW-SHOP SCHEDULING PROBLEM." International Journal of Pattern Recognition and Artificial Intelligence 22, no. 01 (2008): 65–75. http://dx.doi.org/10.1142/s0218001408006077.

Full text
Abstract:
Beam search algorithm, as an adaptation of branch and bound method, is regarded as one of the effective approaches in solving combinational optimization problems. In this paper, a new beam search algorithm for the large-scale permutation flow shop scheduling problem (FSP) is proposed. A new branching scheme is addressed and compared with the traditional branching scheme. With the new branching scheme, the number of partial schedules in the search tree can be greatly reduced. Based on a simple simulated annealing algorithm, partial schedules are globally evaluated. Numerical experiments show th
APA, Harvard, Vancouver, ISO, and other styles
8

Agrawal, M., and T. Thierauf. "The Satisfiability Problem for Probabilistic Ordered Branching Programs." Theory of Computing Systems 34, no. 5 (2001): 471–87. http://dx.doi.org/10.1007/s00224-001-1011-9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Révész, P. "A prediction problem of the branching random walk." Journal of Applied Probability 41, A (2004): 25–31. http://dx.doi.org/10.1017/s0021900200112185.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Adam, John A. "Blood Vessel Branching: Beyond the Standard Calculus Problem." Mathematics Magazine 84, no. 3 (2011): 196–207. http://dx.doi.org/10.4169/math.mag.84.3.196.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Branching problem"

1

Andersson, Jerker. "Solving the Train Timetabling Problem by using Rapid Branching." Thesis, KTH, Optimeringslära och systemteori, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-181308.

Full text
Abstract:
The topic of this thesis is the implementation of rapid branching to find an integer solution for the train timetabling problem. The techniques that rapid branching are based on are presented. The important aspect of rapid branching are discussed and then the algorithm is applied to some artificial problems. It is shown that rapid branching can be both faster and slower than a standard integer solver depending on the problem instance. For the most realistic set of the examined instances, rapid branching turned out to be faster than the standard integer solver and produce satisficingly high qua
APA, Harvard, Vancouver, ISO, and other styles
2

Morén, Björn. "Utilizing problem specic structures in branch and bound methods for manpower planning." Thesis, Linköpings universitet, Optimeringslära, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-84327.

Full text
Abstract:
This thesis is about solving the manpower planning problem concerning stangand transitioning of pilots. The objective of the planning is to have enoughpilots to satisfy the demand while minimizing the cost. The main decisions totake are how many pilots to hire, which pilots to train and which courses toschedule. The planning problems that arise are both large and dicult whichmakes it important to use ecient solution methods. Seniority rules betweenpairs of pilots are the most complicating factor.A major part in the solution process is the solving of mixed integer programs.The emphasis in the t
APA, Harvard, Vancouver, ISO, and other styles
3

Park, Vincent Se-jin. "AN EMPIRICAL STUDY OF DIFFERENT BRANCHING STRATEGIES FOR CONSTRAINT SATISFACTION PROBLEMS." Thesis, University of Waterloo, 2004. http://hdl.handle.net/10012/1193.

Full text
Abstract:
Many real life problems can be formulated as constraint satisfaction problems <i>(CSPs)</i>. Backtracking search algorithms are usually employed to solve <i>CSPs</i> and in backtracking search the choice of branching strategies can be critical since they specify how a search algorithm can instantiate a variable and how a problem can be reduced into subproblems; that is, they define a search tree. In spite of the apparent importance of the branching strategy, there have been only a few empirical studies about different branching strategies and they all have been tested exclusively for nume
APA, Harvard, Vancouver, ISO, and other styles
4

Cerqueus, Audrey. "Bi-objective branch-and-cut algorithms applied to the binary knapsack problem : surrogate bound sets, dynamic branching strategies, generation and exploitation of cover inequalities." Nantes, 2015. https://archive.bu.univ-nantes.fr/pollux/show/show?id=fdf0e978-37d8-4290-8495-a3fd67de78f7.

Full text
Abstract:
Dans ce travail, nous nous intéressons à la résolution de problèmes d’optimisation combinatoire multi-objectif. Ces problèmes ont suscité un intérêt important au cours des dernières décennies. Afin de résoudre ces problèmes, particulièrement difficiles, de manière exacte et efficace, les algorithmes sont le plus souvent spécifiques au problème traité. Dans cette thèse, nous revenons sur l’approche dite de branch-and-bound et nous en proposons une extension pour obtenir un branch-and-cut, dans un contexte bi-objectif. Les problèmes de sac-à-dos sont utilisés comme support pour ces travaux. Troi
APA, Harvard, Vancouver, ISO, and other styles
5

Nagao, Atsuki. "Computational Complexity of Tree Evaluation Problems and Branching Program Satisfiability Problems." 京都大学 (Kyoto University), 2015. http://hdl.handle.net/2433/199453.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Paiva, Renato Andrade de. "Local branching aplicado ao problema de dimensionamento de lotes." Universidade de São Paulo, 2010. http://www.teses.usp.br/teses/disponiveis/55/55134/tde-18052010-143211/.

Full text
Abstract:
O planejamento da produção é uma atividade que avalia decisões para um melhor uso dos recursos disponíveis, visando satisfazer aos objetivos produtivos da empresa ao longo de um horizonte de planejamento. Este trabalho enfoca o problema de dimensionamento de lotes com restrições de capacidade (PDLC), que é uma das tarefas centrais envolvidas no planejamento da produção. O PDLC visa determinar o tamanho dos lotes a serem produzidos em períodos de tempo de um horizonte de planejamento. Os PDLC estudados neste trabalho contemplam duas características importantes: a presença de múltiplos itens e a
APA, Harvard, Vancouver, ISO, and other styles
7

Fowler, David W. "Branching constraint satisfaction problems : sequential constrained decision making under uncertainty." Thesis, University of Aberdeen, 2002. http://digitool.abdn.ac.uk/R?func=search-advanced-go&find_code1=WSN&request1=AAIU153443.

Full text
Abstract:
One of the main characteristics of our world is uncertainty. Making plans for the future is difficult, as we do not know exactly what the future holds. Companies must be flexible, ready to cope with the unpredictable demands that are placed on them. As a result, plans are often either short term, or tend to change soon after they are made. Another feature of the modern world is its pace. Decisions must be made quickly, or events may make them out of date before they can be implemented. In this thesis, we look at decision making problems in the presence of uncertainty about how the problem may
APA, Harvard, Vancouver, ISO, and other styles
8

Pelletier, Maxime. "Résultats de stabilité en théorie des représentations par des méthodes géométriques." Thesis, Lyon, 2017. http://www.theses.fr/2017LYSE1228/document.

Full text
Abstract:
Les coefficients de Kronecker, qui sont indexés par des triplets de partitions et décrivent la décomposition du produit tensoriel de deux représentations irréductibles d'un groupe symétrique en somme directe de telles représentations, ont été introduits par Francis Murnaghan dans les années 1930. Il a notamment remarqué un comportement particulier de ces coefficients : à partir de n'importe quel triplet de partitions, on peut construire une certaine suite de coefficients de Kronecker qui est stationnaire.Afin de généraliser cette propriété, John Stembridge a introduit en 2014 une notion de sta
APA, Harvard, Vancouver, ISO, and other styles
9

Webb, Kerri. "Matrix Formulations of Matching Problems." Thesis, University of Waterloo, 2000. http://hdl.handle.net/10012/1119.

Full text
Abstract:
Finding the maximum size of a matching in an undirected graph and finding the maximum size of branching in a directed graph can be formulated as matrix rank problems. The Tutte matrix, introduced by Tutte as a representation of an undirected graph, has rank equal to the maximum number of vertices covered by a matching in the associated graph. The branching matrix, a representation of a directed graph, has rank equal to the maximum number of vertices covered by a branching in the associated graph. A mixed graph has both undirected and directed edges, and the matching forest problem for m
APA, Harvard, Vancouver, ISO, and other styles
10

Karimianpour, Camelia. "The Stone-von Neumann Construction in Branching Rules and Minimal Degree Problems." Thesis, Université d'Ottawa / University of Ottawa, 2016. http://hdl.handle.net/10393/34240.

Full text
Abstract:
In Part I, we investigate the principal series representations of the n-fold covering groups of the special linear group over a p-adic field. Such representations are constructed via the Stone-von Neumann theorem. We have three interrelated results. We first compute the K-types of these representations. We then give a complete set of reducibility points for the unramified principal series representations. Among these are the unitary unramified principal series representations, for which we further investigate the distribution of the K-types among its irreducible components. In Part II, we
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Branching problem"

1

Perkins, Edwin Arend. On the martingale problem for interactive measure-valued branching diffusions. American Mathematical Society, 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Branching Solutions to One-Dimensional Variational Problems. World Scientific Publishing Company, 2001.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Motta, M., A. V. Silhanek, and W. A. Ortiz. Magnetic Flux Avalanches in Superconducting Films with Mesoscopic Artificial Patterns. Edited by A. V. Narlikar. Oxford University Press, 2017. http://dx.doi.org/10.1093/oxfordhb/9780198738169.013.13.

Full text
Abstract:
This article examines the practical problem of thermally driven high-speed flux avalanches occurring in superconducting thin films with mesoscopic artificial patterns. The thin films are synthesized with artificial pins in the form of sub-micrometric antidots (ADs). The article first provides an overview of magnetic flux avalanches in superconductors, with particular emphasis on thermally driven avalanches, before discussing the occurrence and morphology of flux avalanches in superconducting thin films comprised of AD arrays. It analyses the influence of lattice symmetry and different AD geome
APA, Harvard, Vancouver, ISO, and other styles
4

Bendik-Keymer, Jeremy, and Chris Haufe. Anthropogenic Mass Extinction. Edited by Stephen M. Gardiner and Allen Thompson. Oxford University Press, 2016. http://dx.doi.org/10.1093/oxfordhb/9780199941339.013.38.

Full text
Abstract:
We explore the science of mass extinction, link it to industrial civilization, use the concept of the banality of evil to explain the ethical situation, and then explain the various ways in which mass extinction poses further ethical problems within that situation, especially of environmental justice and the loss of value. Overall, humankind risks a profound failure of autonomy, perhaps our greatest achievement. For those who want to take action, we recommend the project of anthroponomy and large-unit/deep-branching conservation.
APA, Harvard, Vancouver, ISO, and other styles
5

Wasserman, Ryan. Paradoxes of Freedom I. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780198793335.003.0003.

Full text
Abstract:
Chapter 3 is the first of two chapters on the paradoxes of freedom. Section 1 introduces the most famous paradox of this kind—the grandfather paradox—and relates it to other puzzles of “self-defeat.” Section 2 introduces a more general category of puzzles called the paradoxes of past-alteration. Section 3 then discusses one of the most common strategies for dealing with these problems—namely, the branching timeline model of time travel. Section 4 addresses a related view according to which time travel involves movement across more than one dimension of time. Finally, section 5 develops a new p
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Branching problem"

1

Brooks, David R. "Program Control: Branching and Repetitive Calculations." In Problem Solving with Fortran 90. Springer New York, 1997. http://dx.doi.org/10.1007/978-1-4612-1952-1_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Wang, Jinchang. "Branching rules for propositional satisfiability test." In Satisfiability Problem: Theory and Applications. American Mathematical Society, 1997. http://dx.doi.org/10.1090/dimacs/035/09.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Obodan, Natalia I., Olexandr G. Lebedeyev, and Vasilii A. Gromov. "Branching of Nonlinear Boundary Problem Solutions." In Nonlinear Behaviour and Stability of Thin-Walled Shells. Springer Netherlands, 2013. http://dx.doi.org/10.1007/978-94-007-6365-4_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Karhumäki, Juhani, and Ion Petre. "The Branching Point Approach to Conway’s Problem." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-45711-9_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Alsmeyer, Gerold. "Branching processes in stationary random environment: The extinction problem revisited." In Workshop on Branching Processes and Their Applications. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-11156-3_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Chuai-Aree, Somporn, Willi Jäger, Hans Georg Bock, and Suchada Siripant. "Inverse Problem of Lindenmayer Systems on Branching Structures." In Modeling, Simulation and Optimization of Complex Processes. Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-79409-7_11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Gurevich, Yuri, and Saharon Shelah. "To the Decision Problem for Branching Time Logic." In Foundations of Logic and Linguistics. Springer US, 1985. http://dx.doi.org/10.1007/978-1-4899-0548-2_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Le Gall, Jean-François. "Exit Measures and the Nonlinear Dirichlet Problem." In Spatial Branching Processes, Random Snakes and Partial Differential Equations. Birkhäuser Basel, 1999. http://dx.doi.org/10.1007/978-3-0348-8683-3_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Yanev, George P. "Extension of the problem of extinction on Galton–Watson family trees." In Workshop on Branching Processes and Their Applications. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-11156-3_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Bednarzik, Jürgen. "Eine Branching-Regel für das Job-Shop Scheduling Problem." In DGOR / ÖGOR. Springer Berlin Heidelberg, 1993. http://dx.doi.org/10.1007/978-3-642-78196-4_38.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Branching problem"

1

Gutin, Gregory, and Daniel Karapetyan. "Constraint Branching in Workflow Satisfiability Problem." In SACMAT '20: The 25th ACM Symposium on Access Control Models and Technologies. ACM, 2020. http://dx.doi.org/10.1145/3381991.3395600.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Brody, Joshua, and Elad Verbin. "The Coin Problem and Pseudorandomness for Branching Programs." In 2010 IEEE 51st Annual Symposium on Foundations of Computer Science (FOCS). IEEE, 2010. http://dx.doi.org/10.1109/focs.2010.10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Carvalho, Cláudio, Jonas Costa, Raul Lopes, Ana Karolina Maia, Nicolas Nisse, and Cláudia Linhares Sales. "Characterizing Networks Admitting k Arc-disjoint Branching Flows." In Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2020. http://dx.doi.org/10.5753/etc.2020.11089.

Full text
Abstract:
An s-branching flow f in a network N = (D,c) (where c is the capacity function) is a flow that reaches every vertex in V(D) \ {s} from s while loosing exactly one unit of flow in each vertex other than s. In other words, the difference between the flow entering a vertex v and a flow leaving a vertex v is one whenever v is different from s. It is known that the hardness of the problem of finding k arc-disjoint s-branching flows in network N is linked to the capacity c of the arcs in N: the problem is solvable in polynomial time if every arc has capacity n - l, for fixed l, and NP-complete in mo
APA, Harvard, Vancouver, ISO, and other styles
4

Jinguo He. "The correspondence and branching problem in medical contour reconstruction." In 2008 IEEE International Conference on Systems, Man and Cybernetics (SMC). IEEE, 2008. http://dx.doi.org/10.1109/icsmc.2008.4811514.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Hifi, Mhand, Stephane Negre, and Mohamed Ould Ahmed Mounir. "Local branching-based algorithm for the disjunctively constrained knapsack problem." In Industrial Engineering (CIE39). IEEE, 2009. http://dx.doi.org/10.1109/iccie.2009.5223682.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Boukhari, Samah, Isma Dahmani, and Mhand Hifi. "Local Branching Strategy-Based Method for the Knapsack Problem with Setup." In 4th International Conference on Computer Science and Information Technology (COMIT 2020). AIRCC Publishing Corporation, 2020. http://dx.doi.org/10.5121/csit.2020.101606.

Full text
Abstract:
In this paper, we propose to solve the knapsack problem with setups by combining mixed linear relaxation and local branching. The problem with setups can be seen as a generalization of 0–1 knapsack problem, where items belong to disjoint classes (or families) and can be selected only if the corresponding class is activated. The selection of a class involves setup costs and resource consumptions thus affecting both the objective function and the capacity constraint. The mixed linear relaxation can be viewed as driving problem, where it is solved by using a special blackbox solver while the loca
APA, Harvard, Vancouver, ISO, and other styles
7

Kusumoto, Mitsuru, Yuichi Yoshida, and Hiro Ito. "Constant-Time Approximation Algorithms for the Optimum Branching Problem on Sparse Graphs." In 2012 Third International Conference on Networking and Computing (ICNC). IEEE, 2012. http://dx.doi.org/10.1109/icnc.2012.78.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Angeles, Jorge, and Shaoping Bai. "A Robust Solution of the Spherical Burmester Problem." In ASME 2010 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2010. http://dx.doi.org/10.1115/detc2010-28189.

Full text
Abstract:
The problem of spherical four-bar linkage synthesis is revisited in this paper. The work is aimed at developing a robust synthesis method by taking into account both the formulation and the solution method. In addition, the synthesis of linkages with spherical prismatic joints is considered by treating them as a special case of the linkages under study. A two-step synthesis method is developed, which sequentially deals with equation-solving by a semigraphical approach and branching-detection. Examples are included to demonstrate the proposed method.
APA, Harvard, Vancouver, ISO, and other styles
9

Bigler, Tamara, and Oliver Strub. "A Local-branching Heuristic for the Best Subset Selection Problem in Linear Regression." In 2018 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM). IEEE, 2018. http://dx.doi.org/10.1109/ieem.2018.8607366.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Saboia, Carlos Henrique M., and Andre Luiz Diniz. "A local branching approach for network-constrained thermal unit commitment problem under uncertainty." In 2016 Power Systems Computation Conference (PSCC). IEEE, 2016. http://dx.doi.org/10.1109/pscc.2016.7541012.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Branching problem"

1

Joseph Marion Tuggle IV. Radiative B Meson Decay as a Probe of Physics Beyond the Standard Model: Time-Dependent CP Violation in B0 → K0S π0 γ and the B → Φ K γ Branching Fraction. Office of Scientific and Technical Information (OSTI), 2009. http://dx.doi.org/10.2172/946450.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Branching problem' for particular source types:
Journal articles Dissertations / Theses
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography