Conecte-se

Bibliografias temáticas / Linear programming / Teses / dissertações

Siga este link para ver outros tipos de publicações sobre o tema: Linear programming.

Teses / dissertações sobre o tema "Linear programming"

Autor: Grafiati

Publicado: 4 de junho de 2021

Última modificação: 25 de julho de 2025

Crie uma referência precisa em APA, MLA, Chicago, Harvard, e outros estilos

Selecione um tipo de fonte:

Veja os 50 melhores trabalhos (teses / dissertações) para estudos sobre o assunto "Linear programming".

Ao lado de cada fonte na lista de referências, há um botão "Adicionar à bibliografia". Clique e geraremos automaticamente a citação bibliográfica do trabalho escolhido no estilo de citação de que você precisa: APA, MLA, Harvard, Chicago, Vancouver, etc.

Você também pode baixar o texto completo da publicação científica em formato .pdf e ler o resumo do trabalho online se estiver presente nos metadados.

Veja as teses / dissertações das mais diversas áreas científicas e compile uma bibliografia correta.

1

Andreotti, Sandro [Verfasser]. "Linear Programming and Integer Linear Programming in Bioinformatics / Sandro Andreotti." Berlin : Freie Universität Berlin, 2015. http://d-nb.info/1066645213/34.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

2

Sarrabezolles, Pauline. "Colourful linear programming." Thesis, Paris Est, 2015. http://www.theses.fr/2015PESC1033/document.

Texto completo da fonte

Resumo:

Le théorème de Carathéodory coloré, prouvé en 1982 par Bárány, énonce le résultat suivant. Etant donnés d Å1 ensembles de points S1,SdÅ1 dans Rd , si chaque Si contient 0 dans son enveloppe convexe, alors il existe un sous-ensemble arc-en-ciel T µ SdÅ1 iÆ1 Si contenant 0 dans son enveloppe convexe, i.e. un sous-ensemble T tel que jT \Si j • 1 pour tout i et tel que 0 2 conv(T ). Ce théorème a donné naissance à de nombreuses questions, certaines algorithmiques et d’autres plus combinatoires. Dans ce manuscrit, nous nous intéressons à ces deux aspects. En 1997, Bárány et Onn ont défini la progra

Estilos ABNT, Harvard, Vancouver, APA, etc.

3

Espinoza, Daniel G. "On Linear Programming, Integer Programming and Cutting Planes." Diss., Georgia Institute of Technology, 2006. http://hdl.handle.net/1853/10482.

Texto completo da fonte

Resumo:

In this thesis we address three related topic in the field of Operations Research. Firstly we discuss the problems and limitation of most common solvers for linear programming, precision. We then present a solver that generate rational optimal solutions to linear programming problems by solving a succession of (increasingly more precise) floating point approximations of the original rational problem until the rational optimality conditions are achieved. This method is shown to be (on average) only 20% slower than the common pure floating point approach, while returning true optimal solutions

Estilos ABNT, Harvard, Vancouver, APA, etc.

4

Wei, Hua. "Numerical Stability in Linear Programming and Semidefinite Programming." Thesis, University of Waterloo, 2006. http://hdl.handle.net/10012/2922.

Texto completo da fonte

Resumo:

We study numerical stability for interior-point methods applied to Linear Programming, LP, and Semidefinite Programming, SDP. We analyze the difficulties inherent in current methods and present robust algorithms. <br /><br /> We start with the error bound analysis of the search directions for the normal equation approach for LP. Our error analysis explains the surprising fact that the ill-conditioning is not a significant problem for the normal equation system. We also explain why most of the popular LP solvers have a default stop tolerance of only 10<sup>-8</sup> when the

Estilos ABNT, Harvard, Vancouver, APA, etc.

5

Wolf, Jan [Verfasser]. "Quantified Linear Programming / Jan Wolf." Aachen : Shaker, 2015. http://d-nb.info/1074087275/34.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

6

Sjöström, Henrik. "Pivoting methods for linear programming." Thesis, KTH, Matematik (Inst.), 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-98977.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

7

Price, C. J. "Non-linear semi-infinite programming." Thesis, University of Canterbury. Mathematics and Statistics, 1992. http://hdl.handle.net/10092/7920.

Texto completo da fonte

Resumo:

Optimisation problems occur in many branches of science, engineering, and economics, as well as in other areas. The diversity of the various types of optimisation problems is extremely large, and so a unified approach is not attempted here. This thesis concentrates on a specific type of problem: non-linear semi-infinite programming.

Estilos ABNT, Harvard, Vancouver, APA, etc.

8

Wu, S. Y. "Linear programming on measure spaces." Thesis, University of Cambridge, 1985. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.372925.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

9

DIAS, DOUGLAS MOTA. "QUANTUM-INSPIRED LINEAR GENETIC PROGRAMMING." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2010. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=17544@1.

Texto completo da fonte

Resumo:

COORDENAÇÃO DE APERFEIÇOAMENTO DO PESSOAL DE ENSINO SUPERIOR<br>A superioridade de desempenho dos algoritmos quânticos, em alguns problemas específicos, reside no uso direto de fenômenos da mecânica quântica para realizar operações com dados em computadores quânticos. Esta característica fez surgir uma nova abordagem, denominada Computação com Inspiração Quântica, cujo objetivo é criar algoritmos clássicos (executados em computadores clássicos) que tirem proveito de princípios da mecânica quântica para melhorar seu desempenho. Neste sentido, alguns algoritmos evolutivos com inspiração quântica

Estilos ABNT, Harvard, Vancouver, APA, etc.

10

Ramadan, Khaled Carleton University Dissertation Mathematics and Statistics. "Linear programming with interval coefficients." Ottawa, 1996.

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

11

Sadhana, Vishnu V. "Efficient presolving in linear programming." [Gainesville, Fla.] : University of Florida, 2002. http://purl.fcla.edu/fcla/etd/UFE1000157.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

12

Ilyes, Amy Louise. "Using linear programming to solve convex quadratic programming problems." Case Western Reserve University School of Graduate Studies / OhioLINK, 1993. http://rave.ohiolink.edu/etdc/view?acc_num=case1056644216.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

13

Gassmann, Horand Ingo. "Multi-period stochastic programming." Thesis, University of British Columbia, 1987. http://hdl.handle.net/2429/27304.

Texto completo da fonte

Resumo:

This dissertation presents various aspects of the solution of the linear multi-period stochastic programming problem. Under relatively mild assumptions on the structure of the random variables present in the problem, the value function at every time stage is shown to be jointly convex in the history of the process, namely the random variables observed so far as well as the decisions taken up to that point. Convexity enables the construction of both upper and lower bounds on the value of the entire problem by suitable discretization of the random variables. These bounds are developed in Chapte

Estilos ABNT, Harvard, Vancouver, APA, etc.

14

Eldhuset, Åsmund. "Linear Programming on the Cell/BE." Thesis, Norwegian University of Science and Technology, Department of Computer and Information Science, 2009. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-9091.

Texto completo da fonte

Resumo:

<p>Linear programming is a form of mathematical optimisation in which one seeks to optimise a linear function subject to linear constraints on the variables. It is a very versatile tool that has many important applications, one of them being modelling of production and trade in the petroleum industry. The Cell Broadband Engine, developed by IBM, Sony and Toshiba, is an innovative multicore architecture that has already been proven to have a great potential for high performance computing. However, developing applications for the Cell/BE is challenging, particularily due to the low-level memory

Estilos ABNT, Harvard, Vancouver, APA, etc.

15

Leong, Fu Fai. "Application of linear programming in Sudoku." Thesis, University of Macau, 2006. http://umaclib3.umac.mo/record=b1636813.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

16

Mohyedin, Kermani Ehsan. "Distributed linear programming with Apache Spark." Thesis, University of British Columbia, 2016. http://hdl.handle.net/2429/59990.

Texto completo da fonte

Resumo:

For this thesis project, we have implemented Mehrotra's predictor-corrector interior point algorithm on top of Apache Spark for solving large-scale linear programming problems. Our large-scale solver (Spark-LP) is unique because it is open-source, fault-tolerant and can be used on commodity cluster of machines. As a result, Spark-LP provides an opportunity to solve large-scale problems at the lowest possible cost. We have assessed the performance and convergent results of our solver on self-generated, sparse and dense large-scale problems over small to medium-sized clusters, composed of 16 to

Estilos ABNT, Harvard, Vancouver, APA, etc.

17

Kaseke, Evans. "Fuzzy linear programming and reservoir management." Thesis, University of British Columbia, 1987. http://hdl.handle.net/2429/26708.

Texto completo da fonte

Resumo:

The presence of imprecision in parameter specification of water resources management problems leads to the formulation of fuzzy programming models. This thesis presents the formulation of a two-reservoir system problem as a fuzzy L.P. model. The aim is to determine if larger monetary benefits, over and above the usual benefits, can be obtained from the system. The other aim is to determine if desired industrial and domestic water allocations, as well as outflows for selected periods can be achieved. The problem is formulated as a conventional L.P. model. Then selected water allocations and

Estilos ABNT, Harvard, Vancouver, APA, etc.

18

Karamalis, Constantinos. "Data perturbation analyses for linear programming." Thesis, University of Ottawa (Canada), 1994. http://hdl.handle.net/10393/6709.

Texto completo da fonte

Resumo:

This thesis focuses on several aspects of data perturbation for Linear Programming. Classical questions of degeneracy and post-optimal analysis are given a unified presentation, in a view of new interior point methods of linear programming. The performance of these methods is compared to the simplex algorithm; interior point methods are shown to alleviate some difficulties of representation and solution of linear programs. An affine scaling algorithm is implemented in conjunction with a simple rounding heuristic to asses the benefit of interior point trajectories to provide approximate solutio

Estilos ABNT, Harvard, Vancouver, APA, etc.

19

Brameier, Markus [Verfasser]. "On linear genetic programming / Markus Brameier." Dortmund : Universitätsbibliothek Technische Universität Dortmund, 2005. http://d-nb.info/1011533146/34.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

20

Mohamed, Radzi Nor Haizan. "Multi-objective planning using linear programming." Thesis, University of Strathclyde, 2010. http://oleg.lib.strath.ac.uk:80/R/?func=dbin-jump-full&object_id=15344.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

21

TORTORELLI, MARCUS MAGNO FERNANDES. "CENTRAL PATH ALGORITHMS FOR LINEAR PROGRAMMING." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 1991. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=9405@1.

Texto completo da fonte

Resumo:

Neste trabalho estudamos os algoritmos de Pontos Interiores para programação Linear. Publicados após o Algoritmo de Karmarkar. Que seguem, de algum modo, a Trajetória Central. São considerados tanto algoritmos Primais quanto Primais-Duais e também verificadas a eficácia da aplicação da metodologia de busca bidirecional. Estes métodos foram implementados e testados resolvendo um conjunto de problemas gerados aleatoriamente. Através da comparação dos resultados analisamos o desempenho das diferentes metodologias.<br>We study here the Interior Points Algorithms for Linear Programming, developed a

Estilos ABNT, Harvard, Vancouver, APA, etc.

22

Epstein, Rafael 1961. "Linear programming and capacitated network loading." Thesis, Massachusetts Institute of Technology, 1998. http://hdl.handle.net/1721.1/10057.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

23

Sharma, Vivek Narain. "Linear programming and quadratic programming approach for graduation in fuzzy environment." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2001. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/MQ57577.pdf.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

24

Edlund, Ove. "Solution of linear programming and non-linear regression problems using linear M-estimation methods /." Luleå, 1999. http://epubl.luth.se/1402-1544/1999/17/index.html.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

25

Kästner, Daniel. "Retargetable postpass optimisation by integer linear programming." [S.l.] : [s.n.], 2000. http://deposit.ddb.de/cgi-bin/dokserv?idn=972330917.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

26

Stoutchinin, Artour V. "Optimal software pipelining, integer linear programming approach." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk2/tape16/PQDD_0002/MQ29793.pdf.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

27

Kong, Seunghyun. "Linear programming algorithms using least-squares method." Diss., Available online, Georgia Institute of Technology, 2007, 2007. http://etd.gatech.edu/theses/available/etd-04012007-010244/.

Texto completo da fonte

Resumo:

Thesis (Ph. D.)--Industrial and Systems Engineering, Georgia Institute of Technology, 2007.<br>Martin Savelsbergh, Committee Member ; Joel Sokol, Committee Member ; Earl Barnes, Committee Co-Chair ; Ellis L. Johnson, Committee Chair ; Prasad Tetali, Committee Member.

Estilos ABNT, Harvard, Vancouver, APA, etc.

28

Stoutchinin, Artour V. "Optimal software pipelining : integer linear programming approach." Thesis, McGill University, 1996. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=27418.

Texto completo da fonte

Resumo:

In optimizing the code for high-performance processors, software pipelining of innermost loops is of fundamental importance. In order to benefit from software pipelining, it is essential to: (i) find the rate-optimal legal schedule, and (ii) allocate registers to the found schedule (it must fit into the limited number of available machine registers). This thesis deals with the development of a software pipeliner that produces the best possible schedules in terms of required registers, thus, assisting register allocation.<br>Software pipelining and register allocation can be formulated as an in

Estilos ABNT, Harvard, Vancouver, APA, etc.

29

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.

Texto completo da fonte

Resumo:

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

Estilos ABNT, Harvard, Vancouver, APA, etc.

30

Lewis, A. "Extreme point methods for infinite linear programming." Thesis, University of Cambridge, 1986. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.384548.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

31

Panagiotopoulos, Apostolos. "Optimising time series forecasts through linear programming." Thesis, University of Nottingham, 2012. http://eprints.nottingham.ac.uk/12515/.

Texto completo da fonte

Resumo:

This study explores the usage of linear programming (LP) as a tool to optimise the parameters of time series forecasting models. LP is the most well-known tool in the field of operational research and it has been used for a wide range of optimisation problems. Nonetheless, there are very few applications in forecasting and all of them are limited to causal modelling. The rationale behind this study is that time series forecasting problems can be treated as optimisation problems, where the objective is to minimise the forecasting error. The research topic is very interesting from a theoretical

Estilos ABNT, Harvard, Vancouver, APA, etc.

32

GANDOLPHO, ANDRE ALVES. "METHODOLOGY FOR SOLVING FUZZY LINEAR PROGRAMMING PROBLEMS." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2005. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=8070@1.

Texto completo da fonte

Resumo:

COORDENAÇÃO DE APERFEIÇOAMENTO DO PESSOAL DE ENSINO SUPERIOR<br>Esta tese propõe uma metodologia para obter uma solução para problemas de programação linear fuzzy. A metodologia aqui descrita apresenta um conjunto de soluções em que tanto os valores das variáveis quanto o valor ótimo para a função de custo, ou função objetivo, possuem uma faixa de valores possíveis. Assim, é possível fornecer um conjunto de soluções factíveis que atendam a diferentes cenários, além de fornecer ao tomador de decisões uma ferramenta de análise mais útil, permitindo que sejam analisadas outras soluções p

Estilos ABNT, Harvard, Vancouver, APA, etc.

33

Richards, Arthur George 1977. "Trajectory optimization using mixed-integer linear programming." Thesis, Massachusetts Institute of Technology, 2002. http://hdl.handle.net/1721.1/16873.

Texto completo da fonte

Resumo:

Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Aeronautics and Astronautics, 2002.<br>Includes bibliographical references (p. 121-129).<br>This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.<br>This thesis presents methods for finding optimal trajectories for vehicles subjected to avoidance and assignment requirements. The former include avoidance of collisions with obstacles or other vehicles and avoidance of thruster plumes from spacecraft. Assignment refers to the inclusion of deci

Estilos ABNT, Harvard, Vancouver, APA, etc.

34

Luo, Xiaodong. "Continuous linear programming : theory, algorithms and applications." Thesis, Massachusetts Institute of Technology, 1995. http://hdl.handle.net/1721.1/10591.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

35

Feldman, Jon 1975. "Decoding error-correcting codes via linear programming." Thesis, Massachusetts Institute of Technology, 2003. http://hdl.handle.net/1721.1/42831.

Texto completo da fonte

Resumo:

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2003.<br>Includes bibliographical references (p. 147-151).<br>Error-correcting codes are fundamental tools used to transmit digital information over unreliable channels. Their study goes back to the work of Hamming [Ham50] and Shannon [Sha48], who used them as the basis for the field of information theory. The problem of decoding the original information up to the full error-correcting potential of the system is often very complex, especially for modern codes that approach the theoreti

Estilos ABNT, Harvard, Vancouver, APA, etc.

36

Cartis, Coralia. "On interior point methods for linear programming." Thesis, University of Cambridge, 2005. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.614693.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

37

Planes, Francisco J. "Metabolic pathway analysis via integer linear programming." Thesis, Brunel University, 2008. http://bura.brunel.ac.uk/handle/2438/6134.

Texto completo da fonte

Resumo:

The understanding of cellular metabolism has been an intriguing challenge in classical cellular biology for decades. Essentially, cellular metabolism can be viewed as a complex system of enzyme-catalysed biochemical reactions that produces the energy and material necessary for the maintenance of life. In modern biochemistry, it is well-known that these reactions group into metabolic pathways so as to accomplish a particular function in the cell. The identification of these metabolic pathways is a key step to fully understanding the metabolic capabilities of a given organism. Typically, metabol

Estilos ABNT, Harvard, Vancouver, APA, etc.

38

Koo, Karen. "Introduction of linear programming to construction management." Thesis, University of Manchester, 1997. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.561290.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

39

D'Ambrosio, Claudia <1980&gt. "Application-oriented Mixed Integer Non-Linear Programming." Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2009. http://amsdottorato.unibo.it/1634/1/DAmbrosio_Claudia_tesi.pdf.

Texto completo da fonte

Resumo:

In the most recent years there is a renovate interest for Mixed Integer Non-Linear Programming (MINLP) problems. This can be explained for different reasons: (i) the performance of solvers handling non-linear constraints was largely improved; (ii) the awareness that most of the applications from the real-world can be modeled as an MINLP problem; (iii) the challenging nature of this very general class of problems. It is well-known that MINLP problems are NP-hard because they are the generalization of MILP problems, which are NP-hard themselves. However, MINLPs are, in general, also hard to sol

Estilos ABNT, Harvard, Vancouver, APA, etc.

40

D'Ambrosio, Claudia <1980&gt. "Application-oriented Mixed Integer Non-Linear Programming." Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2009. http://amsdottorato.unibo.it/1634/.

Texto completo da fonte

Resumo:

In the most recent years there is a renovate interest for Mixed Integer Non-Linear Programming (MINLP) problems. This can be explained for different reasons: (i) the performance of solvers handling non-linear constraints was largely improved; (ii) the awareness that most of the applications from the real-world can be modeled as an MINLP problem; (iii) the challenging nature of this very general class of problems. It is well-known that MINLP problems are NP-hard because they are the generalization of MILP problems, which are NP-hard themselves. However, MINLPs are, in general, also hard to sol

Estilos ABNT, Harvard, Vancouver, APA, etc.

41

Ghosh, D. "Application of linear programming for feed formulation." Thesis, Central Marine Fisheries Research Institute, 2003. http://eprints.cmfri.org.in/11055/1/Dipankar%20Ghosh.pdf.

Texto completo da fonte

Resumo:

The use of artificial feed balanced in protein, lipid, carbohydrate, fibre, amino-acids, digestible energy, vitamins and minerals is very essential in fish farming. In the formulation of feed it is necessary to determine exact optimum proportions of different feed ingredients, which meets the above nutritional requirements, to be mixed to produce a nutritionally well-balanced feed at the least possible cost.

Estilos ABNT, Harvard, Vancouver, APA, etc.

42

Kumar, Manish. "Converting some global optimization problems to mixed integer linear problems using piecewise linear approximations." Diss., Rolla, Mo. : University of Missouri-Rolla, 2007. http://scholarsmine.umr.edu/thesis/pdf/Kumar_09007dcc803c8e68.pdf.

Texto completo da fonte

Resumo:

Thesis (M.S.)--University of Missouri--Rolla, 2007.<br>Vita. The entire thesis text is included in file. Title from title screen of thesis/dissertation PDF file (viewed December 7, 2007) Includes bibliographical references (p. 28).

Estilos ABNT, Harvard, Vancouver, APA, etc.

43

Steffy, Daniel E. "Topics in exact precision mathematical programming." Diss., Georgia Institute of Technology, 2011. http://hdl.handle.net/1853/39639.

Texto completo da fonte

Resumo:

The focus of this dissertation is the advancement of theory and computation related to exact precision mathematical programming. Optimization software based on floating-point arithmetic can return suboptimal or incorrect resulting because of round-off errors or the use of numerical tolerances. Exact or correct results are necessary for some applications. Implementing software entirely in rational arithmetic can be prohibitively slow. A viable alternative is the use of hybrid methods that use fast numerical computation to obtain approximate results that are then verified or corrected with s

Estilos ABNT, Harvard, Vancouver, APA, etc.

44

Hadjiconstanti, Andriani. "Modelling support for the analysis of linear programming and mixed integer programming problems." Thesis, Brunel University, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.436478.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

45

Magatão, Leandro. "Mixed integer linear programming and constraint logic programming : towards a unified modeling framework." Centro Federal de Educação Tecnológica do Paraná, 2005. http://repositorio.utfpr.edu.br/jspui/handle/1/86.

Texto completo da fonte

Resumo:

The struggle to model and solve Combinatorial Optimization Problems (COPs) has challenged the development of new approaches to deal with COPs. In one of the front lines of such approaches, Operational Research (OR) and Constraint Programming (CP) optimization techniques are beginning to converge, despite their very different origins. More specifically, Mixed Integer Linear Programming (MILP) and Constraint Logic Programming (CLP) are at the confluence of the OR and the CP fields. This thesis summarizes and contrasts the essential characteristics of MILP and CLP, and the ways that they can be f

Estilos ABNT, Harvard, Vancouver, APA, etc.

46

Wang, Xia. "Applications of genetic algorithms, dynamic programming, and linear programming to combinatorial optimization problems." College Park, Md.: University of Maryland, 2008. http://hdl.handle.net/1903/8778.

Texto completo da fonte

Resumo:

Thesis (Ph. D.) -- University of Maryland, College Park, 2008.<br>Thesis research directed by: Applied Mathematics & Statistics, and Scientific Computation Program. Title from t.p. of PDF. Includes bibliographical references. Published by UMI Dissertation Services, Ann Arbor, Mich. Also available in paper.

Estilos ABNT, Harvard, Vancouver, APA, etc.

47

朱紫君 and Chi-kwan Chu. "Polynomial time algorithms for linear and integer programming." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2000. http://hub.hku.hk/bib/B31224301.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

48

Chu, Chi-kwan. "Polynomial time algorithms for linear and integer programming." Hong Kong : University of Hong Kong, 2000. http://sunzi.lib.hku.hk/hkuto/record.jsp?B22718710.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

49

Jayawardane, Ananda Kithsiri Wijenayaka. "Optimising earthmoving by linear programming and computer simulation." Thesis, Loughborough University, 1989. https://dspace.lboro.ac.uk/2134/31915.

Texto completo da fonte

Resumo:

The accuracy of planning and estimating of earthmoving operations in any highway construction is important for both successful tendering and high profit margins. Mass-haul diagrams and experienced engineering judgement together with deterministic methods have been the key factors in planning and estimating earthmoving operations. Despite this, the limited use of Mass-haul diagrams and inaccuracy of deterministic estimates are well known. Although Stochastic and Linear Programming methods were developed to overcome some of these limitations, those available hitherto are relatively fundamental a

Estilos ABNT, Harvard, Vancouver, APA, etc.

50

Salazar-Neumann, Martha. "Advances in robust combinatorial optimization and linear programming." Doctoral thesis, Universite Libre de Bruxelles, 2010. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/210192.

Texto completo da fonte

Resumo:

La construction de modèles qui protègent contre les incertitudes dans les données, telles que la variabilité de l'information et l'imprécision est une des principales préoccupations en optimisation sous incertitude. L'incertitude peut affecter différentes domaines, comme le transport, les télécommunications, la finance, etc. ainsi que les différentes parts d'un problème d'optimisation, comme les coefficients de la fonction objectif et /ou les contraintes. De plus, l'ensemble des données incertaines peut être modélisé de différentes façons, comme sous ensembles compactes et convexes de l´espace

Estilos ABNT, Harvard, Vancouver, APA, etc.

Oferecemos descontos em todos os planos premium para autores cujas obras estão incluídas em seleções literárias temáticas. Contate-nos para obter um código promocional único!