Log in

Relevant bibliographies by topics / Branching problem / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Branching problem.

Dissertations / Theses 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 top 24 dissertations / theses for your research 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.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

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

11

Mendonca, Alysson Anthony Almeida. "Modelos e técnicas de local branching para o problema de abastecimento de linhas de montagem." Universidade Federal de Minas Gerais, 2011. http://hdl.handle.net/1843/BUBD-8LXGEC.

Full text

Abstract:

The problem faced when feeding assembly lines can be seen in the automobile industry in which manufacturing systems usually have parallel production lines dedicated to assembling different product families. In this context, a feeding process must deliver the necessary items to ensure that the assembly lines can perform their operations, being highly desirable the use feeding policies that can reduce the costs associated with the feeding process. The problem evaluated in this study has similarities with lot sizing and sequencing problems, and it has been shown in the related literature that sol

APA, Harvard, Vancouver, ISO, and other styles

12

Santos, Rafael Francisco dos. "Uso de cortes canonicos no metodo de ramificação local para problemas inteiros 0-1 mistos." [s.n.], 2006. http://repositorio.unicamp.br/jspui/handle/REPOSIP/276254.

Full text

Abstract:

Orientador: Cid Carvalho de Souza<br>Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Computação<br>Made available in DSpace on 2018-08-08T14:02:44Z (GMT). No. of bitstreams: 1 Santos_RafaelFranciscodos_M.pdf: 909075 bytes, checksum: b4d466696cb4f640a50eca288dfccd5c (MD5) Previous issue date: 2006<br>Resumo: Nesta dissertação propomos um uso mais geral dos Cortes Canônicos (CCs) introduzidos por Balas e Jeroslow ([2]) no método de Ramificação Local (RamLoc) de Fischetti e Lodi ([6]). A ramificação local é uma heurística de propósito geral para Programação Inteira Mist

APA, Harvard, Vancouver, ISO, and other styles

13

Santos, Eulália Maria Mota. "O problema da árvore de suporte de custo mínimo com restrições de peso." Doctoral thesis, Universidade de Aveiro, 2014. http://hdl.handle.net/10773/14137.

Full text

Abstract:

Doutoramento em Matemática<br>Nesta tese abordam-se várias formulações e diferentes métodos para resolver o Problema da Árvore de Suporte de Custo Mínimo com Restrições de Peso (WMST – Weight-constrained Minimum Spanning Tree Problem). Este problema, com aplicações no desenho de redes de comunicações e telecomunicações, é um problema de Otimização Combinatória NP-difícil. O Problema WMST consiste em determinar, numa rede com custos e pesos associados às arestas, uma árvore de suporte de custo mínimo de tal forma que o seu peso total não exceda um dado limite especificado. Apresentam-se

APA, Harvard, Vancouver, ISO, and other styles

14

Blondin, Michael. "Algorithmique et complexité des systèmes à compteurs." Thèse, Université Paris-Saclay (ComUE), 2016. http://hdl.handle.net/1866/16025.

Full text

Abstract:

Réalisé en cotutelle avec l'École normale supérieure de Cachan – Université Paris-Saclay<br>L'un des aspects fondamentaux des systèmes informatiques modernes, et en particulier des systèmes critiques, est la possibilité d'exécuter plusieurs processus, partageant des ressources communes, de façon simultanée. De par leur nature concurrentielle, le bon fonctionnement de ces systèmes n'est assuré que lorsque leurs comportements ne dépendent pas d'un ordre d'exécution prédéterminé. En raison de cette caractéristique, il est particulièrement difficile de s'assurer qu'un système concurrent ne possède

APA, Harvard, Vancouver, ISO, and other styles

15

Leandro, Jorge de Jesus Gomes. "Dois problemas em análise de formas de estruturas de ramificação." Universidade de São Paulo, 2008. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-02092008-113204/.

Full text

Abstract:

O presente texto descreve métodos e apresenta resultados do projeto de pesquisa de mestrado intitulado \"Dois Problemas em Análise de Formas de Estruturas de Ramificação\". Ambos os problemas abordados estão relacionados às sub-áreas da Análise de Formas denominadas Caracterização e Descrição de Formas. O primeiro problema consiste na investigação de um conjunto de características propostas para distingüir, primeiramente, entre estruturas de ramificação de vasos sangüíneos em imagens de retina segmentadas manualmente e automaticamente. A seguir, as mesmas características são aplicadas para dis

APA, Harvard, Vancouver, ISO, and other styles

16

Darwiche, Mostafa. "When operations research meets structural pattern recognition : on the solution of error-tolerant graph matching problems." Thesis, Tours, 2018. http://www.theses.fr/2018TOUR4022/document.

Full text

Abstract:

Cette thèse se situe à l’intersection de deux domaines de recherche scientifique la Reconnaissance d’Objets Structurels (ROS) et la Recherche Opérationnelle (RO). Le premier consiste à rendre la machine plus intelligente et à reconnaître les objets, en particulier ceux basés sur les graphes. Alors que le second se focalise sur la résolution de problèmes d’optimisation combinatoire difficiles. L’idée principale de cette thèse est de combiner les connaissances de ces deux domaines. Parmi les problèmes difficiles existants en ROS, le problème de la distance d’édition entre graphes (DEG) a été sél

APA, Harvard, Vancouver, ISO, and other styles

17

Joncour, Cédric. "Problèmes de placement 2D et application à l’ordonnancement : modélisation par la théorie des graphes et approches de programmation mathématique." Thesis, Bordeaux 1, 2010. http://www.theses.fr/2010BOR14173/document.

Full text

Abstract:

Le problème de placement sur deux dimensions consiste à décider s’il existe un rangement d’objets rectangulaires dans une boîte donnée. C’est un problème combinatoire diﬃcile (à la complexité du respect des capacités s’ajoute celle du positionnement des objets).Dans cette thèse, nous considérons les variantes sans rotation des objets et avec ou sansoptimisation de la valeur des objects placés.Nous menons une étude exploratoire des méthodologies qui peuvent être développéesà l’interface de la programmation mathématique, de l’optimisation combinatoire et de lathéorie des graphes. Notre objectif

APA, Harvard, Vancouver, ISO, and other styles

18

Tur, Clarisse. "Simulations for an experiment to probe the in-medium properties of photoproduced vector mesons." Washington, D.C : Oak Ridge, Tenn. : United States. Dept. of Energy ; distributed by the Office of Scientific and Technical Information, U.S. Dept. of Energy, 2003. http://www.osti.gov/servlets/purl/824884-kO2hCu/native/.

Full text

Abstract:

Thesis (M.S.); Submitted to the Univ. of South Carolina, Columbia, SC (US); 1 Apr 2003.<br>Published through the Information Bridge: DOE Scientific and Technical Information. "JLAB-PHY-03-37" "DOE/ER/40150-2740" Clarisse Tur. 04/01/2003. Report is also available in paper and microfiche from NTIS.

APA, Harvard, Vancouver, ISO, and other styles

19

"Branching bandits and Klimov's problem : achievable region and side constraints." Massachusetts Institute of Technology, Laboratory for Information and Decision Systems], 1994. http://hdl.handle.net/1721.1/3367.

Full text

Abstract:

Dimitris Bertsimas, Ioannis Ch. Paschalidis, John N. Tsitsiklis.<br>Includes bibliographical references (p. 22-24).<br>Supported by a Presidential Young Investigator Award. DDM-9158118 Supported by the ARO. DAAL-03-92-G-0115 Supported with matching funds from Draper Laboratory and the Leaders for Manufacturing Program at MIT.

APA, Harvard, Vancouver, ISO, and other styles

20

林慧芬. "The Continuation of Solution Paths aned The Computation of Branching Points of A Nolinear Boundary-Valued Problem." Thesis, 2005. http://ndltd.ncl.edu.tw/handle/02775205771100155891.

Full text

Abstract:

碩士<br>國立新竹教育大學<br>數學教育學系碩士班<br>93<br>This thesis investigates the turning points, bifurcation points and solution branches of nonlinear ordinary differential equations with the boundary-values. First, we use shooting method and newton’s interative method to calculate the bifurcation points or turning points.We use implicit function theorem as the foundation to quote the numerical method of the Liapunov-Schmidt reduction method, pseudo-archength continuation method, secant-predictor method, and Newton’s interative method,to continue all solution branches from bifurcation points. Finally

APA, Harvard, Vancouver, ISO, and other styles

21

Johnson, Torrey (Torrey Allen). "Branching random walk and probability problems from physics and biology." Thesis, 2012. http://hdl.handle.net/1957/30268.

Full text

Abstract:

This thesis studies connections between disorder type in tree polymers and the branching random walk and presents an application to swarm site-selection. Chapter two extends results on tree polymers in the infinite volume limit to critical strong disorder. Almost sure (a.s.) convergence in the infinite volume limit is obtained for weak disorder by standard theory on multiplicative cascades or the branching random walk. Chapter three establishes results for a simple branching random walk in connection with a related tree polymer. A central limit theorem (CLT) is shown to hold regardless of

APA, Harvard, Vancouver, ISO, and other styles

22

Roychoudhury, Satrajit. "Selected problems of inference on branching processes and poisson shock model." Thesis, 2006. http://library1.njit.edu/etd/fromwebvoyage.cfm?id=njit-etd2006-113.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Khasianov, Airat [Verfasser]. "Complexity bounds on some fundamental computational problems for quantum branching programs / vorgelegt von Airat Khasianov." 2005. http://d-nb.info/975937960/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Williams, Aaron Michael. "Shift gray codes." Thesis, 2009. http://hdl.handle.net/1828/1966.

Full text

Abstract:

Combinatorial objects can be represented by strings, such as 21534 for the permutation (1 2) (3 5 4), or 110100 for the binary tree corresponding to the balanced parentheses (()()). Given a string s = s1 s2 sn, the right-shift operation shift(s, i, j) replaces the substring si si+1..sj by si+1..sj si. In other words, si is right-shifted into position j by applying the permutation (j j−1 .. i) to the indices of s. Right-shifts include prefix-shifts (i = 1) and adjacent-transpositions (j = i+1). A fixed-content language is a set of strings that contain the same multiset of symbols. Given a f

APA, Harvard, Vancouver, ISO, and other styles

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!