Artículos de revistas sobre el tema "Lagrangian relaxation bounds"
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Consulte los 38 mejores artículos de revistas para su investigación sobre el tema "Lagrangian relaxation bounds".
Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.
También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.
Explore artículos de revistas sobre una amplia variedad de disciplinas y organice su bibliografía correctamente.
Berezovskyi, Oleg. "Improving Lagrange Dual Bounds for Quadratic Extremal Problems". Cybernetics and Computer Technologies, n.º 1 (31 de marzo de 2020): 15–22. http://dx.doi.org/10.34229/2707-451x.20.1.2.
Texto completoDolatabadi, Mohammad, Andrea Lodi y Zahra Afsharnejad. "Improving spectral bounds for clustering problems by Lagrangian relaxation". International Transactions in Operational Research 18, n.º 6 (30 de agosto de 2011): 647–61. http://dx.doi.org/10.1111/j.1475-3995.2011.00825.x.
Texto completoBrown, Nathanael, Bryan Arguello, Linda Nozick y Ningxiong Xu. "A Heuristic Approach to Satellite Range Scheduling With Bounds Using Lagrangian Relaxation". IEEE Systems Journal 12, n.º 4 (diciembre de 2018): 3828–36. http://dx.doi.org/10.1109/jsyst.2018.2821094.
Texto completoMirzaian, Andranik. "Lagrangian relaxation for the star-star concentrator location problem: Approximation algorithm and bounds". Networks 15, n.º 1 (1985): 1–20. http://dx.doi.org/10.1002/net.3230150102.
Texto completoBrown, David B. y James E. Smith. "Index Policies and Performance Bounds for Dynamic Selection Problems". Management Science 66, n.º 7 (julio de 2020): 3029–50. http://dx.doi.org/10.1287/mnsc.2019.3342.
Texto completoBomze, Immanuel M. "Copositive Relaxation Beats Lagrangian Dual Bounds in Quadratically and Linearly Constrained Quadratic Optimization Problems". SIAM Journal on Optimization 25, n.º 3 (enero de 2015): 1249–75. http://dx.doi.org/10.1137/140987997.
Texto completoHosseinian, Seyedmohammadhossein, Dalila B. M. M. Fontes y 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, n.º 3 (julio de 2020): 747–62. http://dx.doi.org/10.1287/ijoc.2019.0898.
Texto completoMellouli, Racem, Imed Kacem, Chérif Sadfi y Chengbin Chu. "Lagrangian relaxation and column generation-based lower bounds for the Pm,hj1‖∑wiCi scheduling problem". Applied Mathematics and Computation 219, n.º 22 (julio de 2013): 10783–805. http://dx.doi.org/10.1016/j.amc.2013.05.004.
Texto completoLv, Xiaofeng, Deyun Zhou, Ling Ma, Yuyuan Zhang y Yongchuan Tang. "An Improved Lagrange Particle Swarm Optimization Algorithm and Its Application in Multiple Fault Diagnosis". Shock and Vibration 2020 (27 de junio de 2020): 1–8. http://dx.doi.org/10.1155/2020/1091548.
Texto completoKim, Sunyoung, Masakazu Kojima y 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, n.º 1-2 (21 de febrero de 2015): 161–87. http://dx.doi.org/10.1007/s10107-015-0874-5.
Texto completoLin, Frank Yeong-Sung, Chiu-Han Hsiao, Kuo-Chung Chu y Yi-Heng Liu. "Minimum-Cost QoS-Constrained Deployment and Routing Policies for Wireless Relay Networks". Journal of Applied Mathematics 2013 (2013): 1–19. http://dx.doi.org/10.1155/2013/517846.
Texto completoRibeiro, Glaydston Mattos y Luiz Antonio Nogueira Lorena. "Lagrangean relaxation bounds for point-feature cartographic label placement problem". Pesquisa Operacional 26, n.º 3 (diciembre de 2006): 459–71. http://dx.doi.org/10.1590/s0101-74382006000300002.
Texto completoAyala, Maria, Christian Artigues y Bernat Gacias. "Lagrangian relaxation-based lower bound for resource-constrained modulo scheduling". Electronic Notes in Discrete Mathematics 36 (agosto de 2010): 191–98. http://dx.doi.org/10.1016/j.endm.2010.05.025.
Texto completoLitvinchev, Igor y Edith L. Ozuna. "Lagrangian Bounds and a Heuristic for the Two-Stage Capacitated Facility Location Problem". International Journal of Energy Optimization and Engineering 1, n.º 1 (enero de 2012): 59–71. http://dx.doi.org/10.4018/ijeoe.2012010104.
Texto completoSmith, T. H. C., T. W. S. Meyer y G. L. Thompson. "Lower bounds for the symmetric travelling salesman problem from Lagrangean relaxations". Discrete Applied Mathematics 26, n.º 2-3 (marzo de 1990): 209–17. http://dx.doi.org/10.1016/0166-218x(90)90101-h.
Texto completoFabri, Marcelus, Helena Ramalhinho, Mauricio C. de Souza y Martin G. Ravetti. "The Lagrangean Relaxation for the Flow Shop Scheduling Problem with Precedence Constraints, Release Dates and Delivery Times". Journal of Advanced Transportation 2019 (23 de diciembre de 2019): 1–10. http://dx.doi.org/10.1155/2019/3176074.
Texto completoBornstein, Claudio Thomas y Manoel Campêlo. "An ADD/DROP procedure for the capacitated plant location problem". Pesquisa Operacional 24, n.º 1 (abril de 2004): 151–62. http://dx.doi.org/10.1590/s0101-74382004000100008.
Texto completoLitvinchev, I., M. Mata y J. Rangel. "Calculating the best dual bound for problems with multiple Lagrangian relaxations". Journal of Computer and Systems Sciences International 49, n.º 6 (diciembre de 2010): 915–22. http://dx.doi.org/10.1134/s1064230710060109.
Texto completoLi, Minghuang y Fusheng Yu. "Semidefinite Programming-Based Method for Implementing Linear Fitting to Interval-Valued Data". International Journal of Fuzzy System Applications 1, n.º 3 (julio de 2011): 32–46. http://dx.doi.org/10.4018/ijfsa.2011070103.
Texto completoShi, Jianmai y Yiping Bao. "Multiproduct Multiperiod Newsvendor Problem with Dynamic Market Efforts". Discrete Dynamics in Nature and Society 2016 (2016): 1–10. http://dx.doi.org/10.1155/2016/7674027.
Texto completoAlenezy, Eiman J. "Solving Capacitated Facility Location Problem Using Lagrangian Decomposition and Volume Algorithm". Advances in Operations Research 2020 (4 de febrero de 2020): 1–7. http://dx.doi.org/10.1155/2020/5239176.
Texto completoHasan, M. Babul y Md Toha. "An Improved Subgradiend Optimization Technique for Solving IPs with Lagrangean Relaxation". Dhaka University Journal of Science 61, n.º 2 (18 de noviembre de 2013): 135–40. http://dx.doi.org/10.3329/dujs.v61i2.17059.
Texto completoTanaka, Shunji y Mituhiko Araki. "A branch-and-bound algorithm with Lagrangian relaxation to minimize total tardiness on identical parallel machines". International Journal of Production Economics 113, n.º 1 (mayo de 2008): 446–58. http://dx.doi.org/10.1016/j.ijpe.2007.10.006.
Texto completoGuignard, Monique. "Strong RLT1 bounds from decomposable Lagrangean relaxation for some quadratic 0–1 optimization problems with linear constraints". Annals of Operations Research 286, n.º 1-2 (21 de noviembre de 2018): 173–200. http://dx.doi.org/10.1007/s10479-018-3092-8.
Texto completoQin, Xiao Wei y Feng Chen. "Multicommodity-Based Delay Analysis for Heterogeneous Wireless Services in Core Network". Applied Mechanics and Materials 198-199 (septiembre de 2012): 1733–38. http://dx.doi.org/10.4028/www.scientific.net/amm.198-199.1733.
Texto completoCampello, Ruy Eduardo y Nelson F. Maculan. "Lagrangean relaxation for a lower bound to a set partitioning problem with side constraints: properties and algorithms". Discrete Applied Mathematics 18, n.º 2 (noviembre de 1987): 119–36. http://dx.doi.org/10.1016/0166-218x(87)90015-1.
Texto completoKim, Jinho, Chang Seob Kim y Zong Woo Geem. "A Memetic Approach for Improving Minimum Cost of Economic Load Dispatch Problems". Mathematical Problems in Engineering 2014 (2014): 1–11. http://dx.doi.org/10.1155/2014/906028.
Texto completoBERRETTA, REGINA, PAULO M. FRANÇA y VINÍCIUS A. ARMENTANO. "METAHEURISTIC APPROACHES FOR THE MULTILEVEL RESOURCE-CONSTRAINED LOT-SIZING PROBLEM WITH SETUP AND LEAD TIMES". Asia-Pacific Journal of Operational Research 22, n.º 02 (junio de 2005): 261–86. http://dx.doi.org/10.1142/s0217595905000510.
Texto completoBianco, Lucio y Massimiliano Caramia. "Minimizing the completion time of a project under resource constraints and feeding precedence relations: a Lagrangian relaxation based lower bound". 4OR 9, n.º 4 (20 de abril de 2011): 371–89. http://dx.doi.org/10.1007/s10288-011-0168-6.
Texto completoTrespalacios, Francisco y Ignacio E. Grossmann. "Lagrangean relaxation of the hull-reformulation of linear generalized disjunctive programs and its use in disjunctive branch and bound". European Journal of Operational Research 253, n.º 2 (septiembre de 2016): 314–27. http://dx.doi.org/10.1016/j.ejor.2016.02.048.
Texto completoBarbot, Nelly, Olivier Boëffard, Jonathan Chevelu y Arnaud Delhay. "Large Linguistic Corpus Reduction with SCP Algorithms". Computational Linguistics 41, n.º 3 (septiembre de 2015): 355–83. http://dx.doi.org/10.1162/coli_a_00225.
Texto completoZhang, Canrong, Tao Wu, Mingyao Qi y Lixin Miao. "Simultaneous Allocation of Berths and Quay Cranes under Discrete Berth Situation". Asia-Pacific Journal of Operational Research 35, n.º 03 (31 de mayo de 2018): 1850011. http://dx.doi.org/10.1142/s0217595918500112.
Texto completoZhou, Binghai y Shi Zong. "Adaptive memory red deer algorithm for cross-dock truck scheduling with products time window". Engineering Computations 38, n.º 8 (8 de marzo de 2021): 3254–89. http://dx.doi.org/10.1108/ec-05-2020-0273.
Texto completoBalseiro, Santiago R., David B. Brown y Chen Chen. "Dynamic Pricing of Relocating Resources in Large Networks". Management Science, 20 de octubre de 2020. http://dx.doi.org/10.1287/mnsc.2020.3735.
Texto completoKawatra, Rakesh. "A Lagrangean Heuristic For The Degree Constrained Minimal Spanning Tree Problem". Review of Business Information Systems (RBIS) 14, n.º 3 (1 de julio de 2010). http://dx.doi.org/10.19030/rbis.v14i3.493.
Texto completoSingh, Bismark y Bernard Knueven. "Lagrangian relaxation based heuristics for a chance-constrained optimization model of a hybrid solar-battery storage system". Journal of Global Optimization, 1 de junio de 2021. http://dx.doi.org/10.1007/s10898-021-01041-y.
Texto completoFattahi, Parviz y Mehdi Tanhatalab. "Stochastic inventory-routing problem with lateral transshipment for perishable product". Journal of Modelling in Management ahead-of-print, ahead-of-print (3 de junio de 2021). http://dx.doi.org/10.1108/jm2-09-2019-0230.
Texto completoDecerle, Jérémy, Olivier Grunder, Amir Hajjam El Hassani y Oussama Barakat. "A matheuristic-based approach for the multi-depot home health care assignment, routing and scheduling problem". RAIRO - Operations Research, 1 de junio de 2020. http://dx.doi.org/10.1051/ro/2020057.
Texto completo