Bibliografias temáticas / Lagrangian relaxation bounds

Índice

Artigos de revistas
Teses / dissertações
Capítulos de livros
Trabalhos de conferências

Literatura científica selecionada sobre o tema "Lagrangian relaxation bounds"

Autor: Grafiati

Publicado: 4 de junho de 2021

Última modificação: 1 de fevereiro de 2022

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

Selecione um tipo de fonte:

Consulte a lista de atuais artigos, livros, teses, anais de congressos e outras fontes científicas relevantes para o tema "Lagrangian relaxation bounds".

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.

Artigos de revistas sobre o assunto "Lagrangian relaxation bounds"

Berezovskyi, Oleg. "Improving Lagrange Dual Bounds for Quadratic Extremal Problems." Cybernetics and Computer Technologies, no. 1 (March 31, 2020): 15–22. http://dx.doi.org/10.34229/2707-451x.20.1.2.

Texto completo da fonte

Resumo:

Introduction. Due to the fact that quadratic extremal problems are generally NP-hard, various convex relaxations to find bounds for their global extrema are used, namely, Lagrangian relaxation, SDP-relaxation, SOCP-relaxation, LP-relaxation, and others. This article investigates a dual bound that results from the Lagrangian relaxation of all constraints of quadratic extremal problem. The main issue when using this approach for solving quadratic extremal problems is the quality of the obtained bounds (the magnitude of the duality gap) and the possibility to improve them. While for quadratic con

Estilos ABNT, Harvard, Vancouver, APA, etc.

Dolatabadi, Mohammad, Andrea Lodi, and Zahra Afsharnejad. "Improving spectral bounds for clustering problems by Lagrangian relaxation." International Transactions in Operational Research 18, no. 6 (August 30, 2011): 647–61. http://dx.doi.org/10.1111/j.1475-3995.2011.00825.x.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Brown, Nathanael, Bryan Arguello, Linda Nozick, and Ningxiong Xu. "A Heuristic Approach to Satellite Range Scheduling With Bounds Using Lagrangian Relaxation." IEEE Systems Journal 12, no. 4 (December 2018): 3828–36. http://dx.doi.org/10.1109/jsyst.2018.2821094.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Mirzaian, Andranik. "Lagrangian relaxation for the star-star concentrator location problem: Approximation algorithm and bounds." Networks 15, no. 1 (1985): 1–20. http://dx.doi.org/10.1002/net.3230150102.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Brown, David B., and James E. Smith. "Index Policies and Performance Bounds for Dynamic Selection Problems." Management Science 66, no. 7 (July 2020): 3029–50. http://dx.doi.org/10.1287/mnsc.2019.3342.

Texto completo da fonte

Resumo:

We consider dynamic selection problems, where a decision maker repeatedly selects a set of items from a larger collection of available items. A classic example is the dynamic assortment problem with demand learning, where a retailer chooses items to offer for sale subject to a display space constraint. The retailer may adjust the assortment over time in response to the observed demand. These dynamic selection problems are naturally formulated as stochastic dynamic programs (DPs) but are difficult to solve because the optimal selection decisions depend on the states of all items. In this paper,

Estilos ABNT, Harvard, Vancouver, APA, etc.

Bomze, Immanuel M. "Copositive Relaxation Beats Lagrangian Dual Bounds in Quadratically and Linearly Constrained Quadratic Optimization Problems." SIAM Journal on Optimization 25, no. 3 (January 2015): 1249–75. http://dx.doi.org/10.1137/140987997.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Hosseinian, Seyedmohammadhossein, Dalila B. M. M. Fontes, and Sergiy Butenko. "A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem." INFORMS Journal on Computing 32, no. 3 (July 2020): 747–62. http://dx.doi.org/10.1287/ijoc.2019.0898.

Texto completo da fonte

Resumo:

This paper explores the connections between the classical maximum clique problem and its edge-weighted generalization, the maximum edge weight clique (MEWC) problem. As a result, a new analytic upper bound on the clique number of a graph is obtained and an exact algorithm for solving the MEWC problem is developed. The bound on the clique number is derived using a Lagrangian relaxation of an integer (linear) programming formulation of the MEWC problem. Furthermore, coloring-based bounds on the clique number are used in a novel upper-bounding scheme for the MEWC problem. This scheme is employed

Estilos ABNT, Harvard, Vancouver, APA, etc.

Mellouli, Racem, Imed Kacem, Chérif Sadfi, and Chengbin Chu. "Lagrangian relaxation and column generation-based lower bounds for the Pm,hj1‖∑wiCi scheduling problem." Applied Mathematics and Computation 219, no. 22 (July 2013): 10783–805. http://dx.doi.org/10.1016/j.amc.2013.05.004.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Lv, Xiaofeng, Deyun Zhou, Ling Ma, Yuyuan Zhang, and Yongchuan Tang. "An Improved Lagrange Particle Swarm Optimization Algorithm and Its Application in Multiple Fault Diagnosis." Shock and Vibration 2020 (June 27, 2020): 1–8. http://dx.doi.org/10.1155/2020/1091548.

Texto completo da fonte

Resumo:

The fault rate in equipment increases significantly along with the service life of the equipment, especially for multiple fault. Typically, the Bayesian theory is used to construct the model of faults, and intelligent algorithm is used to solve the model. Lagrangian relaxation algorithm can be adopted to solve multiple fault diagnosis models. But the mathematical derivation process may be complex, while the updating method for Lagrangian multiplier is limited and it may fall into a local optimal solution. The particle swarm optimization (PSO) algorithm is a global search algorithm. In this pap

Estilos ABNT, Harvard, Vancouver, APA, etc.

Kim, Sunyoung, Masakazu Kojima, and Kim-Chuan Toh. "A Lagrangian–DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems." Mathematical Programming 156, no. 1-2 (February 21, 2015): 161–87. http://dx.doi.org/10.1007/s10107-015-0874-5.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Mais fontes

Teses / dissertações sobre o assunto "Lagrangian relaxation bounds"

Fiorotto, Diego Jacinto [UNESP]. "Limitantes inferiores par ao problema de dimensionamento de lotes em máquinas paralelas." Universidade Estadual Paulista (UNESP), 2001. http://hdl.handle.net/11449/86510.

Texto completo da fonte

Resumo:

Made available in DSpace on 2014-06-11T19:22:18Z (GMT). No. of bitstreams: 0 Previous issue date: 2001-02-17Bitstream added on 2014-06-13T19:07:26Z : No. of bitstreams: 1 fiorotto_dj_me_sjrp.pdf: 485977 bytes, checksum: 8cd2b3ba49a25a9c6a863795f27811c3 (MD5) Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES) O problema de dimensionamento de lotes é um problema de otimização da produção, em que o objetivo é planejar a quantidade de itens a ser produzida em várias, ou única, máquinas em cada período ao longo do horizonte de tempo, de modo a tender uma demanda e otimizar

Estilos ABNT, Harvard, Vancouver, APA, etc.

Fiorotto, Diego Jacinto. "Limitantes inferiores par ao problema de dimensionamento de lotes em máquinas paralelas /." São José do Rio Preto : [s.n.], 2011. http://hdl.handle.net/11449/86510.

Texto completo da fonte

Resumo:

Orientador: Silvio Alexandrede Araujo Banca: Bernardo Sobrinho Simões de Almada Lobo Banca: Franklina Maria Bragion Toledo Resumo: O problema de dimensionamento de lotes é um problema de otimização da produção, em que o objetivo é planejar a quantidade de itens a ser produzida em várias, ou única, máquinas em cada período ao longo do horizonte de tempo, de modo a tender uma demanda e otimizar uma função objetivo. Este trabalho aborda o problema de dimensionamento de lotes em um único estágio em um ambiente com máquinas paralelas distintas. Cada item pode ser produzido em qualquer máqu

Estilos ABNT, Harvard, Vancouver, APA, etc.

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.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

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.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Oliveira, Lilian Kátia de. "Métodos exatos baseados em relaxação lagrangiana e surrogate para o problema de carregamento de paletes do produtor." Universidade Federal de São Carlos, 2004. https://repositorio.ufscar.br/handle/ufscar/3407.

Texto completo da fonte

Resumo:

Made available in DSpace on 2016-06-02T19:50:17Z (GMT). No. of bitstreams: 1 TeseLKO.pdf: 834201 bytes, checksum: 994d7b70c6b1001f9dec962fafc8b72e (MD5) Previous issue date: 2004-12-13 Universidade Federal de Sao Carlos The purpose of this work is to develop exact methods, based on Lagrangean and Surrogate relaxation, with good performance to solve the manufacturer s pallet loading problem. This problem consists of orthogonally arranging the maximum number of rectangles of sizes (l,w) and (w,l) into a larger rectangle (L,W) without overlapping. Such methods involve a tree search proced

Estilos ABNT, Harvard, Vancouver, APA, etc.

Bhootra, Ajay. "A Disassembly Optimization Problem." Thesis, Virginia Tech, 2002. http://hdl.handle.net/10919/30853.

Texto completo da fonte

Resumo:

The rapid technological advancement in the past century resulted in a decreased life cycle of a large number of products and, consequently, increased the rate of technological obsolescence. The disposal of obsolete products has resulted in rapid landfilling and now poses a major environmental threat. The governments in many countries around the world have started imposing regulations to curb uncontrolled product disposal. The consumers, too, are now aware of adverse effects of product disposal on environment and increasingly favor environmentally benign products. In the wake of imminent

Estilos ABNT, Harvard, Vancouver, APA, etc.

Yoo, Jaewook. "Multi-period optimization of pavement management systems." Diss., Texas A&M University, 2004. http://hdl.handle.net/1969.1/343.

Texto completo da fonte

Resumo:

The purpose of this research is to develop a model and solution methodology for selecting and scheduling timely and cost-effective maintenance, rehabilitation, and reconstruction activities (M & R) for each pavement section in a highway network and allocating the funding levels through a finite multi-period horizon within the constraints imposed by budget availability in each period, frequency availability of activities, and specified minimum pavement quality requirements. M & R is defined as a chronological sequence of reconstruction, rehabilitation, and major/minor maintenance, including a "

Estilos ABNT, Harvard, Vancouver, APA, etc.

Oulamara, Ammar. "Flowshops avec détérioration des tâches et groupement des tâches." Université Joseph Fourier (Grenoble), 2001. http://www.theses.fr/2001GRE10074.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Neamatian, Monemi Rahimeh. "Fixed cardinality linear ordering problem, polyhedral studies and solution methods." Thesis, Clermont-Ferrand 2, 2014. http://www.theses.fr/2014CLF22516/document.

Texto completo da fonte

Resumo:

Le problème d’ordre linéaire (LOP) a reçu beaucoup d’attention dans différents domaines d’application, allant de l’archéologie à l’ordonnancement en passant par l’économie et même de la psychologie mathématique. Ce problème est aussi connu pour être parmi les problèmes NP-difficiles. Nous considérons dans cette thèse une variante de (LOP) sous contrainte de cardinalité. Nous cherchons donc un ordre linéaire d’un sous-ensemble de sommets du graphe de préférences de cardinalité fixée et de poids maximum. Ce problème, appelé (FCLOP) pour ’fixed-cardinality linear ordering problem’, n’a pas été ét

Estilos ABNT, Harvard, Vancouver, APA, etc.

Capítulos de livros sobre o assunto "Lagrangian relaxation bounds"

Agra, Agostinho, Adelaide Cerveira, and Cristina Requejo. "Lagrangian Relaxation Bounds for a Production-Inventory-Routing Problem." In Lecture Notes in Computer Science, 236–45. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-51469-7_20.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Yu, Nai-Kang, Rong Hu, Bin Qian, and Ling Wang. "An Improved Lagrangian Relaxation Algorithm for Solving the Lower Bound of Production Logistics." In Intelligent Computing Theories and Application, 652–62. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-84522-3_53.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Li, Minghuang, and Fusheng Yu. "Semidefinite Programming-Based Method for Implementing Linear Fitting to Interval-Valued Data." In Contemporary Theory and Pragmatic Approaches in Fuzzy Computing Utilization, 172–87. IGI Global, 2013. http://dx.doi.org/10.4018/978-1-4666-1870-1.ch012.

Texto completo da fonte

Resumo:

Building a linear fitting model for a given interval-valued data set is challenging since the minimization of the residue function leads to a huge combinatorial problem. To overcome such a difficulty, this article proposes a new semidefinite programming-based method for implementing linear fitting to interval-valued data. First, the fitting model is cast to a problem of quadratically constrained quadratic programming (QCQP), and then two formulae are derived to develop the lower bound on the optimal value of the nonconvex QCQP by semidefinite relaxation and Lagrangian relaxation. In many cases, this method can solve the fitting problem by giving the exact optimal solution. Even though the lower bound is not the optimal value, it is still a good approximation of the global optimal solution. Experimental studies on different fitting problems of different scales demonstrate the good performance and stability of our method. Furthermore, the proposed method performs very well in solving relatively large-scale interval-fitting problems.

Estilos ABNT, Harvard, Vancouver, APA, etc.

Trabalhos de conferências sobre o assunto "Lagrangian relaxation bounds"

Corro, Caio, Joseph Le Roux, Mathieu Lacroix, Antoine Rozenknop, and Roberto Wolfler Calvo. "Dependency Parsing with Bounded Block Degree and Well-nestedness via Lagrangian Relaxation and Branch-and-Bound." In Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). Stroudsburg, PA, USA: Association for Computational Linguistics, 2016. http://dx.doi.org/10.18653/v1/p16-1034.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Fang Zhou. "Research the bound of the option value of MIP by Lagrangian relaxation." In 2011 2nd International Conference on Artificial Intelligence, Management Science and Electronic Commerce (AIMSEC). IEEE, 2011. http://dx.doi.org/10.1109/aimsec.2011.6009912.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Gowal, Sven, Krishnamurthy Dvijotham, Robert Stanforth, Timothy Mann, and Pushmeet Kohli. "A Dual Approach to Verify and Train Deep Networks." In Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}. California: International Joint Conferences on Artificial Intelligence Organization, 2019. http://dx.doi.org/10.24963/ijcai.2019/854.

Texto completo da fonte

Resumo:

This paper addressed the problem of formally verifying desirable properties of neural networks, i.e., obtaining provable guarantees that neural networks satisfy specifications relating their inputs and outputs (e.g., robustness to bounded norm adversarial perturbations). Most previous work on this topic was limited in its applicability by the size of the network, network architecture and the complexity of properties to be verified. In contrast, our framework applies to a general class of activation functions and specifications. We formulate verification as an optimization problem (seeking to f

Estilos ABNT, Harvard, Vancouver, APA, etc.

Krimi, Issam, Rachid Benmansour, Nizar Elhachemi, and David Duvivier. "Lagrangian relaxation-based lower bound for the two-machine flow shop with synchronized periodic maintenance." In 2018 4th International Conference on Optimization and Applications (ICOA). IEEE, 2018. http://dx.doi.org/10.1109/icoa.2018.8370572.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Verma, Mayank, and R. R. K. Sharma. "Lagrangian relaxation and bounded variable linear programs to solve a two level capacitated lot sizing problem." In 2011 3rd International Conference on Electronics Computer Technology (ICECT). IEEE, 2011. http://dx.doi.org/10.1109/icectech.2011.5942078.

Texto completo da fonte

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!