Log in

Relevant bibliographies by topics / Branch and bound / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Branch and bound.

Dissertations / Theses on the topic 'Branch and bound'

Author: Grafiati

Published: 4 June 2021

Last updated: 25 July 2025

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

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic 'Branch and bound.'

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

Turpin, Heather Jane. "The branch-and-bound paradigm." Thesis, University of East Anglia, 1990. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.277168.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Stix, Volker. "Stochastic branch & bound applying target oriented branch & bound method to optimal scenario tree reduction." Institut für Informationsverarbeitung und Informationswirtschaft, WU Vienna University of Economics and Business, 2002. http://epub.wu.ac.at/1212/1/document.pdf.

Full text

Abstract:

In this article a new branch & bound method is described. It uses an artificial target to improve its bounding capabilities. Therefore the new approach is faster compared to the classical one. It is applied to the stochastic problem of optimal scenario tree reduction. The aspects of global optimization are emphasized here. All necessary components for that problem are developed and some experimental results underline the benefits of the new approach. (author's abstract)<br>Series: Working Papers on Information Systems, Information Business and Operations

APA, Harvard, Vancouver, ISO, and other styles

3

Rahman, Mostafizur. "Branch and Bound Algorithm for Multiprocessor Scheduling." Thesis, Högskolan Dalarna, Datateknik, 2009. http://urn.kb.se/resolve?urn=urn:nbn:se:du-3790.

Full text

Abstract:

The multiprocessor task graph scheduling problem has been extensively studied asacademic optimization problem which occurs in optimizing the execution time of parallelalgorithm with parallel computer. The problem is already being known as one of the NPhardproblems. There are many good approaches made with many optimizing algorithmto find out the optimum solution for this problem with less computational time. One ofthem is branch and bound algorithm.In this paper, we propose a branch and bound algorithm for the multiprocessor schedulingproblem. We investigate the algorithm by comparing two diff

APA, Harvard, Vancouver, ISO, and other styles

4

Turkensteen, Marcel. "Advanced analysis of branch and bound algorithms." [S.l. : [Groningen : s.n.] ; University Library Groningen] [Host], 2006. http://irs.ub.rug.nl/ppn/299139158.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Guilbeau, Jared T. "A Vector Parallel Branch and Bound Algorithm." Thesis, University of Louisiana at Lafayette, 2017. http://pqdtopen.proquest.com/#viewpdf?dispub=10242153.

Full text

Abstract:

<p> Global optimization problems sometimes attain their extrema on infinite subsets of the search space, forcing mathematically rigorous programs to require large amounts of data to describe these sets. This makes these programs natural candidates for both vectorization methods and parallel computing. Here, we give a brief overview of parallel computing and vectorization methods, exploit their availability by constructing a fully distributed implementation of a mathematically rigorous Vector Parallel Branch and Bound Algorithm using MATLAB’s SPMD architecture and interval arithmetic, and

APA, Harvard, Vancouver, ISO, and other styles

6

Farias, Denilson Atilio Godry. "Paralelização da Técnica Branch and Bound com PVM." reponame:Repositório Institucional da UFPR, 2011. http://hdl.handle.net/1884/25089.

Full text

Abstract:

Resumo: Este trabalho aborda a implementação paralela da técnica Branch-and-Bound em problemas de otimização combinatoria, especificamente busca em grafos. E utilizado na implementação o modelo de programação paralela por troca de mensagens com o uso da biblioteca Parallel Virtual Machine (PVM) sobre o sistema operacional Linux em uma arquitetura multicomputador. E analisado o comportamento da técnica Branch-and-Bound, em particular a relação entre (a) três critérios de busca, (b) a utilização dos recursos de memória e (c) granularidade de, processamento e comunicação entre processos. E propos

APA, Harvard, Vancouver, ISO, and other styles

7

Abdul-Razaq, Tariq S. "Machine scheduling problems : a branch and bound approach." Thesis, Keele University, 1987. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.328587.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Mutlu, Mustafa Cagdas. "A Branch And Bound Algorithm For Resource Leveling Problem." Master's thesis, METU, 2010. http://etd.lib.metu.edu.tr/upload/12612259/index.pdf.

Full text

Abstract:

Resource Leveling Problem (RLP) aims to minimize undesired fluctuations in resource distribution curves which cause several practical problems. Many studies conclude that commercial project management software packages can not effectively deal with RLP. In this study a branch and bound algorithm is presented for solving RLP for single and multi resource, small size networks. The algorithm adopts a depth-first strategy and stores start times of non-critical activities in the nodes of the search tree. Optimal resource distributions for 4 different types of resource leveling metrics can be obtain

APA, Harvard, Vancouver, ISO, and other styles

9

Stix, Volker. "Target oriented branch & bound method for global optimization." Institut für Informationsverarbeitung und Informationswirtschaft, WU Vienna University of Economics and Business, 2002. http://epub.wu.ac.at/1696/1/document.pdf.

Full text

Abstract:

We introduce a very simple but efficient idea for branch & bound (B&B) algorithms in global optimization (GO). As input for our generic algorithm, we need an upper bound algorithm for the GO maximization problem and a branching rule. The latter reduces the problem into several smaller subproblems of the same type. The new B&B approach delivers one global optimizer or, if stopped before finished, improved upper and lower bounds for the problem. Its main difference to commonly used B&B techniques is its ability to approximate the problem from above and from below while traversing the problem tre

APA, Harvard, Vancouver, ISO, and other styles

10

Eele, Alison. "Path Planning with Avoidance Using Nonlinear Branch-and-Bound." Thesis, University of Bristol, 2009. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.520189.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Uygun, Adnan. "Network interdiction by Lagrangian relaxation and branch-and-bound." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2002. http://library.nps.navy.mil/uhtbin/hyperion-image/02Jun%5FUygun.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Ryoo, Moo Bong. "A constraint branch-and-bound method for set partitioning problems." Thesis, Monterey, California : Naval Postgraduate School, 1990. http://handle.dtic.mil/100.2/ADA227092.

Full text

Abstract:

Thesis (M.S. in Operations Research)--Naval Postgraduate School, March 1990.<br>Thesis Advisor(s): Wood, R. Kevin. Second Reader: Brown, Gerald Gerard. "March 1990." Description based on signature page as viewed on October 21, 2009. Author(s) subject terms: Set partitioning problem, constraint branch and bound method, enumeration tree. Includes bibliographical references (p. 34-36). Also available online.

APA, Harvard, Vancouver, ISO, and other styles

13

Jariwala, Anish. "Efficient branch and bound algorithm for the dynamic layout problem." Ohio : Ohio University, 1995. http://www.ohiolink.edu/etd/view.cgi?ohiou1179426531.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Erken, Ozgur. "A branch-and-bound algorithm for the network diversion problem." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2002. http://library.nps.navy.mil/uhtbin/hyperion-image/02Dec%5FErken.pdf.

Full text

Abstract:

Thesis (M.S. in Operations Research)--Naval Postgraduate School, December 2002.<br>Thesis advisor(s): R. Kevin Wood, Matthew Carlyle. Includes bibliographical references (p. 35). Also available online.

APA, Harvard, Vancouver, ISO, and other styles

15

Martins, Gustavo H. A. "A new branch-and-bound procedure for computing optimal search paths." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 1993. http://handle.dtic.mil/100.2/ADA265276.

Full text

Abstract:

Thesis (M.S. in Operations Research) Naval Postgraduate School, March 1993.<br>Thesis advisor(s): Eagle, James N. ; Rasmussen, Craig W. "March 1993." Includes bibliographical references. Also available online.

APA, Harvard, Vancouver, ISO, and other styles

16

Djamai, Mathieu. "Algorithmes Branch&Bound Pair-à-Pair pour Grilles de Calcul." Phd thesis, Université des Sciences et Technologie de Lille - Lille I, 2013. http://tel.archives-ouvertes.fr/tel-00841704.

Full text

Abstract:

Dans le domaine de l'Optimisation Combinatoire, la résolution de manière optimale de problèmes de grande taille par le biais d'algorithmes Branch-and-Bound requiert un nombre très élevé de ressources de calcul. De nos jours, de telles ressources sont accessibles grâce aux grilles de calcul, composées de grappes de clusters réparties sur différents sites géographiques. Ces environnements parallèles posent de nombreux défis scientifiques, notamment en termes de passage à l'échelle, de la prise en compte de l'hétérogénéité des ressources ainsi qu'en termes de tolérance aux pannes. La plupart des

APA, Harvard, Vancouver, ISO, and other styles

17

Rush, S. A. "Implementation of parallel branch-and-bound on a network of transputers." Thesis, University of East Anglia, 1992. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.317615.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Krishnan, Raj 1980. "Solving hybrid decision-control problems through conflict-directed branch & bound." Thesis, Massachusetts Institute of Technology, 2004. http://hdl.handle.net/1721.1/28429.

Full text

Abstract:

Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2004.<br>"February 2, 2004."<br>Includes bibliographical references (leaf 103).<br>There exists a large class of problems that incorporate both logical decision and algebraic constraints. For example, in cooperative path planning (CPP) problem, obstacle avoidance can be achieved by selecting a direction in which to avoid every obstacle, which in turn imposes an inequality constraint. Traditionally, these hybrid decision-control problems (HDCPs) are encoded in a binary integer program

APA, Harvard, Vancouver, ISO, and other styles

19

Hu, Sha S. M. Massachusetts Institute of Technology. "Semidefinite relaxation based branch-and-bound method for nonconvex quadratic programming." Thesis, Massachusetts Institute of Technology, 2006. http://hdl.handle.net/1721.1/39217.

Full text

Abstract:

Thesis (S.M.)--Massachusetts Institute of Technology, Computation for Design and Optimization Program, 2006.<br>Includes bibliographical references (leaves 73-75).<br>In this thesis, we use a semidefinite relaxation based branch-and-bound method to solve nonconvex quadratic programming problems. Firstly, we show an interval branch-and-bound method to calculate the bounds for the minimum of bounded polynomials. Then we demonstrate four SDP relaxation methods to solve nonconvex Box constrained Quadratic Programming (BoxQP) problems and the comparison of the four methods. For some lower dimension

APA, Harvard, Vancouver, ISO, and other styles

20

Di, Costanzo Alexandre. "Branch-and-bound with peer-to-peer for large-scale grids." Nice, 2007. http://www.theses.fr/2007NICE4031.

Full text

Abstract:

Cette thèse a pour objectif de faciliter le déploiement d’applications distribuées sur des grilles de calcul à grande échelle, en utilisant une infrastructure pair-à-pair (P2P) pour les grilles. De plus, cette thèse propose aussi une bibliothèque basée sur la technique « Élagage et branchement » (de l’anglais, Branch-and-Bound – B&B) pour résoudre les problèmes d’optimisation combinatoire. Les modèles et infrastructures pour le P2P existant sont plutôt décevants : seulement des tâches indépendantes généralement sans communication entre les tâches, et des API de bas niveau. Cette thèse prop

APA, Harvard, Vancouver, ISO, and other styles

21

Djamaï, Mathieu. "Algorithmes Branch-and-Bound Pair-à-Pair pour grilles de calcul." Thesis, Lille 1, 2013. http://www.theses.fr/2013LIL10009/document.

Full text

Abstract:

Dans le domaine de l'Optimisation Combinatoire, la résolution de manière optimale de problèmes de grande taille par le biais d'algorithmes Branch-and-Bound requiert un nombre très élevé de ressources de calcul. De nos jours, de telles ressources sont accessibles grâce aux grilles de calcul, composées de grappes de clusters réparties sur différents sites géographiques. Ces environnements parallèles posent de nombreux défis scientifiques, notamment en termes de passage à l'échelle, de la prise en compte de l'hétérogénéité des ressources ainsi qu'en termes de tolérance aux pannes. La plupart des

APA, Harvard, Vancouver, ISO, and other styles

22

Maccari, Danilo. "Formação de células de manufatura através da metodologia Branch and Bound /." Florianópolis, SC, 1999. http://repositorio.ufsc.br/xmlui/handle/123456789/81157.

Full text

Abstract:

Dissertação (Mestrado) - Universidade Federal de Santa Catarina, Centro Tecnológico.<br>Made available in DSpace on 2012-10-18T23:50:03Z (GMT). No. of bitstreams: 0Bitstream added on 2016-01-09T02:43:11Z : No. of bitstreams: 1 152507.pdf: 3899454 bytes, checksum: 2979bb20ae400d5621f319282a08ad48 (MD5)<br>A crescente concorrência no mercado mundial, juntamente com a globalização e diversificação dos produtos, tem obrigado as indústrias a abandonarem a filosofia de produção em massa, amplamente explorada nas décadas passadas e adotar sérias medidas de economia, redução de custos, qualidade de pr

APA, Harvard, Vancouver, ISO, and other styles

23

Samain, Gwenaël. "Branch-and-bound algorithm for efficient resolution of sparse optimization problems." Electronic Thesis or Diss., Ecole centrale de Nantes, 2024. http://www.theses.fr/2024ECDN0004.

Full text

Abstract:

De nombreux problèmes inverses en traitement du signal, statistique, imagerie biomédicale, astronomie et apprentissage machinepeuvent se formuler comme la recherche de la meilleure combinaison de motifs expliquant les données, ces motifs étant choisis dans un catalogue connu. L’aspect parcimonieux du problème réside dans le faible nombre de motifs que l’on cherche à sélectionner via l’utilisation d’un terme `0. Plusieurs méthodes standards, telles que des algorithmes gloutons (OMP, OLS) et des reformulations convexes du problème (notamment en norme `1), permettent d’obtenir des solutions appro

APA, Harvard, Vancouver, ISO, and other styles

24

Zariffa, Nohad. "Implementations and analysis of three parallel branch-and-bound algorithms for the vertex covering problem." Thesis, McGill University, 1986. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=66011.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Moursli, Omar. "Scheduling the hybrid flowshop : branch and bounnd algorithms." Université catholique de Louvain, 1999. http://edoc.bib.ucl.ac.be:81/ETD-db/collection/available/BelnUcetd-11262003-101952/.

Full text

Abstract:

This thesis studies Production Scheduling in a multistage hybrid flowshop facility. It first states the general Production Planning and Scheduling problem and highlights some drawbacks of classical solutions. A theoretical decomposition-based approach is introduced whose main issue is to overcome non-efficient capacity utilization. By using Branch and Bound methods, an in-depth analysis of the scheduling part of the system is then carried out throughout the study and development of upper and lower bounds as well as branching schemes. Already-existing and new heuristics are presented and compar

APA, Harvard, Vancouver, ISO, and other styles

26

Cherri, Luiz Henrique. "Um método híbrido para o problema de dimensionamento de lotes." Universidade de São Paulo, 2013. http://www.teses.usp.br/teses/disponiveis/55/55134/tde-08052013-140926/.

Full text

Abstract:

Neste trabalho, abordamos métodos de resolução para o problema de dimensionamento de lotes que contempla o planejamento da produção de vários produtos em múltiplas máquinas. A fabricação dos produtos consome tempo de produção e preparação de uma capacidade de produção limitada. A demanda pelos produtos é conhecida e pode ser atendida com atraso durante um horizonte de planejamento finito. O objetivo é minimizar a soma dos custos de produção, preparação para a produção, estoque dos produtos e atraso na entrega destes. Em uma primeira etapa, desenvolvemos uma busca tabu determinística baseada em

APA, Harvard, Vancouver, ISO, and other styles

27

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

28

Hailer, Angelika Christina. "Verification of branch and bound algorithms applied to water distribution network design." Berlin Logos-Verl, 2006. http://deposit.d-nb.de/cgi-bin/dokserv?id=2844475&prov=M&dok_var=1&dok_ext=htm.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Möhrke, Ulrich, Paul Herrmann, M. Steffen, and Wilhelm G. Spruth. "Ein Branch&Bound-Ansatz zur Verdrahtung von Field Programmable Gate-Arrays." Universität Leipzig, 1998. https://ul.qucosa.de/id/qucosa%3A34536.

Full text

Abstract:

Zur Verdrahtung der meisten FPGA-Architekturen können die aus dem ASIC-Entwurf stammenden Werkzeuge wie z.B. Kanalverdrahter nicht eingesetzt werden. Eine vollautomatische Verdrahtung mit optimalen Signallaufzeiten kann nur dann erreicht werden, wenn bei gegebener Plazierung die Leitungführung den technologischen Gegebenheiten angepaßt wird. Diese unterscheiden sich deutlich von denen in ASICs. Im Rahmen des von der Deutschen Forschungsgemeinschaft (DFG) geförderten Gemeinschafts-Projekts „FPGA Entwurfssystem“, an dem die Universität Leipzig, die Universität Tübingen und die Technischen Univer

APA, Harvard, Vancouver, ISO, and other styles

30

Helbecque, Guillaume. "PGAS-based Parallel Branch-and-Bound for Ultra-Scale GPU-powered Supercomputers." Electronic Thesis or Diss., Université de Lille (2022-....), 2025. http://www.theses.fr/2025ULILB003.

Full text

Abstract:

Les algorithmes Branch-and-Bound (B&B) sont couramment utilisés pour la résolution exacte de nombreux problèmes d'optimisation combinatoire. Leur mise en œuvre parallèle pour la résolution d'instances de plus en plus grandes pose plusieurs défis liés à la génération dynamique de grands arbres fortement irréguliers. Avec l'arrivée de l'ère exascale, les supercalculateurs modernes sont désormais composés de milliers de nœuds de calcul hybrides, chacun intégrant des processeurs multi-cœurs couplés à des accélérateurs graphiques (GPUs). Cette organisation hiérarchique, fournissant un paralléli

APA, Harvard, Vancouver, ISO, and other styles

31

Fu, Gregory Chung Yin. "Skyline queries in database systems /." View Abstract or Full-Text, 2003. http://library.ust.hk/cgi/db/thesis.pl?COMP%202003%20FU.

Full text

Abstract:

Thesis (M. Phil.)--Hong Kong University of Science and Technology, 2003.<br>Includes bibliographical references (leaves 51-52). Also available in electronic version. Access restricted to campus users.

APA, Harvard, Vancouver, ISO, and other styles

32

Chakroun, Imen. "Algorithmes Branch and Bound parallèles hétérogènes pour environnements multi-coeurs et multi-GPU." Phd thesis, Université des Sciences et Technologie de Lille - Lille I, 2013. http://tel.archives-ouvertes.fr/tel-00841965.

Full text

Abstract:

Les algorithmes Branch and Bound (B&B) sont attractifs pour la résolution exacte de problèmes d'optimisation combinatoire (POC) par exploration d'un espace de recherche arborescent. Néanmoins, ces algorithmes sont très gourmands en temps de calcul pour des instances de problèmes de grande taille (exemple : benchmarks de Taillard pour FSP) même en utilisant le calcul sur grilles informatiques [Mezmaz et al., IEEE IPDPS'2007]. Le calcul massivement parallèle fourni à travers les plates-formes de calcul hétérogènes d'aujourd'hui [TOP500 ] est requis pour traiter effi cacement de telles instances.

APA, Harvard, Vancouver, ISO, and other styles

33

Woodcock, Andrew John. "Solving the generalized assignment problem : a hybrid Tabu search/branch and bound algorithm." Thesis, Loughborough University, 2007. https://dspace.lboro.ac.uk/2134/17881.

Full text

Abstract:

The research reported in this thesis considers the classical combinatorial optimization problem known as the Generalized Assignment Problem (GAP). Since the mid 1970's researchers have been developing solution approaches for this particular type of problem due to its importance both in practical and theoretical terms. Early attempts at solving GAP tended to use exact integer programming techniques such as Branch and Bound. Although these tended to be reasonably successful on small problem instances they struggle to cope with the increase in computational effort required to solve larger instanc

APA, Harvard, Vancouver, ISO, and other styles

34

Belouadah, H. "Scheduling and sequencing : Branch and bound based on job splitting and Lagrangian relaxation." Thesis, University of Southampton, 1988. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.383383.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Effinger, Robert T. "Optimal temporal planning at reactive time scales via dynamic backtracking branch and bound." Thesis, Massachusetts Institute of Technology, 2006. http://hdl.handle.net/1721.1/37948.

Full text

Abstract:

Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Aeronautics and Astronautics, 2006.<br>Includes bibliographical references (p. 110-115).<br>Autonomous robots are being considered for increasingly capable roles in our society, such as urban search and rescue, automation for assisted living, and lunar habitat construction. To fulfill these roles, teams of autonomous robots will need to cooperate together to accomplish complex mission objectives in uncertain and dynamic environments. In these environments, autonomous robots face a host of new challenges, such as responding robustly

APA, Harvard, Vancouver, ISO, and other styles

36

Coutinho, Walton Pereira. "Um algoritmo branch-and-bound para o problema do caixeiro viajante suficientemente próximo." Universidade Federal da Paraíba, 2014. http://tede.biblioteca.ufpb.br:8080/handle/tede/5268.

Full text

Abstract:

Made available in DSpace on 2015-05-08T14:53:38Z (GMT). No. of bitstreams: 1 arquivototal.pdf: 7900350 bytes, checksum: fbca2db827307d8c3ed2a1c15067d0da (MD5) Previous issue date: 2014-02-13<br>Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - CAPES<br>This research deals with the Close-Enough Traveling Salesman Problem, a variant of the Traveling Salesman Problem wich has several applicatios in logistics. In the Close-Enough Traveling Salesman Problem, rather than visiting the vertex (customer) itself, the salesman must visit a specific region containing such vertex. To sol

APA, Harvard, Vancouver, ISO, and other styles

37

Lecat, Clément. "Réduction de l'espace de recherche du Problème de la Somme Coloration Minimum d'un graphe." Thesis, Amiens, 2017. http://www.theses.fr/2017AMIE0033/document.

Full text

Abstract:

Le Problème de la Somme Coloration Minimum (MSCP) d'un graphe est un problème d'optimisation combinatoire dont l'objectif est de déterminer une coloration valide minimisant la somme des poids associés aux couleurs utilisées. Le nombre minimum de couleurs dans une solution optimale de MSCP est appelé la force du graphe, et la somme des poids des couleurs utilisées est appelée la somme chromatique du graphe. L'objectif de cette thèse a été d'étudier MSCP afin de proposer de nouvelles approches permettant sa résolution. La contribution de cette thèse est double. Premièrement, nous avons introduit

APA, Harvard, Vancouver, ISO, and other styles

38

Ashtiani, Alireza Mohebi. "Otimização global determinística no espaço-imagem : problemas multiplicativos e fracionários." [s.n.], 2012. http://repositorio.unicamp.br/jspui/handle/REPOSIP/261043.

Full text

Abstract:

Orientador: Paulo Augusto Valente Ferreira<br>Tese (doutorado) - Universidade Estadual de Campinas, Faculdade de Engenharia Elétrica e de Computação<br>Made available in DSpace on 2018-08-21T14:52:27Z (GMT). No. of bitstreams: 1 Ashtiani_AlirezaMohebi_D.pdf: 1381601 bytes, checksum: 9ae82bd53a7cf70422fed2348416f8f0 (MD5) Previous issue date: 2012<br>Resumo: Muitos problemas práticos em Engenharia, Economia e Planejamento são modelados de maneira conveniente como problemas de Otimização Global. Esta tese tem como objetivo principal apresentar novas técnicas de Otimização Global com foco na re

APA, Harvard, Vancouver, ISO, and other styles

39

Lee, Jin Hua. "Theoretically and computationally improving branch and bound through multivariate branching with internal cutting planes." Thesis, Kansas State University, 2010. http://hdl.handle.net/2097/6496.

Full text

Abstract:

Master of Science<br>Department of Industrial & Manufacturing Systems Engineering<br>Todd W. Easton<br>Integer Programs (IP) are a class of discrete optimization problems that are utilized commercially to improve the function of various systems. Implementation is often aimed at reaching optimal financial objectives with constraints on resources and operation. While incredibly beneficial, IPs are NP-complete, with many IP models being unsolvable. Branch and bound (BB) is the primary method employed to solve IPs to optimality. BB is an exhaustive approach to enumerating all potential integ

APA, Harvard, Vancouver, ISO, and other styles

40

Bischoff, Martin. "Location of connection facilities /." Aachen : Shaker, 2008. http://d-nb.info/988141434/04.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Abdul-Hamid, Fatimah. "An investigation of algorithms for the solution of integer programming problems." Thesis, Brunel University, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.294883.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Puttapanom, Sutanit. "Computational investigation of cutting techniques for integer programming /." free to MU campus, to others for purchase, 2003. http://wwwlib.umi.com/cr/mo/fullcit?p1418058.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Guimarães, Lucia Filomena de Almeida. "Um algoritmo "Branch and Bound" para um modelo de otimização de um sistema "kanban"." [s.n.], 1991. http://repositorio.unicamp.br/jspui/handle/REPOSIP/261651.

Full text

Abstract:

Orientador : Vinicius Amaral Armentano<br>Dissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica<br>Made available in DSpace on 2018-07-14T00:13:40Z (GMT). No. of bitstreams: 1 Guimaraes_LuciaFilomenadeAlmeida_M.pdf: 4750018 bytes, checksum: 47bfeb98ca30551c43a7ef2c350e4955 (MD5) Previous issue date: 1991<br>Resumo: O "Just in Time" é uma filosofia que visa um programa de produção consistente, estimulando a produtividade, eliminando estoques ociosos e melhorando a qualidade do produto. Um dos elementos desta filosofia é o sistema "Kanban" que é um sistem

APA, Harvard, Vancouver, ISO, and other styles

44

Vu, Trong-Tuan. "Heterogeneity and locality-aware work stealing for large scale Branch-and-Bound irregular algorithms." Thesis, Lille 1, 2014. http://www.theses.fr/2014LIL10151/document.

Full text

Abstract:

Les algorithmes Branch-and-Bound (B&B) font partie des méthodes exactes pour la résolution de problèmes d’optimisation combinatoire. Les calculs induits par un algorithme B&B sont extrêmement couteux surtout lorsque des instances de grande tailles sont considérées. Un algorithme B&B peut être vu comme une exploration implicite d’un espace représenté sous la forme d’un arbre qui a pour spécificité d’être hautement irrégulier. Pour accélérer l’exploration de cet espace, les calculs parallèles et distribués à très large échelle sont souvent utilisés. Cependant, atteindre des performan

APA, Harvard, Vancouver, ISO, and other styles

45

Meneguzzi, Cristiane Coutinho. "Modelo de roteamento de veículos aplicado ao planejamento do inventário florestal." Universidade Federal do Espírito Santo, 2011. http://repositorio.ufes.br/handle/10/5808.

Full text

Abstract:

Made available in DSpace on 2016-12-23T13:51:53Z (GMT). No. of bitstreams: 1 Cristiane Coutinho Meneguzzi.pdf: 2106158 bytes, checksum: 65c537220893be6e9c9d64b3001fef07 (MD5) Previous issue date: 2011-10-04<br>Na área florestal, ainda é dada maior ênfase ao desenvolvimento de estudos envolvendo as etapas de colheita e transporte florestal, por serem diretamente responsáveis pelo custo final da madeira. Entretanto, diversas outras etapas possuem grande potencial para estudos, como é o caso do inventário florestal. Informações fornecidas pelo inventário florestal são importantes no planejame

APA, Harvard, Vancouver, ISO, and other styles

46

Oliveira, Marina Lavorato de. "Planejamento integrado da expansão de sistemas de distribuição de energia elétrica." [s.n.], 2010. http://repositorio.unicamp.br/jspui/handle/REPOSIP/260639.

Full text

Abstract:

Orientadores: Ariovaldo Verandio Garcia, Marcos Julio Rider Flores<br>Tese (doutorado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e de Computação<br>Made available in DSpace on 2018-08-15T23:19:01Z (GMT). No. of bitstreams: 1 Oliveira_MarinaLavoratode_D.pdf: 1360671 bytes, checksum: e66710c118252edf8c3638375c56fdc7 (MD5) Previous issue date: 2010<br>Abstract: In this work the Distribution System Integrated Planning (DSIP) problem is modeled as a mixed integer (binary) nonlinear program problem. Two techniques were investigated to solve this problem. First, a specia

APA, Harvard, Vancouver, ISO, and other styles

47

Reis, Marcelo da Silva. "Minimização de funções decomponíveis em curvas em U definidas sobre cadeias de posets -- algoritmos e aplicações." Universidade de São Paulo, 2012. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-05022013-123757/.

Full text

Abstract:

O problema de seleção de características, no contexto de Reconhecimento de Padrões, consiste na escolha de um subconjunto X de um conjunto S de características, de tal forma que X seja \"ótimo\" dentro de algum critério. Supondo a escolha de uma função custo c apropriada, o problema de seleção de características é reduzido a um problema de busca que utiliza c para avaliar os subconjuntos de S e assim detectar um subconjunto de características ótimo. Todavia, o problema de seleção de características é NP-difícil. Na literatura existem diversos algoritmos e heurísticas propostos para abordar est

APA, Harvard, Vancouver, ISO, and other styles

48

Bringmann, Oliver. "Symbolische Interpretation Technischer Zeichnungen." Doctoral thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2003. http://nbn-resolving.de/urn:nbn:de:swb:14-1045648731734-96098.

Full text

Abstract:

Gescannte und vektorisierte technische Zeichnungen werden automatisch unter Nutzung eines Netzes von Modellen in eine hochwertige Datenstruktur migriert. Die Modelle beschreiben die Inhalte der Zeichnungen hierarchisch und deklarativ. Modelle für einzelne Bestandteile der Zeichnungen können paarweise unabhängig entwickelt werden. Dadurch werden auch sehr komplexe Zeichnungsklassen wie Elektroleitungsnetze oder Gebäudepläne zugänglich. Die Modelle verwendet der neue, sogenannte Y-Algorithmus: Hypothesen über die Deutung lokaler Zeichnungsinhalte werden hierarchisch generiert. Treten bei der Nut

APA, Harvard, Vancouver, ISO, and other styles

49

Piva, Breno 1983. "Estudo poliedral do problema do maximo subgrafo induzido comum." [s.n.], 2009. http://repositorio.unicamp.br/jspui/handle/REPOSIP/275833.

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-15T07:24:38Z (GMT). No. of bitstreams: 1 Piva_Breno_M.pdf: 1251793 bytes, checksum: bf559620a7bdefeec032b5c87d196b5b (MD5) Previous issue date: 2009<br>Resumo: O problema do Máximo Subgrafo Induzido Comum (MSIC) pertence a classe NP-difícil e possui aplicações em diversas áreas. Apesar de sua complexidade, ainda é importante conhecer soluções exatas para instâncias deste problema. Os algoritmos exatos encontrados na literatura buscam

APA, Harvard, Vancouver, ISO, and other styles

50

Stithit, Wuttikorn. ""A branch-and-bound priority rule to minimize WIP and tardiness in job-shop problem." Ohio : Ohio University, 1991. http://www.ohiolink.edu/etd/view.cgi?ohiou1183749881.

Full text

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!