Log in

Relevant bibliographies by topics / Polyhedra / Dissertations / Theses

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

Dissertations / Theses on the topic 'Polyhedra'

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 'Polyhedra.'

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

Shang, Hui. "Polyhedrin gene expression on protein production and polyhedra." Miami University / OhioLINK, 2018. http://rave.ohiolink.edu/etdc/view?acc_num=miami1532540645318048.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Eshaq, Hassan. "Polyhedral models." Link to electronic thesis, 2002. http://www.wpi.edu/Pubs/ETD/Available/etd-0501102-141322.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Upadrasta, Ramakrishna. "Sub-Polyhedral Compilation using (Unit-)Two-Variables-Per-Inequality Polyhedra." Phd thesis, Université Paris Sud - Paris XI, 2013. http://tel.archives-ouvertes.fr/tel-00818764.

Full text

Abstract:

The goal of this thesis is to design algorithms that run with better complexity when compiling or parallelizing loop programs. The framework within which our algorithms operate is the polyhedral model of compilation which has been successful in the design and implementation of complex loop nest optimizers and parallelizing compilers. The algorithmic complexity and scalability limitations of the above framework remain one important weakness. We address it by introducing sub-polyhedral compilation by using (Unit-)Two-Variable-Per-Inequality or (U)TVPI Polyhedra, namely polyhedrawith restricted c

APA, Harvard, Vancouver, ISO, and other styles

4

Li, Iila Jingjiao. "Flexible polyhedra : exploring finite mechanisms of triangulated polyhedra." Thesis, University of Cambridge, 2018. https://www.repository.cam.ac.uk/handle/1810/271806.

Full text

Abstract:

In a quest to design novel deployable structures, flexible polyhedra provide interesting insights. This work follows the discovery of flexible polyhedra and aims to make flexible polyhedra more useful. The dissertation describes how flexible polyhedra can be made. The flexible polyhedra first considered in this dissertation have a rotational degree of freedom. The range of this rotational movement is measured and maximised in this work by numerical maximisation. All polyhedra are established computationally: an iterative solution method is used to find vertex coordinates; several clash detecti

APA, Harvard, Vancouver, ISO, and other styles

5

Benton, P. A. "Unfolding polyhedra." Thesis, University of Cambridge, 2008. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.596583.

Full text

Abstract:

It is a common conjecture that all convex polyhedra must be edge-unfoldable but to date a valid proof of this has escaped discovery. This dissertation presents several new directions in the quest for the proof. Also discussed is a method which may lead to a counterexample to the conjecture through the construction of ‘hard to unfold’ polyhedra. Algorithmic solutions are discussed for the task of determining the specific set of edges which must be cut in order that an unfolding not self-intersect. A series of <i>Unfolder </i>algorithms are explored and compared, in terms of both algorithmic des

APA, Harvard, Vancouver, ISO, and other styles

6

Sun, Julie. "Folding Orthogonal Polyhedra." Thesis, Waterloo, Ont. : University of Waterloo [Dept. of Computer Science], 1999. http://etd.uwaterloo.ca/etd/jsun1999.pdf.

Full text

Abstract:

Thesis (M.Math.)-University of Waterloo, 1999.<br>Includes bibliographical references (leaves 42-44). Issued also in PDF format and available via the World Wide Web. Requires Internet connectivity, World Wide Web browser, and Adobe Acrobat Reader.

APA, Harvard, Vancouver, ISO, and other styles

7

Chang, Shiow-Yun. "2-lattice polyhedra." Diss., Georgia Institute of Technology, 1993. http://hdl.handle.net/1853/25704.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Lucier, Brendan. "Unfolding and Reconstructing Polyhedra." Thesis, University of Waterloo, 2006. http://hdl.handle.net/10012/1037.

Full text

Abstract:

This thesis covers work on two topics: unfolding polyhedra into the plane and reconstructing polyhedra from partial information. For each topic, we describe previous work in the area and present an array of new research and results. Our work on unfolding is motivated by the problem of characterizing precisely when overlaps will occur when a polyhedron is cut along edges and unfolded. By contrast to previous work, we begin by classifying overlaps according to a notion of locality. This classification enables us to focus upon particular types of overlaps, and use the results to c

APA, Harvard, Vancouver, ISO, and other styles

9

ALOE, FRANCESCO. "INTERMEDIATE LOGICS AND POLYHEDRA." Doctoral thesis, Università degli Studi di Milano, 2018. http://hdl.handle.net/2434/585697.

Full text

Abstract:

Polyhedra enjoy a peculiar property: every geometric shape with a certain “regularity” – in specific terms, certain classes of (closed) topological manifolds – can be captured by a polyhedron via triangulation, that is, by subdividing the geometric shapes into appropriate “triangles”, called simplices (which, in the 1- and 0-dimensional case, are simply edges and vertices, respectively). Therefore, one might well wonder: what is the intermediate logic of the class of triangulable topological manifolds of a given dimension d? The main result of the present work is to give the answer to this que

APA, Harvard, Vancouver, ISO, and other styles

10

Chan, Chi Kin. "On the classification of polyhedra /." View abstract or full-text, 2007. http://library.ust.hk/cgi/db/thesis.pl?MATH%202007%20CHAN.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Rostami, M. "Symmetry types of convex polyhedra." Thesis, University of Southampton, 1987. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.375365.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Nyberg, Henrik. "Convex decomposition of polyhedra for AVAL." Thesis, Umeå University, Department of Computing Science, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-32348.

Full text

Abstract:

<p>In order to perform vulnerability and lethality simulations of vehicles it is necessary to describe their geometry in terms suitable for simulation. AVAL is a piece of software used for such simulations, and a main requirement for input geometry is convexity. Manual decomposition is highly time consuming, and in this thesis, a complete algorithm to perform an automatic convex decomposition is presented and described in more detail than previously done. A proof of concept implementation of the algorithm has been made and tested, and example decompositions are shown. The algorithm is based st

APA, Harvard, Vancouver, ISO, and other styles

13

Ji, Xiaoyun. "Molecular interactions within insect virus polyhedra." Thesis, University of Oxford, 2010. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.540298.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Shiralizadeh, Farzaneh. "From ligand polyhedra to organometallic clusters." Thesis, University of Cambridge, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.624381.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Zhang, Fan Carleton University Dissertation Mathematics. "Degree sequence polyhedra and separation algorithms." Ottawa, 1992.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

16

Mohanty, Yana Zilberberg. "Hyperbolic polyhedra : volume and scissors congruence /." Diss., Connect to a 24 p. preview or request complete full text in PDF format. Access restricted to UC campuses, 2002. http://wwwlib.umi.com/cr/ucsd/fullcit?p3061637.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Hasan, Masud. "Reconstruction and Visualization of Polyhedra Using Projections." Thesis, University of Waterloo, 2005. http://hdl.handle.net/10012/1135.

Full text

Abstract:

Two types of problems are studied in this thesis: reconstruction and visualization of polygons and polyhedra. <br /><br /> Three problems are considered in reconstruction of polygons and polyhedra, given a set of projection characteristics. The first problem is to reconstruct a closed convex polygon (polyhedron) given the number of visible edges (faces) from each of a set of directions <em>S</em>. The main results for this problem include the necessary and sufficient conditions for the existence of a polygon that realizes the projections. This characterization gives an alg

APA, Harvard, Vancouver, ISO, and other styles

18

Magnanti, Thomas L., and Prakash Mirchandani. "Shortest Paths, Network Design and Associated Polyhedra." Massachusetts Institute of Technology, Operations Research Center, 1990. http://hdl.handle.net/1721.1/5186.

Full text

Abstract:

We study a specialized version of network design problems that arise in telecommunication, transportation and other industries. The problem, a generalization of the shortest path problem, is defined on an undirected network consisting of a set of arcs on which we can install (load), at a cost, a choice of up to three types of capacitated facilities. Our objective is to determine the configuration of facilities to load on each arc that will satisfy the demand of a single commodity at the lowest possible cost. Our results (i) demonstrate that the single-facility loading problem and certain "comm

APA, Harvard, Vancouver, ISO, and other styles

19

Araque, Jésus Rafael, Leslie A. Hall, and Thomas L. Magnanti. "Capacitated Trees, Capacitated Routing, and Associated Polyhedra." Massachusetts Institute of Technology, Operations Research Center, 1990. http://hdl.handle.net/1721.1/5194.

Full text

Abstract:

We study the polyhedral structure of two related core combinatorial problems: the subtree cardinalityconstrained minimal spanning tree problem and the identical customer vehicle routing problem. For each of these problems, and for a forest relaxation of the minimal spanning tree problem, we introduce a number of new valid inequalities and specify conditions for ensuring when these inequalities are facets for the associated integer polyhedra. The inequalities are defined by one of several underlying support graphs: (i) a multistar, a "star" with a clique replacing the central vertex; (ii) a cli

APA, Harvard, Vancouver, ISO, and other styles

20

Call, Mikael. "Shortest Path Routing Modelling, Infeasibility and Polyhedra." Doctoral thesis, Linköpings universitet, Optimeringslära, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-85547.

Full text

Abstract:

The Internet is constantly growing but the available resources, i.e. bandwidth, are limited. Using bandwidth efficiently to provide high quality of service to users is referred to as traffic engineering. This is of utmost importance. Traffic in IP networks is commonly routed along shortest paths with respect to auxiliary link weights, e.g. using the OSPF or IS-IS protocol. Here, shortest path routing is indirectly controlled via the link weights only, and it is therefore crucial to have a profound understanding of the shortest path routing mechanism to solve traffic engineering problems in IP

APA, Harvard, Vancouver, ISO, and other styles

21

Kaluzny, Bohdan Lubomyr. "Linear programming : pivoting on polyhedra and arrangements." Thesis, McGill University, 2005. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=100633.

Full text

Abstract:

Linear programming is perhaps the most useful tool in optimization, much of it's success owed to the efficiency of the simplex method in practice --- its ability to solve problems with millions of variables with relative ease. However, whether there exists a strongly polynomial algorithm to solve linear programming remains an open question. Pivot methods, including the simplex method, remain the best hope for finding such an algorithm, despite the fact that almost all variants have been shown to require exponential time on special instances. Fundamental questions about the path length (number

APA, Harvard, Vancouver, ISO, and other styles

22

Fung, Ping-yuen, and 馮秉遠. "Approximation for minimum triangulations of convex polyhedra." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2001. http://hub.hku.hk/bib/B29809964.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

D'Andrea, Joy. "Fundamental Transversals on the Complexes of Polyhedra." Scholar Commons, 2011. http://scholarcommons.usf.edu/etd/3746.

Full text

Abstract:

We present a formal description of `Face Fundamental Transversals' on the faces of the Complexes of polyhedra (meaning threedimensional polytopes). A Complex of a polyhedron is the collection of the vertex points of the polyhedron, line segment edges and polygonal faces of the polyhedron. We will prove that for the faces of any 3-dimensional complex of a polyhedron under face adjacency relations, that a `Face Fundamental Transversal' exists, and it is a union of the connected orbits of faces that are intersected exactly once. While exploring the problem of finding a face fundamental transversa

APA, Harvard, Vancouver, ISO, and other styles

24

Freitas, Julio Cesar Matias de. "Working polyhedra through cooperative learning using software." Universidade Federal do CearÃ, 2015. http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=15796.

Full text

Abstract:

CoordenaÃÃo de AperfeÃoamento de Pessoal de NÃvel Superior<br>Este trabalho tem como tema central a aplicaÃÃo de tÃcnicas de ensino de geometria espacial em especial o ensino de poliedros, destacando-se o Teorema de Euler e os poliedros regulares (poliedros de PlatÃo). Analisamos as definiÃÃes, teoremas e suas demonstraÃÃes, destacando-se um pouco da histÃria do matemÃtico Leonhardo Euler, e as curiosidades acerca do seu teorema para poliedros. Discutimos ainda as dificuldades educacionais do ensino de matemÃtica e os elementos que podem estar ligados a essa dificuldade como tambÃm alternativ

APA, Harvard, Vancouver, ISO, and other styles

25

Kirpichnikova, Anna. "Inverse boundary spectral problem for Riemannian polyhedra." Thesis, Loughborough University, 2006. https://dspace.lboro.ac.uk/2134/35982.

Full text

Abstract:

The object under consideration is an admissible Riemannian polyhedron M with a piece-wise smooth boundary δM. This is a finite n-dimensional simplicial complex equipped with a family of Riemannian metrics smooth inside each simplex. We introduce an anisotropic Dirichlet Laplace operator in a weak sense for the admissible Riemannian polyhedron and define a set of boundary spectral data Γ, {λκ, δυφκ|Γ}∞κ=1 on an open part Γ ∩ δM, where λκ are the eigenvalues on Γ and δυφκ|Γ are the traces of normal derivatives of eigenfunctions of the Laplacian. The main result of the work is: if two admissible

APA, Harvard, Vancouver, ISO, and other styles

26

Taktak, Raouia. "Survavibility in Multilayer Networks : models and Polyhedra." Thesis, Paris 9, 2013. http://www.theses.fr/2013PA090076/document.

Full text

Abstract:

Dans cette thèse, nous nous intéressons à un problème de fiabilité dans les réseaux multicouches IP-sur-WDM. Etant donné un ensemble de demandes pour lesquelles on connaît une topologie fiable dans la couche IP, le problème consiste à sécuriser la couche optique WDM en y cherchant une topologie fiable. Nous montrons que le problème est NP-complet même dans le cas d'une seule demande. Ensuite, nous proposons quatre formulations en termes de programmes linéaires en nombres entiers pour le problème. La première est basée sur les contraintes de coupes. Nous considérons le polyèdre associé. Nous id

APA, Harvard, Vancouver, ISO, and other styles

27

Bolton, Jennifer Elaine. "Synchronized simultaneous lifting in binary knapsack polyhedra." Thesis, Manhattan, Kan. : Kansas State University, 2009. http://hdl.handle.net/2097/2304.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Fung, Ping-yuen. "Approximation for minimum triangulations of convex polyhedra." Hong Kong : University of Hong Kong, 2001. http://sunzi.lib.hku.hk/hkuto/record.jsp?B23273197.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Williams, Gordon. "Petrie schemes /." Thesis, Connect to this title online; UW restricted, 2002. http://hdl.handle.net/1773/5777.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Kokotin, Valentin. "Polyhedra-based analysis of computer simulated amorphous structures." Doctoral thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2010. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-38597.

Full text

Abstract:

Bulk metallic glasses represent a newly developed class of materials. Some metallic glasses possess combinations of very good or even excellent mechanical, chemical and/or magnetic properties uncovering a broad range of both industrial and vital applications. Besides all advantages metallic glasses have also significant drawbacks, which have to be overcome for commercial application. Apart from low critical thicknesses, brittleness and chemical inhomogeneity one important problem of metallic glasses is the lack of an appropriate theory describing their structure. Therefore, the search for new

APA, Harvard, Vancouver, ISO, and other styles

31

Zhao, Jinhua. "Maximum Bounded Rooted-Tree Problem : Algorithms and Polyhedra." Thesis, Université Clermont Auvergne‎ (2017-2020), 2017. http://www.theses.fr/2017CLFAC044/document.

Full text

Abstract:

Étant donnés un graphe simple non orienté G = (V, E) et un sommet particulier r dans V appelé racine, un arbre enraciné, ou r-arbre, de G est soit le graphe nul soit un arbre contenant r. Si un vecteur de capacités sur les sommets est donné, un sous-graphe de G est dit borné si le degré de chaque sommet dans le sous-graphe est inférieur ou égal à sa capacité. Soit w un vecteur de poids sur les arêtes et p un vecteur de profits sur les sommets. Le problème du r-arbre borné maximum (MBrT, de l’anglais Maximum Bounded r-Tree) consiste à trouver un r-arbre borné T = (U, F) de G t

APA, Harvard, Vancouver, ISO, and other styles

32

Melo, Henrique Alves de. "Euler's formula in the plan and for polyhedra." Universidade Federal do CearÃ, 2013. http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=11431.

Full text

Abstract:

CoordenaÃÃo de AperfeiÃoamento de Pessoal de NÃvel Superior<br>Polyhedra are geometric solids formed by a ﬁnite number of polygons they can be convex or non-convex, regular or not regular. This work we make three demonstrations of Eulerâs theorem for polyhedra in one plane being used graphs. We will adopt preliminary deﬁnitions of polygons, polyhedra and graphs and make a brief study of the theorem before the demonstrations analysis when the theorem is valid and what conditions exist polyhedra, since the theorem is accepted. The work brings some applications in the form of questi

APA, Harvard, Vancouver, ISO, and other styles

33

Theis, Dirk Oliver. "Polyhedra and algorithms for the general routing problem." [S.l. : s.n.], 2005. http://nbn-resolving.de/urn:nbn:de:bsz:16-opus-61791.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Pandullo, Marco. "Metallosupramolecular polyhedra for inclusion in multicomponent co-crystals." Thesis, Queensland University of Technology, 2022. https://eprints.qut.edu.au/232691/1/Marco_Pandullo_Thesis.pdf.

Full text

Abstract:

This project investigated the effects of co-crystallisation on hierarchical assembly and solid-state stability of metallosupramolecular cages of Fe(II), Co(II) and Co(III). The prospects for encapsulating and/or connecting the metallosupramolecular cages with halogen bonded intermolecular networks were explored. A wide range of analyses were performed, both in solution and in the solid state, to assess the chemical and structural diversity resulting from the inclusion of halogen bonding components within crystals of these novel metal complexes.

APA, Harvard, Vancouver, ISO, and other styles

35

Meagher, Conor John. "On the directed cut polyhedra and open pit mining." Thesis, McGill University, 2011. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=96733.

Full text

Abstract:

Many aspects of open pit mine planning can be modelled as a combinatorial optimization problem. This thesis reviews some existing mine scheduling methods and some of their short comings. Many of the problems are related to the partially ordered knapsack problem with multiple knapsack constraints. This is a special case of a maximum directed cut problem with multiple knapsack constraints on the arcs in the cut.The major contribution of this thesis is the study of the directed cut polytopeand cone, which are the convex hull and positive hull of all directed cut vectors ofa complete directed grap

APA, Harvard, Vancouver, ISO, and other styles

36

Thomas, Briony Gemma. "The application of geometric symmetry to tilings and polyhedra." Thesis, University of Leeds, 2007. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.445388.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Krishnan, Sriram 1978 May. "Rapid detection of shallow penetration between non-convex polyhedra." Thesis, Massachusetts Institute of Technology, 2001. http://hdl.handle.net/1721.1/91378.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Roitman, Pedro. "One periodic Bryant surfaces and rigidity for generalized polyhedra." Paris 7, 2001. http://www.theses.fr/2001PA077050.

Full text

Abstract:

Dans la premiere partie de ce travail, nous nous interessons a des surfaces de bryant, i. E. Des surfaces a courbure moyenne egale a un dans l'espace hyperbolique, invariantes par l'action d'une translation parabolique, et nous les appelons surfaces de bryant 1-periodiques. Notre premier resultat est le suivante : topologie finie dans l'espace quotient implique courbure total finie dans l'espace quotient pour les surfaces de bryant 1-periodiques proprement plongees. Notre etude se poursuit par l'analyse du cas ou les surfaces de bryant 1-periodiques peuvent etre decrites comme etant des graphe

APA, Harvard, Vancouver, ISO, and other styles

39

Hill, Frances Cull. "Bonding properties of coordinated polyhedra in molecules and crystals." Diss., This resource online, 1995. http://scholar.lib.vt.edu/theses/available/etd-10042006-143903/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Abdullahi, Sammani Danwawu. "Vertex enumeration and counting for certain classes of polyhedra." Thesis, University of Leeds, 2002. http://etheses.whiterose.ac.uk/1308/.

Full text

Abstract:

Vertex enumeration (VE) algorithms explore the problem of listing some or all solutions that lie at corners of a convex polyhedron defined by a set of linear inequalities. Many algorithms have been developed for general polytopes. The most successful of these, from both an empirical and theoretical viewpoint, are based on pivoting. Dyer [24] gives an algorithm for simple polytopes which runs in time O (mn^2) per vertex. In this thesis we concentrate on the VE problem for certain special classes of polyhedron. We also address the problem of (approximately) counting the vertices without listing

APA, Harvard, Vancouver, ISO, and other styles

41

Christiansen, Tom. "Stochastic calculus in Riemannian polyhedra and martingales in metric spaces." [S.l.] : [s.n.], 2007. http://deposit.ddb.de/cgi-bin/dokserv?idn=983734232.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Bougard, Nicolas. "Regular graphs and convex polyhedra with prescribed numbers of orbits." Doctoral thesis, Universite Libre de Bruxelles, 2007. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/210688.

Full text

Abstract:

Etant donné trois entiers k, s et a, nous prouvons dans le premier chapitre qu'il existe un graphe k-régulier fini (resp. un graphe k-régulier connexe fini) dont le groupe d'automorphismes a exactement s orbites sur l'ensemble des sommets et a orbites sur l'ensemble des arêtes si et seulement si<p><p>(s,a)=(1,0) si k=0,<p>(s,a)=(1,1) si k=1,<p>s=a>0 si k=2,<p>0< s <= 2a <= 2ks si k>2.<p><p>(resp.<p>(s,a)=(1,0) si k=0,<p>(s,a)=(1,1) si k=1 ou 2,<p>s-1<=a<=(k-1)s+1 et s,a>0 si k>2.)<p><p>Nous étudions les polyèdres convexes de R³ dans le second chapitre. Pour tout polyèdre convexe P, nous notons

APA, Harvard, Vancouver, ISO, and other styles

43

Saads, Silvia Maria Leao. "Learning about polyhedra through visual and tactile perception and discussion." Thesis, University of Southampton, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.326581.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Magnouche, Youcef. "The multi-terminal vertex separator problem : Complexity, Polyhedra and Algorithms." Thesis, Paris Sciences et Lettres (ComUE), 2017. http://www.theses.fr/2017PSLED020/document.

Full text

Abstract:

Étant donné un graphe G = (V U T, E), tel que V U T représente l'ensemble des sommets où T est un ensemble de terminaux, et une fonction poids w associée aux sommets non terminaux, le problème du séparateur de poids minimum consiste à partitionner V U T en k + 1 sous-ensembles {S, V1,..., Vk} tel qu'il n'y a aucune arête entre deux sous-ensembles différents Vi et Vj, chaque Vi contient exactement un terminal et le poids de S est minimum. Dans cette thèse, nous étudions le problème d'un point de vue polyèdral. Nous donnons deux formulations en nombres entiers pour le problème, et pour une de ce

APA, Harvard, Vancouver, ISO, and other styles

45

Brown, Stephen A. "The response of polyhedra in close packed structures to temperature and pressure." Thesis, This resource online, 1993. http://scholar.lib.vt.edu/theses/available/etd-11102009-020124/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Keha, Ahmet B. "A polyhedral study of nonconvex piecewise linear optimization." Diss., Available online, Georgia Institute of Technology, 2004:, 2003. http://etd.gatech.edu/theses/available/etd-04052004-180030/unrestricted/keha%5Fahmet%5Fb%5F200312%5Fphd.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Hunsaker, Braden K. "Measuring facets of polyhedra to predict usefulness in branch-and-cut algorithms." Diss., Available online, Georgia Institute of Technology, 2004:, 2003. http://etd.gatech.edu/theses/available/etd-04082004-180242/unrestricted/hunsaker%5Fbraden%5Fk%5F200312%5Fphd.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Cerrone, Kathryn L. "TESSELLATIONS: LESSONS FOR EVERY AGE." University of Akron / OhioLINK, 2006. http://rave.ohiolink.edu/etdc/view?acc_num=akron1151427935.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Pfetsch, Marc E. "The maximum feasible subsystem problem and vertex facet incidences of polyhedra." [S.l.] : [s.n.], 2002. http://deposit.ddb.de/cgi-bin/dokserv?idn=966162846.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Albalad, Alcalá Jorge. "Post-Synthetic Modification of Metal-Organic Frameworks (MOFs) and Polyhedra (MOPs)." Doctoral thesis, Universitat Autònoma de Barcelona, 2019. http://hdl.handle.net/10803/670090.

Full text

Abstract:

Aquesta Tesi ha estat dedicada al disseny i implementació de noves tècniques de modificació post-sintètica (PSM) aplicades a material metal·loorgànics, principalment polímers de coordinació (CPs), xarxes metal·loorgàniques (MOFs) i políedres metal·loorgànics (MOPs), per tal de modificar les seves propietats fisicoquímiques a nivells inaccessibles a través de metodologies comuns de síntesi directa. La Tesi comença oferint una breu recapitulació bibliogràfica del camp dels materials metal·loorgànics, des dels seus inicis fins a la seva aplicació actual i perspectives de futur. Aquest capí

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!