Добірка наукової літератури з теми "Mathematical programming formulation"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Mathematical programming formulation".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Статті в журналах з теми "Mathematical programming formulation"
Lee, Jae Sik, Christopher V. Jones, and Monique Guignard. "MAPNOS: Mathematical programming formulation normalization system." Expert Systems with Applications 1, no. 4 (January 1990): 367–81. http://dx.doi.org/10.1016/0957-4174(90)90046-w.
Повний текст джерелаBonatsos, Nikolaos, Endrit Dheskali, Denise M. G. Freire, Aline Machado de Castro, Apostolis A. Koutinas, and Ioannis K. Kookos. "A mathematical programming formulation for biorefineries technology selection." Biochemical Engineering Journal 116 (December 2016): 135–45. http://dx.doi.org/10.1016/j.bej.2016.05.001.
Повний текст джерелаAdi, Vincentius Surya Kurnia, and Chuei-Tin Chang. "A mathematical programming formulation for temporal flexibility analysis." Computers & Chemical Engineering 57 (October 2013): 151–58. http://dx.doi.org/10.1016/j.compchemeng.2013.04.001.
Повний текст джерелаGringauz, M. "On mathematical programming formulation for contact crack problems." International Journal of Fracture 60, no. 1 (March 1993): R3—R7. http://dx.doi.org/10.1007/bf00034516.
Повний текст джерелаUrahama, Kiichi. "Mathematical programming formulation for neural combinatorial optimization algorithms." Electronics and Communications in Japan (Part III: Fundamental Electronic Science) 78, no. 9 (September 1995): 67–75. http://dx.doi.org/10.1002/ecjc.4430780907.
Повний текст джерелаChen, Zeng Hai, Bin Gang Xu, Zhe Ru Chi, and Da Gan Feng. "Mathematical formulation of knitted fabric spirality using genetic programming." Textile Research Journal 82, no. 7 (January 25, 2012): 667–76. http://dx.doi.org/10.1177/0040517511435011.
Повний текст джерелаPatil, Vishal, Radha Gupta, Rajendran D, and Ravinder Singh Kuntal. "COMPARATIVE STUDY ON FEED FORMULATION SOFTWARE- A SHORT REVIEW." International Journal of Research -GRANTHAALAYAH 5, no. 4RAST (April 30, 2017): 105–15. http://dx.doi.org/10.29121/granthaalayah.v5.i4rast.2017.3311.
Повний текст джерелаZhao, LiJin, and Liang Huang. "A Mathematical Programming Formulation of Disjoint Dominating Sets Problem." Journal of Computational and Theoretical Nanoscience 13, no. 11 (November 1, 2016): 8760–64. http://dx.doi.org/10.1166/jctn.2016.6037.
Повний текст джерелаOlhoff, N. "Multicriterion structural optimization via bound formulation and mathematical programming." Structural Optimization 1, no. 1 (March 1989): 11–17. http://dx.doi.org/10.1007/bf01743805.
Повний текст джерелаChwatal, Andreas M., and Günther R. Raidl. "Solving the Minimum Label Spanning Tree Problem by Mathematical Programming Techniques." Advances in Operations Research 2011 (2011): 1–38. http://dx.doi.org/10.1155/2011/143732.
Повний текст джерелаДисертації з теми "Mathematical programming formulation"
Grodal, Evert Olaus. "Designing primary hydrocarbon production separation systems : a mathematical programming formulation." Thesis, Georgia Institute of Technology, 2000. http://hdl.handle.net/1853/12084.
Повний текст джерелаBrooks, J. Paul. "Solving a mixed-integer programming formulation of a classification model with misclassification limits." Diss., Available online, Georgia Institute of Technology, 2005, 2005. http://etd.gatech.edu/theses/available/etd-08232005-133023/.
Повний текст джерелаPrausnitz, Mark, Committee Member ; Vidakovic, Brani, Committee Member ; Lee, Eva, Committee Chair ; Nemhauser, George, Committee Member ; Johnson, Ellis, Committee Member. Includes bibliographical references.
Abdullah, Ali H. "The weighted maximal planar graph : mathematical formulations and solutions." Thesis, University of Kent, 2002. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.250315.
Повний текст джерелаMelo, Márcio Daniel Tavares de. "Network virtualisation from an operator perspective." Doctoral thesis, Universidade de Aveiro, 2014. http://hdl.handle.net/10773/12876.
Повний текст джерелаNetwork virtualisation is seen as a promising approach to overcome the so-called “Internet impasse” and bring innovation back into the Internet, by allowing easier migration towards novel networking approaches as well as the coexistence of complementary network architectures on a shared infrastructure in a commercial context. Recently, the interest from the operators and mainstream industry in network virtualisation has grown quite significantly, as the potential benefits of virtualisation became clearer, both from an economical and an operational point of view. In the beginning, the concept has been mainly a research topic and has been materialized in small-scale testbeds and research network environments. This PhD Thesis aims to provide the network operator with a set of mechanisms and algorithms capable of managing and controlling virtual networks. To this end, we propose a framework that aims to allocate, monitor and control virtual resources in a centralized and efficient manner. In order to analyse the performance of the framework, we performed the implementation and evaluation on a small-scale testbed. To enable the operator to make an efficient allocation, in real-time, and on-demand, of virtual networks onto the substrate network, it is proposed a heuristic algorithm to perform the virtual network mapping. For the network operator to obtain the highest profit of the physical network, it is also proposed a mathematical formulation that aims to maximize the number of allocated virtual networks onto the physical network. Since the power consumption of the physical network is very significant in the operating costs, it is important to make the allocation of virtual networks in fewer physical resources and onto physical resources already active. To address this challenge, we propose a mathematical formulation that aims to minimize the energy consumption of the physical network without affecting the efficiency of the allocation of virtual networks. To minimize fragmentation of the physical network while increasing the revenue of the operator, it is extended the initial formulation to contemplate the re-optimization of previously mapped virtual networks, so that the operator has a better use of its physical infrastructure. It is also necessary to address the migration of virtual networks, either for reasons of load balancing or for reasons of imminent failure of physical resources, without affecting the proper functioning of the virtual network. To this end, we propose a method based on cloning techniques to perform the migration of virtual networks across the physical infrastructure, transparently, and without affecting the virtual network. In order to assess the resilience of virtual networks to physical network failures, while obtaining the optimal solution for the migration of virtual networks in case of imminent failure of physical resources, the mathematical formulation is extended to minimize the number of nodes migrated and the relocation of virtual links. In comparison with our optimization proposals, we found out that existing heuristics for mapping virtual networks have a poor performance. We also found that it is possible to minimize the energy consumption without penalizing the efficient allocation. By applying the re-optimization on the virtual networks, it has been shown that it is possible to obtain more free resources as well as having the physical resources better balanced. Finally, it was shown that virtual networks are quite resilient to failures on the physical network.
A virtualização de rede é vista como uma abordagem promissora para ultrapassar o “Impasse da Internet” e permitir inovação na Internet, possibilitando assim uma migração fácil para novas abordagens de redes, bem como a coexistência de arquiteturas de redes complementares numa infraestrutura compartilhada e em ambiente comercial. Recentemente tem crescido de forma bastante significativa o interesse pela virtualização de rede por parte dos operadores e dos grandes fabricantes, desde que os potenciais benefícios da virtualização se tornaram claros, tanto de ponto de vista económico como operacional. No início, o conceito foi versado pelo meio académico, onde foram realizadas provas de conceito de pequena escala, e em que a virtualização de rede foi considerada como forma de investigação de novos protocolos. Esta Tese de Doutoramento tem como objetivo geral dotar uma rede de operador de um conjunto de mecanismos e algoritmos capazes de gerir e controlar redes virtuais. Para este fim, é proposta uma framework que visa alocar, monitorizar e controlar recursos virtuais de uma forma centralizada e eficiente. De forma a analisar o desempenho da framework, procedeu-se à sua implementação e avaliação numa rede de pequena dimensão. De forma a permitir que se possa efetuar uma alocação eficiente, em tempo real, e a pedido, de redes virtuais numa rede física, é proposta uma heurística para efetuar o mapeamento na rede física. Para que o operador de rede possa rentabilizar ao máximo a sua infraestrutura de rede, é ainda proposta uma formulação matemática que, através de programação linear, visa maximizar o número de redes alocadas na infraestrutura de rede. Dado que o consumo energético de uma infraestrutura de rede começa a ter significância nos custos de operação, é importante que se faça a alocação das redes virtuais no menor número de recursos físicos e também em recursos físicos ativos. Para endereçar este desafio é proposta uma formulação matemática que visa minimizar o consumo energético da rede física sem afetar a eficiência da alocação de redes virtuais. Para minimizar a fragmentação da infraestrutura de rede e ao mesmo tempo aumentar as receitas do operador, é também estendida a formulação inicial para contemplar a re-otimização de redes virtuais previamente mapeadas, fazendo com que o operador tenha um melhor aproveitamento da sua infraestrutura física. Será ainda necessário endereçar a migração de redes virtuais, quer por motivos de balanceamento de carga, quer por motivos de falha iminente de recursos físicos, sem afetar o bom funcionamento da rede virtual. Para este fim, é proposto um método baseado em técnicas de clonagem, para efetuar a migração de redes virtuais entre recursos da infraestrutura física de forma transparente e sem impacto para a rede virtual. De forma a avaliar a resiliência das redes virtuais a falhas na rede física, e ao mesmo tempo obter a solução ótima de migração de redes virtuais em caso de falha iminente dos recursos físicos, a formulação matemática é estendida para minimizar o número de nós migrados em simultâneo com a realocação de ligações virtuais. Em comparação com as nossas propostas de otimização verificou-se que as heurísticas existentes para mapeamento de redes virtuais têm um desempenho muito baixo. Verificou-se ainda que é possível efetuar a redução do consumo energético sem a penalização da alocação eficiente. Com a re-otimização das redes virtuais mostrou-se que é possível obter mais recursos livres, assim como obter uma melhor distribuição dos recursos. Por último, demonstrou-se que as redes virtuais são bastante resilientes a falhas na rede física.
Dietert, Grant. "An integer linear programming formulation for tiling large rectangles using 4 x 6 and 5 x 7 tiles /." Online version of thesis, 2010. http://hdl.handle.net/1850/12275.
Повний текст джерелаFigueiredo, Tatiane Fernandes. "The socio-technical teams formation problem: Complexity, Mathematical Formulations and Computational Results." Universidade Federal do CearÃ, 2014. http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=15392.
Повний текст джерелаUtilizando conceitos da Teoria dos Sistemas SociotÃcnicos, este trabalho define matematicamente os problemas de formaÃÃo de equipes cooperativas considerando separadamente restriÃÃes sociais e tÃcnicas e apresenta a complexidade computacional dos mesmos. Sobretudo, à definido e estudado o problema central deste trabalho, que considera conjuntamente requisitos sociais e tÃcnicos para criaÃÃo de equipes de trabalho cooperativo, denominado FEST (Problema de FormaÃÃo de Equipes SociotÃcnicas). Duas formulaÃÃes matemÃticas e uma meta-heurÃstica para o FEST sÃo propostas. Uma formulaÃÃo utiliza um nÃmero cÃbico de variÃveis e restriÃÃes, enquanto a segunda formulaÃÃo possui um nÃmero quadrÃtico de variÃveis, mas um nÃmero exponencial de restriÃÃes. A meta-heurÃstica proposta à baseada no Simulated Annealing NÃo-MonotÃnico com busca local que usa operadores tipo swap. A corretude de ambas as formulaÃÃes à provada. Um algoritmo polinomial para separar as restriÃÃes da segunda formulaÃÃo à apresentado. Mostra-se que as duas formulaÃÃes fornecem o mesmo limite de programaÃÃo linear, e desigualdades vÃlidas para fortalecÃ-lo sÃo propostas. Para a formulaÃÃo compacta, algumas classes de desigualdades vÃlidas sÃo demonstradas indutoras de facetas sob hipÃteses apropriadas. Por fim, foi analisado estatisticamente o desempenho das formulaÃÃes e da meta-heurÃstica apresentadas. InstÃncias reais e geradas aleatoriamente sÃo usadas nos experimentos computacionais.
Solak, Senay. "Efficient Solution Procedures for Multistage Stochastic Formulations of Two Problem Classes." Diss., Georgia Institute of Technology, 2007. http://hdl.handle.net/1853/19812.
Повний текст джерелаSmith, Jonathan Cole. "Tight Discrete Formulations to Enhance Solvability with Applications to Production, Telecommunications, and Air Transportation Problems." Diss., Virginia Tech, 2000. http://hdl.handle.net/10919/26710.
Повний текст джерелаPh. D.
Boberg, Jessika. "A comparison of sequencing formulations in a constraint generation procedure for avionics scheduling." Thesis, Linköpings universitet, Optimeringslära, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-143274.
Повний текст джерелаTaeihagh, Araz. "A novel approach for the development of policies for socio-technical systems." Thesis, University of Oxford, 2011. http://ora.ox.ac.uk/objects/uuid:0183f800-51bf-4e4d-abba-cd91b7bf48f0.
Повний текст джерелаКниги з теми "Mathematical programming formulation"
Diaby, Moustapha. Advances in combinatorial optimization: Linear programming formulation of the traveling salesman and other hard combinatorial optimization problems. New Jersey: World Scientific, 2015.
Знайти повний текст джерела1956-, Wallace Stein W., and North Atlantic Treaty Organization. Scientific Affairs Division., eds. Algorithms and model formulations in mathematical programming. Berlin: Springer-Verlag, 1989.
Знайти повний текст джерелаWallace, Stein W. Algorithms and Model Formulations in Mathematical Programming. Berlin, Heidelberg: Springer Berlin Heidelberg, 1989.
Знайти повний текст джерелаWallace, Stein W., ed. Algorithms and Model Formulations in Mathematical Programming. Berlin, Heidelberg: Springer Berlin Heidelberg, 1989. http://dx.doi.org/10.1007/978-3-642-83724-1.
Повний текст джерелаBhargava, H. K. Reasoning with assumptions, defeasibly, in model formulation. Monterey, Calif: Dept. of Administrative Sciences, Naval Postgraduate School, 1991.
Знайти повний текст джерелаRimrott, F. P. J. 1927-, ed. Variational methods and complementary formulations in dynamics. Dordrecht: Kluwer Academic Publishers, 1994.
Знайти повний текст джерелаSmall, John T. Optimal Process Design of 2- and 3-Phase Horizontal Production Separators for Oil and Gas Installations: A Mathematical Programming Formulation in Excel 2016. Independently Published, 2019.
Знайти повний текст джерелаAlternative mathematical programming formulations for FSS synthesis. Columbus, Ohio: Ohio State University ElectroScience Laboratory, Dept. of Electrical Engineering, 1986.
Знайти повний текст джерелаWallace, Stein W. Algorithms and Model Formulations in Mathematical Programming. Springer, 2012.
Знайти повний текст джерелаBowker, Geoffrey C., and Florian Jaton. The Constitution of Algorithms: Ground-Truthing, Programming, Formulating. The MIT Press, 2021.
Знайти повний текст джерелаЧастини книг з теми "Mathematical programming formulation"
Manne, Alan S. "On the formulation and solution of economic equilibrium models." In Mathematical Programming Studies, 1–22. Berlin, Heidelberg: Springer Berlin Heidelberg, 1985. http://dx.doi.org/10.1007/bfb0121023.
Повний текст джерелаKallrath, Josef. "From the Problem to its Mathematical Formulation." In Business Optimization Using Mathematical Programming, 33–70. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-73237-0_2.
Повний текст джерелаLucertini, M., and G. Paletta. "A class of network design problems with multiple demand: Model formulation and an algorithmic approach." In Mathematical Programming Studies, 225–28. Berlin, Heidelberg: Springer Berlin Heidelberg, 1986. http://dx.doi.org/10.1007/bfb0121101.
Повний текст джерелаKingsford, Carl, Elena Zaslavsky, and Mona Singh. "A Compact Mathematical Programming Formulation for DNA Motif Finding." In Combinatorial Pattern Matching, 233–45. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11780441_22.
Повний текст джерелаOlhoff, Niels. "Optimal Structural Design via Bound Formulation and Mathematical Programming." In Discretization Methods and Structural Optimization — Procedures and Applications, 255–62. Berlin, Heidelberg: Springer Berlin Heidelberg, 1989. http://dx.doi.org/10.1007/978-3-642-83707-4_32.
Повний текст джерелаOlhoff, Niels. "Solution of Max-Min Problems via Bound Formulation and Mathematical Programming." In Structural Optimization, 397. Dordrecht: Springer Netherlands, 1988. http://dx.doi.org/10.1007/978-94-009-1413-1_52.
Повний текст джерелаSaxena, Pratiksha, and Neha Khanna. "Formulation and Computation of Animal Feed Mix: Optimization by Combination of Mathematical Programming." In Advances in Intelligent Systems and Computing, 621–29. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-13728-5_70.
Повний текст джерелаIommazzo, Gabriele, Claudia D’Ambrosio, Antonio Frangioni, and Leo Liberti. "A Learning-Based Mathematical Programming Formulation for the Automatic Configuration of Optimization Solvers." In Machine Learning, Optimization, and Data Science, 700–712. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-64583-0_61.
Повний текст джерелаLara, Pablo. "Linking Production Theory and Multiobjective Fractional Programming as a Support Tool for Animal Diet Formulation." In Lecture Notes in Economics and Mathematical Systems, 301–9. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/978-3-642-46854-4_33.
Повний текст джерелаMitrovic-Minic, Snezana, Darren Thomson, Jean Berger, and Jeff Secker. "Collection Planning and Scheduling for Multiple Heterogeneous Satellite Missions: Survey, Optimization Problem, and Mathematical Programming Formulation." In Springer Optimization and Its Applications, 271–305. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-10501-3_11.
Повний текст джерелаТези доповідей конференцій з теми "Mathematical programming formulation"
Kerzhner, Aleksandr A., and Christiaan J. J. Paredis. "A Mathematical Programming-Based Approach for Architecture Selection." In ASME 2012 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2012. http://dx.doi.org/10.1115/detc2012-71025.
Повний текст джерелаLijie Su, Lixin Tang, and Jianyou Xu. "Mathematical programming formulation for campaign planning of multi-product batch process." In 2008 Chinese Control and Decision Conference (CCDC). IEEE, 2008. http://dx.doi.org/10.1109/ccdc.2008.4597428.
Повний текст джерелаLuan, Shi-chao, Guo-zhu Jia, and Wen Kong. "A mathematical programming formulation approach to the number of POLCA cards." In 2012 International Conference on Management Science and Engineering (ICMSE). IEEE, 2012. http://dx.doi.org/10.1109/icmse.2012.6414186.
Повний текст джерелаPierce, Robert Scott, and David Rosen. "Simulation of Mating Between Non-Analytic Surfaces Using a Mathematical Programming Formulation." In ASME 2005 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2005. http://dx.doi.org/10.1115/detc2005-84232.
Повний текст джерелаRodríguez-Bocca, Pablo, and Héctor Cancela. "A mathematical programming formulation of optimal cache expiration dates in content networks." In the 3rd international IFIP/ACM Latin American conference. New York, New York, USA: ACM Press, 2005. http://dx.doi.org/10.1145/1168117.1168130.
Повний текст джерелаGrødal, Evert O., and Matthew J. Realff. "Optimal Design of Two- and Three- Phase Separators: A Mathematical Programming Formulation." In SPE Annual Technical Conference and Exhibition. Society of Petroleum Engineers, 1999. http://dx.doi.org/10.2118/56645-ms.
Повний текст джерелаSadat, Sayed A., and Lingling Fan. "Mixed integer linear programming formulation for chance constrained mathematical programs with equilibrium constraints." In 2017 IEEE Power & Energy Society General Meeting (PESGM). IEEE, 2017. http://dx.doi.org/10.1109/pesgm.2017.8273875.
Повний текст джерелаShah, Aditya A., Christiaan J. J. Paredis, Roger Burkhart, and Dirk Schaefer. "Combining Mathematical Programming and SysML for Automated Component Sizing of Hydraulic Systems." In ASME 2010 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2010. http://dx.doi.org/10.1115/detc2010-28960.
Повний текст джерелаDhingra, A. K., and S. S. Rao. "Integrated Optimal Design of Planar Mechanisms Using Fuzzy Theories." In ASME 1989 Design Technical Conferences. American Society of Mechanical Engineers, 1989. http://dx.doi.org/10.1115/detc1989-0086.
Повний текст джерелаOta, Matheus J., Flávio K. Miyazawa, and Phablo F. S. Moura. "The Balanced Connected k-Partition Problem: Polyhedra and Algorithms." In Concurso de Teses e Dissertações da SBC. Sociedade Brasileira de Computação, 2021. http://dx.doi.org/10.5753/ctd.2021.15763.
Повний текст джерелаЗвіти організацій з теми "Mathematical programming formulation"
Ratmanski, Kiril, and Sergey Vecherin. Resilience in distributed sensor networks. Engineer Research and Development Center (U.S.), October 2022. http://dx.doi.org/10.21079/11681/45680.
Повний текст джерелаMacal, C. M., and A. P. Hurter. Solution of mathematical programming formulations of subgame perfect equilibrium problems. Office of Scientific and Technical Information (OSTI), February 1992. http://dx.doi.org/10.2172/10134527.
Повний текст джерела