IDEAS home Printed from https://ideas.repec.org/r/inm/ormnsc/v27y1981i1p1-18.html
   My bibliography  Save this item

The Lagrangian Relaxation Method for Solving Integer Programming Problems

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as


Cited by:

  1. Narasimhan, Sridhar & Soni, Samit & Song, Sang Hwa, 2006. "ATM network design for corporate networks," European Journal of Operational Research, Elsevier, vol. 170(2), pages 644-663, April.
  2. N Aras & M Orbay & I K Altinel, 2008. "Efficient heuristics for the rectilinear distance capacitated multi-facility Weber problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(1), pages 64-79, January.
  3. Yun Bai & Xiaopeng Li & Fan Peng & Xin Wang & Yanfeng Ouyang, 2015. "Effects of Disruption Risks on Biorefinery Location Design," Energies, MDPI, vol. 8(2), pages 1-19, February.
  4. Bai, Yun & Hwang, Taesung & Kang, Seungmo & Ouyang, Yanfeng, 2011. "Biofuel refinery location and supply chain planning under traffic congestion," Transportation Research Part B: Methodological, Elsevier, vol. 45(1), pages 162-175, January.
  5. Li, Han-Lin & Tsai, Jung-Fa, 2008. "A distributed computation algorithm for solving portfolio problems with integer variables," European Journal of Operational Research, Elsevier, vol. 186(2), pages 882-891, April.
  6. W. Lambert & A. Newman, 2014. "Tailored Lagrangian Relaxation for the open pit block sequencing problem," Annals of Operations Research, Springer, vol. 222(1), pages 419-438, November.
  7. P N Ram Kumar & T T Narendran, 2011. "On the usage of Lagrangean Relaxation for the convoy movement problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(4), pages 722-728, April.
  8. Hanif D. Sherali & Churlzu Lim, 2007. "Enhancing Lagrangian Dual Optimization for Linear Programs by Obviating Nondifferentiability," INFORMS Journal on Computing, INFORMS, vol. 19(1), pages 3-13, February.
  9. Tingting Cui & Yanfeng Ouyang & Zuo-Jun Max Shen, 2010. "Reliable Facility Location Design Under the Risk of Disruptions," Operations Research, INFORMS, vol. 58(4-part-1), pages 998-1011, August.
  10. Brian T. Downs & Jeffrey D. Camm, 1996. "An exact algorithm for the maximal covering problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(3), pages 435-461, April.
  11. U. Brännlund & P. O. Lindberg & A. Nõu & J.-E. Nilsson, 1998. "Railway Timetabling Using Lagrangian Relaxation," Transportation Science, INFORMS, vol. 32(4), pages 358-369, November.
  12. Balaji Gopalakrishnan & Ellis. Johnson, 2005. "Airline Crew Scheduling: State-of-the-Art," Annals of Operations Research, Springer, vol. 140(1), pages 305-337, November.
  13. Yagiura, Mutsunori & Ibaraki, Toshihide & Glover, Fred, 2006. "A path relinking approach with ejection chains for the generalized assignment problem," European Journal of Operational Research, Elsevier, vol. 169(2), pages 548-569, March.
  14. Cattrysse, D. G. & van Wassenhove, L. N., 1990. "A Survey Of Algorithms For The Generalized Assignment Problem," Econometric Institute Archives 272389, Erasmus University Rotterdam.
  15. Thomalla, Christoph S., 2001. "Job shop scheduling with alternative process plans," International Journal of Production Economics, Elsevier, vol. 74(1-3), pages 125-134, December.
  16. Cruz, F. R. B. & Smith, J. MacGregor & Mateus, G. R., 1999. "Algorithms for a multi-level network optimization problem," European Journal of Operational Research, Elsevier, vol. 118(1), pages 164-180, October.
  17. Rakesh Kawatra, 2022. "Design of capacitated degree constrained min-sum arborescence," OPSEARCH, Springer;Operational Research Society of India, vol. 59(3), pages 1038-1054, September.
  18. Foad Iravani & Sriram Dasu & Reza Ahmadi, 2012. "A Hierarchical Framework for Organizing a Software Development Process," Operations Research, INFORMS, vol. 60(6), pages 1310-1322, December.
  19. Tiago Andrade & Nikita Belyak & Andrew Eberhard & Silvio Hamacher & Fabricio Oliveira, 2022. "The p-Lagrangian relaxation for separable nonconvex MIQCQP problems," Journal of Global Optimization, Springer, vol. 84(1), pages 43-76, September.
  20. Mazzola, Joseph B. & Neebe, Alan W., 1999. "Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type," European Journal of Operational Research, Elsevier, vol. 115(2), pages 285-299, June.
  21. Daniel Potthoff & Dennis Huisman & Guy Desaulniers, 2010. "Column Generation with Dynamic Duty Selection for Railway Crew Rescheduling," Transportation Science, INFORMS, vol. 44(4), pages 493-505, November.
  22. An, Shi & Cui, Na & Bai, Yun & Xie, Weijun & Chen, Mingliu & Ouyang, Yanfeng, 2015. "Reliable emergency service facility location under facility disruption, en-route congestion and in-facility queuing," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 82(C), pages 199-216.
  23. Samadi, Mohammadreza & Nikolaev, Alexander & Nagi, Rakesh, 2016. "A subjective evidence model for influence maximization in social networks," Omega, Elsevier, vol. 59(PB), pages 263-278.
  24. Berman, Oded & Krass, Dmitry & Tajbakhsh, M. Mahdi, 2012. "A coordinated location-inventory model," European Journal of Operational Research, Elsevier, vol. 217(3), pages 500-508.
  25. Shin-yi Wu & Pei-yu Chen, 2008. "Versioning and Piracy Control for Digital Information Goods," Operations Research, INFORMS, vol. 56(1), pages 157-172, February.
  26. Lian Qi & Zuo-Jun Max Shen & Lawrence V. Snyder, 2010. "The Effect of Supply Disruptions on Supply Chain Design Decisions," Transportation Science, INFORMS, vol. 44(2), pages 274-289, May.
  27. Lixin Tang & Gongshu Wang & Jiyin Liu & Jingyi Liu, 2011. "A combination of Lagrangian relaxation and column generation for order batching in steelmaking and continuous‐casting production," Naval Research Logistics (NRL), John Wiley & Sons, vol. 58(4), pages 370-388, June.
  28. Elendner, Thomas, 2003. "Scheduling and combinatorial auctions: Lagrangean relaxation-based bonds for the WJISP," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 570, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
  29. Keliang Wang & Leonardo Lozano & Carlos Cardonha & David Bergman, 2023. "Optimizing over an Ensemble of Trained Neural Networks," INFORMS Journal on Computing, INFORMS, vol. 35(3), pages 652-674, May.
  30. Kroon, Leo G. & Salomon, Marc & Van Wassenhove, Luk N., 1995. "Exact and approximation algorithms for the operational fixed interval scheduling problem," European Journal of Operational Research, Elsevier, vol. 82(1), pages 190-205, April.
  31. Kawatra, Rakesh & Bricker, Dennis, 2004. "Design of a degree-constrained minimal spanning tree with unreliable links and node outage costs," European Journal of Operational Research, Elsevier, vol. 156(1), pages 73-82, July.
  32. Lorena, Luiz Antonio N. & Goncalves Narciso, Marcelo, 2002. "Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems," European Journal of Operational Research, Elsevier, vol. 138(3), pages 473-483, May.
  33. Joseph B. Mazzola & Alan W. Neebe, 2012. "A generalized assignment model for dynamic supply chain capacity planning," Naval Research Logistics (NRL), John Wiley & Sons, vol. 59(6), pages 470-485, September.
  34. Narciso, Marcelo G. & Lorena, Luiz Antonio N., 1999. "Lagrangean/surrogate relaxation for generalized assignment problems," European Journal of Operational Research, Elsevier, vol. 114(1), pages 165-177, April.
  35. Dean D. Dewolfe & James G. Stevens & R. Kevin Wood, 1993. "Setting military reenlistment bonuses," Naval Research Logistics (NRL), John Wiley & Sons, vol. 40(2), pages 143-160, March.
  36. Tiwari, Richa & Jayaswal, Sachin & Sinha, Ankur, 2019. "Competitive Hub Location Problems: Model and Solution Approaches," IIMA Working Papers WP 2019-12-02, Indian Institute of Management Ahmedabad, Research and Publication Department.
  37. M. Flavia Monaco & Marcello Sammarra, 2007. "The Berth Allocation Problem: A Strong Formulation Solved by a Lagrangean Approach," Transportation Science, INFORMS, vol. 41(2), pages 265-280, May.
  38. Renato de Matta & Vernon Ning Hsu & Timothy J. Lowe, 1999. "Capacitated selection problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 46(1), pages 19-37, February.
  39. Rajagopalan, S. & Yu, Hung-Liang, 2001. "Capacity planning with congestion effects," European Journal of Operational Research, Elsevier, vol. 134(2), pages 365-377, October.
  40. Ohlmann, Jeffrey W. & Bean, James C., 2009. "Resource-constrained management of heterogeneous assets with stochastic deterioration," European Journal of Operational Research, Elsevier, vol. 199(1), pages 198-208, November.
  41. Kai Pan & Yongpei Guan, 2022. "Integrated Stochastic Optimal Self-Scheduling for Two-Settlement Electricity Markets," INFORMS Journal on Computing, INFORMS, vol. 34(3), pages 1819-1840, May.
  42. Tragantalerngsak, Suda & Holt, John & Ronnqvist, Mikael, 2000. "An exact method for the two-echelon, single-source, capacitated facility location problem," European Journal of Operational Research, Elsevier, vol. 123(3), pages 473-489, June.
  43. Wolosewicz, Cathy & Dauzère-Pérès, Stéphane & Aggoune, Riad, 2015. "A Lagrangian heuristic for an integrated lot-sizing and fixed scheduling problem," European Journal of Operational Research, Elsevier, vol. 244(1), pages 3-12.
  44. Ibrahim Muter & Tevfik Aytekin, 2017. "Incorporating Aggregate Diversity in Recommender Systems Using Scalable Optimization Approaches," INFORMS Journal on Computing, INFORMS, vol. 29(3), pages 405-421, August.
  45. van der Bruggen, Lambert & Gruson, Ruud & Salomon, Marc, 1995. "Reconsidering the distribution structure of gasoline products for a large oil company," European Journal of Operational Research, Elsevier, vol. 81(3), pages 460-473, March.
  46. Nadjib Brahimi & Stéphane Dauzère-Pérès & Najib M. Najid, 2006. "Capacitated Multi-Item Lot-Sizing Problems with Time Windows," Operations Research, INFORMS, vol. 54(5), pages 951-967, October.
  47. Joshua Q. Hale & Enlu Zhou & Jiming Peng, 2017. "A Lagrangian search method for the P-median problem," Journal of Global Optimization, Springer, vol. 69(1), pages 137-156, September.
  48. Lin, Dung-Ying & Ku, Yu-Hsiung, 2014. "An implicit enumeration algorithm for the passenger service planning problem: Application to the Taiwan Railways Administration line," European Journal of Operational Research, Elsevier, vol. 238(3), pages 863-875.
  49. Huisman, D. & Jans, R.F. & Peeters, M. & Wagelmans, A.P.M., 2003. "Combining Column Generation and Lagrangian Relaxation," ERIM Report Series Research in Management ERS-2003-092-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
  50. Fragkos, Ioannis & Cordeau, Jean-François & Jans, Raf, 2021. "Decomposition methods for large-scale network expansion problems," Transportation Research Part B: Methodological, Elsevier, vol. 144(C), pages 60-80.
  51. Lorena, Luiz Antonio N. & Narciso, Marcelo G., 1996. "Relaxation heuristics for a generalized assignment problem," European Journal of Operational Research, Elsevier, vol. 91(3), pages 600-610, June.
  52. Rizk, Nafee & Martel, Alain & Ramudhin, Amar, 2006. "A Lagrangean relaxation algorithm for multi-item lot-sizing problems with joint piecewise linear resource costs," International Journal of Production Economics, Elsevier, vol. 102(2), pages 344-357, August.
  53. Jang, Jinbong & Choi, Jiwoong & Bae, Hee-Jin & Choi, In-Chan, 2013. "Image collection planning for KOrea Multi-Purpose SATellite-2," European Journal of Operational Research, Elsevier, vol. 230(1), pages 190-199.
  54. Kristin Sahyouni & R. Canan Savaskan & Mark S. Daskin, 2007. "A Facility Location Model for Bidirectional Flows," Transportation Science, INFORMS, vol. 41(4), pages 484-499, November.
  55. Reza Ahmadi & Uttarayan Bagchi & Thomas A. Roemer, 2005. "Coordinated scheduling of customer orders for quick response," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(6), pages 493-512, September.
  56. Luohao Tang & Cheng Zhu & Zaili Lin & Jianmai Shi & Weiming Zhang, 2016. "Reliable Facility Location Problem with Facility Protection," PLOS ONE, Public Library of Science, vol. 11(9), pages 1-24, September.
  57. Bala Shetty, 1990. "A relaxation/decomposition algorithm for the fixed charged network problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 37(2), pages 327-340, April.
  58. Wang, Xiaotian & Wang, Xin, 2019. "Flexible parking reservation system and pricing: A continuum approximation approach," Transportation Research Part B: Methodological, Elsevier, vol. 128(C), pages 408-434.
  59. Yu, Guodong & Haskell, William B. & Liu, Yang, 2017. "Resilient facility location against the risk of disruptions," Transportation Research Part B: Methodological, Elsevier, vol. 104(C), pages 82-105.
  60. Jeet, V. & Kutanoglu, E., 2007. "Lagrangian relaxation guided problem space search heuristics for generalized assignment problems," European Journal of Operational Research, Elsevier, vol. 182(3), pages 1039-1056, November.
  61. Imai, Akio & Nishimura, Etsuko & Papadimitriou, Stratos, 2001. "The dynamic berth allocation problem for a container port," Transportation Research Part B: Methodological, Elsevier, vol. 35(4), pages 401-417, May.
  62. Joseph B. Mazzola & Steven P. Wilcox, 2001. "Heuristics for the multi‐resource generalized assignment problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 48(6), pages 468-483, September.
  63. Samir Elhedhli & Huyu Wu, 2010. "A Lagrangean Heuristic for Hub-and-Spoke System Design with Capacity Selection and Congestion," INFORMS Journal on Computing, INFORMS, vol. 22(2), pages 282-296, May.
  64. Kaiyue Zheng & Laura A. Albert, 2019. "Interdiction models for delaying adversarial attacks against critical information technology infrastructure," Naval Research Logistics (NRL), John Wiley & Sons, vol. 66(5), pages 411-429, August.
  65. Yun, Lifen & Qin, Yong & Fan, Hongqiang & Ji, Changxu & Li, Xiaopeng & Jia, Limin, 2015. "A reliability model for facility location design under imperfect information," Transportation Research Part B: Methodological, Elsevier, vol. 81(P2), pages 596-615.
  66. Shi, Yue & Xiang, Yisha & Xiao, Hui & Xing, Liudong, 2021. "Joint optimization of budget allocation and maintenance planning of multi-facility transportation infrastructure systems," European Journal of Operational Research, Elsevier, vol. 288(2), pages 382-393.
  67. Zhang, Yongxiang & Peng, Qiyuan & Yao, Yu & Zhang, Xin & Zhou, Xuesong, 2019. "Solving cyclic train timetabling problem through model reformulation: Extended time-space network construct and Alternating Direction Method of Multipliers methods," Transportation Research Part B: Methodological, Elsevier, vol. 128(C), pages 344-379.
  68. Altinkemer, Kemal & Kazaz, Burak & Koksalan, Murat & Moskowitz, Herbert, 2000. "Optimization of printed circuit board manufacturing: Integrated modeling and algorithms," European Journal of Operational Research, Elsevier, vol. 124(2), pages 409-421, July.
  69. Zhang, Yongxiang & Peng, Qiyuan & Lu, Gongyuan & Zhong, Qingwei & Yan, Xu & Zhou, Xuesong, 2022. "Integrated line planning and train timetabling through price-based cross-resolution feedback mechanism," Transportation Research Part B: Methodological, Elsevier, vol. 155(C), pages 240-277.
  70. Pisinger, David, 1995. "A minimal algorithm for the multiple-choice knapsack problem," European Journal of Operational Research, Elsevier, vol. 83(2), pages 394-410, June.
  71. Marjan van den Akker & Han Hoogeveen & Steef van de Velde, 2002. "Combining Column Generation and Lagrangean Relaxation to Solve a Single-Machine Common Due Date Problem," INFORMS Journal on Computing, INFORMS, vol. 14(1), pages 37-51, February.
  72. Noura Al-Dhaheri & Ali Diabat, 2017. "A Lagrangian relaxation-based heuristic for the multi-ship quay crane scheduling problem with ship stability constraints," Annals of Operations Research, Springer, vol. 248(1), pages 1-24, January.
  73. Jon Lee, 1998. "Constrained Maximum-Entropy Sampling," Operations Research, INFORMS, vol. 46(5), pages 655-664, October.
  74. Dong-Guen Kim & Yeong-Dae Kim, 2013. "A Lagrangian heuristic algorithm for a public healthcare facility location problem," Annals of Operations Research, Springer, vol. 206(1), pages 221-240, July.
  75. Yan, Shangyao & Yang, Dah-Hwei, 1996. "A decision support framework for handling schedule perturbation," Transportation Research Part B: Methodological, Elsevier, vol. 30(6), pages 405-419, December.
  76. Gupta, Sushil & Dutta, Kaushik, 2011. "Modeling of financial supply chain," European Journal of Operational Research, Elsevier, vol. 211(1), pages 47-56, May.
  77. Xiang Li & Asgeir Tomasgard & Paul I. Barton, 2011. "Nonconvex Generalized Benders Decomposition for Stochastic Separable Mixed-Integer Nonlinear Programs," Journal of Optimization Theory and Applications, Springer, vol. 151(3), pages 425-454, December.
  78. Zohreh Hosseini Nodeh & Ali Babapour Azar & Rashed Khanjani Shiraz & Salman Khodayifar & Panos M. Pardalos, 2020. "Joint chance constrained shortest path problem with Copula theory," Journal of Combinatorial Optimization, Springer, vol. 40(1), pages 110-140, July.
  79. Ishwar Murthy & Shenq‐Shyong Her, 1992. "Solving min‐max shortest‐path problems on a network," Naval Research Logistics (NRL), John Wiley & Sons, vol. 39(5), pages 669-683, August.
  80. Faddoul, R. & Raphael, W. & Chateauneuf, A., 2018. "Maintenance optimization of series systems subject to reliability constraints," Reliability Engineering and System Safety, Elsevier, vol. 180(C), pages 179-188.
  81. Yong Liang & Mengshi Lu & Zuo‐Jun Max Shen & Runyu Tang, 2021. "Data Center Network Design for Internet‐Related Services and Cloud Computing," Production and Operations Management, Production and Operations Management Society, vol. 30(7), pages 2077-2101, July.
  82. Syam Menon & Ali Amiri, 2004. "Scheduling Banner Advertisements on the Web," INFORMS Journal on Computing, INFORMS, vol. 16(1), pages 95-105, February.
  83. Kaushik Dutta & Samit Soni & Sridhar Narasimhan & Anindya Datta, 2006. "Optimization in Object Caching," INFORMS Journal on Computing, INFORMS, vol. 18(2), pages 243-254, May.
  84. Raymond K. Cheung & Chung-Lun Li & Wuqin Lin, 2002. "Interblock Crane Deployment in Container Terminals," Transportation Science, INFORMS, vol. 36(1), pages 79-93, February.
  85. Zheng, Jianfeng & Meng, Qiang & Sun, Zhuo, 2014. "Impact analysis of maritime cabotage legislations on liner hub-and-spoke shipping network design," European Journal of Operational Research, Elsevier, vol. 234(3), pages 874-884.
  86. Zhao, Meng & Li, Xiaopeng & Yin, Jiateng & Cui, Jianxun & Yang, Lixing & An, Shi, 2018. "An integrated framework for electric vehicle rebalancing and staff relocation in one-way carsharing systems: Model formulation and Lagrangian relaxation-based solution approach," Transportation Research Part B: Methodological, Elsevier, vol. 117(PA), pages 542-572.
  87. Fu Lin & Sven Leyffer & Todd Munson, 2016. "A two-level approach to large mixed-integer programs with application to cogeneration in energy-efficient buildings," Computational Optimization and Applications, Springer, vol. 65(1), pages 1-46, September.
  88. J. E. Beasley, 1990. "A lagrangian heuristic for set‐covering problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 37(1), pages 151-164, February.
  89. Vijay Aggarwal & Narsingh Deo & Dilip Sarkar, 1992. "The knapsack problem with disjoint multiple‐choice constraints," Naval Research Logistics (NRL), John Wiley & Sons, vol. 39(2), pages 213-227, March.
  90. R A Gerrard & R L Church, 1995. "A General Construct for the Zonally Constrained p-Median Problem," Environment and Planning B, , vol. 22(2), pages 213-236, April.
  91. Dupont, Lionel, 2008. "Branch and bound algorithm for a facility location problem with concave site dependent costs," International Journal of Production Economics, Elsevier, vol. 112(1), pages 245-254, March.
  92. Ventura, Jose A. & Radhakrishnan, Sanjay, 2003. "Single machine scheduling with symmetric earliness and tardiness penalties," European Journal of Operational Research, Elsevier, vol. 144(3), pages 598-612, February.
  93. Brimberg, Jack & Mehrez, Abraham & Oron, Gideon, 1995. "An integrated model for the development of marginal water sources in the Negev Desert," European Journal of Operational Research, Elsevier, vol. 81(1), pages 35-49, February.
  94. An, Kun & Xie, Siyang & Ouyang, Yanfeng, 2018. "Reliable sensor location for object positioning and surveillance via trilateration," Transportation Research Part B: Methodological, Elsevier, vol. 117(PB), pages 956-970.
  95. Saligrama R. Agnihothri & Sridhar Narasimhan & Hasan Pirkul, 1990. "An assignment problem with queueing time cost," Naval Research Logistics (NRL), John Wiley & Sons, vol. 37(2), pages 231-244, April.
  96. Felipe Caro & Kumar Rajaram & Jens Wollenweber, 2012. "Process Location and Product Distribution with Uncertain Yields," Operations Research, INFORMS, vol. 60(5), pages 1050-1063, October.
  97. Hadjiconstantinou, Eleni & Christofides, Nicos, 1995. "An exact algorithm for general, orthogonal, two-dimensional knapsack problems," European Journal of Operational Research, Elsevier, vol. 83(1), pages 39-56, May.
  98. Kasilingam, R. G., 1997. "Air cargo revenue management: Characteristics and complexities," European Journal of Operational Research, Elsevier, vol. 96(1), pages 36-44, January.
  99. M Diaby & A L Nsakanda, 2006. "Large-scale capacitated part-routing in the presence of process and routing flexibilities and setup costs," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(9), pages 1100-1112, September.
  100. Larry J. Leblanc, 1987. "Optimization methods for large‐scale multiechelon stockage problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 34(2), pages 239-249, April.
  101. Ogbe, Emmanuel & Li, Xiang, 2017. "A new cross decomposition method for stochastic mixed-integer linear programming," European Journal of Operational Research, Elsevier, vol. 256(2), pages 487-499.
  102. Shangyao Yan & Ching-Hui Tang, 2008. "An Integrated Framework for Intercity Bus Scheduling Under Stochastic Bus Travel Times," Transportation Science, INFORMS, vol. 42(3), pages 318-335, August.
  103. Ishwar Murthy, 1993. "Solving the multiperiod assignment problem with start‐up costs using dual ascent," Naval Research Logistics (NRL), John Wiley & Sons, vol. 40(3), pages 325-344, April.
  104. Emmanuel Ogbe & Xiang Li, 2019. "A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs," Journal of Global Optimization, Springer, vol. 75(3), pages 595-629, November.
  105. Lieshout, P.M.D. & Volgenant, A., 2007. "A branch-and-bound algorithm for the singly constrained assignment problem," European Journal of Operational Research, Elsevier, vol. 176(1), pages 151-164, January.
  106. Pimentel, Bruno S. & Mateus, Geraldo R. & Almeida, Franklin A., 2013. "Stochastic capacity planning and dynamic network design," International Journal of Production Economics, Elsevier, vol. 145(1), pages 139-149.
  107. Khosla, Inder, 1995. "The scheduling problem where multiple machines compete for a common local buffer," European Journal of Operational Research, Elsevier, vol. 84(2), pages 330-342, July.
  108. van Norden, Linda & van de Velde, Steef, 2005. "Multi-product lot-sizing with a transportation capacity reservation contract," European Journal of Operational Research, Elsevier, vol. 165(1), pages 127-138, August.
  109. Gunnarsson, Helene & Rönnqvist, Mikael, 2008. "Solving a multi-period supply chain problem for a pulp company using heuristics--An application to Södra Cell AB," International Journal of Production Economics, Elsevier, vol. 116(1), pages 75-94, November.
  110. Ghadimi, Foad & Aouam, Tarik, 2021. "Planning capacity and safety stocks in a serial production–distribution system with multiple products," European Journal of Operational Research, Elsevier, vol. 289(2), pages 533-552.
  111. Chhajed, Dilip, 1995. "A fixed interval due-date scheduling problem with earliness and due-date costs," European Journal of Operational Research, Elsevier, vol. 84(2), pages 385-401, July.
  112. Li, Xiaopeng & Ouyang, Yanfeng, 2011. "Reliable sensor deployment for network traffic surveillance," Transportation Research Part B: Methodological, Elsevier, vol. 45(1), pages 218-231, January.
  113. H Lee & D H Ahn & S Kim, 2003. "Optimal routing in non-geostationary satellite ATM networks with intersatellite link capacity constraints," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(4), pages 401-409, April.
  114. Song, Jiongjiong & Regan, Amelia C. & Nandiraju, Srinivas, 2008. "A Bid Analysis Model with Business Constraints for Transportation Procurement Auctions," University of California Transportation Center, Working Papers qt24817929, University of California Transportation Center.
  115. Peters, Emmanuel & de Matta, Renato & Boe, Warren, 2007. "Short-term work scheduling with job assignment flexibility for a multi-fleet transport system," European Journal of Operational Research, Elsevier, vol. 180(1), pages 82-98, July.
  116. Churlzu Lim & Hanif Sherali, 2006. "A Trust Region Target Value Method for Optimizing Nondifferentiable Lagrangian Duals of Linear Programs," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 64(1), pages 33-53, August.
  117. Cui, Tingting & Ouyang, Yanfeng & Shen, Zuo-Jun Max J, 2010. "Reliable Facility Location Design under the Risk of Disruptions," University of California Transportation Center, Working Papers qt5sh2c7pw, University of California Transportation Center.
  118. de Vries, Sven & Schummer, James & Vohra, Rakesh V., 2007. "On ascending Vickrey auctions for heterogeneous objects," Journal of Economic Theory, Elsevier, vol. 132(1), pages 95-118, January.
  119. Eliashberg, Jehoshua & Hegie, Quintus & Ho, Jason & Huisman, Dennis & Miller, Steven J. & Swami, Sanjeev & Weinberg, Charles B. & Wierenga, Berend, 2009. "Demand-driven scheduling of movies in a multiplex," International Journal of Research in Marketing, Elsevier, vol. 26(2), pages 75-88.
  120. Haiqing Song & Vernon N. Hsu & Raymond K. Cheung, 2008. "Distribution Coordination Between Suppliers and Customers with a Consolidation Center," Operations Research, INFORMS, vol. 56(5), pages 1264-1277, October.
  121. Yamada, Takeo & Takeoka, Takahiro, 2009. "An exact algorithm for the fixed-charge multiple knapsack problem," European Journal of Operational Research, Elsevier, vol. 192(2), pages 700-705, January.
  122. Berman, Oded & Hajizadeh, Iman & Krass, Dmitry & Rahimi-Vahed, Alireza, 2018. "Reconfiguring a set of coverage-providing facilities under travel time uncertainty," Socio-Economic Planning Sciences, Elsevier, vol. 62(C), pages 1-12.
  123. Mutsunori Yagiura & Toshihide Ibaraki & Fred Glover, 2004. "An Ejection Chain Approach for the Generalized Assignment Problem," INFORMS Journal on Computing, INFORMS, vol. 16(2), pages 133-151, May.
  124. Li, Gang & Balakrishnan, Anantaram, 2016. "Models and algorithms for network reduction," European Journal of Operational Research, Elsevier, vol. 248(3), pages 930-942.
  125. Tiwari, Richa & Jayaswal, Sachin & Sinha, Ankur, 2021. "Alternate solution approaches for competitive hub location problems," European Journal of Operational Research, Elsevier, vol. 290(1), pages 68-80.
  126. Wang, Peirong (Slade) & Li, Pengfei (Taylor) & Chowdhury, Farzana R. & Zhang, Li & Zhou, Xuesong, 2020. "A mixed integer programming formulation and scalable solution algorithms for traffic control coordination across multiple intersections based on vehicle space-time trajectories," Transportation Research Part B: Methodological, Elsevier, vol. 134(C), pages 266-304.
  127. Wu, Dexiang & Kwon, Roy H. & Costa, Giorgio, 2017. "A constrained cluster-based approach for tracking the S&P 500 index," International Journal of Production Economics, Elsevier, vol. 193(C), pages 222-243.
  128. Tanaka, Shunji & Araki, Mituhiko, 2008. "A branch-and-bound algorithm with Lagrangian relaxation to minimize total tardiness on identical parallel machines," International Journal of Production Economics, Elsevier, vol. 113(1), pages 446-458, May.
  129. Springborn, Michael R., 2014. "Risk aversion and adaptive management: Insights from a multi-armed bandit model of invasive species risk," Journal of Environmental Economics and Management, Elsevier, vol. 68(2), pages 226-242.
  130. Weiner, Jake & Ernst, Andreas T. & Li, Xiaodong & Sun, Yuan & Deb, Kalyanmoy, 2021. "Solving the maximum edge disjoint path problem using a modified Lagrangian particle swarm optimisation hybrid," European Journal of Operational Research, Elsevier, vol. 293(3), pages 847-862.
  131. Keskin, Muhammed Emre, 2017. "A column generation heuristic for optimal wireless sensor network design with mobile sinks," European Journal of Operational Research, Elsevier, vol. 260(1), pages 291-304.
  132. Nourbakhsh, Seyed Mohammad & Ouyang, Yanfeng, 2010. "Optimal fueling strategies for locomotive fleets in railroad networks," Transportation Research Part B: Methodological, Elsevier, vol. 44(8-9), pages 1104-1114, September.
  133. Mark S. Daskin, 2008. "What you should know about location modeling," Naval Research Logistics (NRL), John Wiley & Sons, vol. 55(4), pages 283-294, June.
  134. Xue, Li & Luo, Zhixing & Lim, Andrew, 2015. "Two exact algorithms for the traveling umpire problem," European Journal of Operational Research, Elsevier, vol. 243(3), pages 932-943.
  135. Marshall L. Fisher, 2004. "Comments on ÜThe Lagrangian Relaxation Method for Solving Integer Programming ProblemsÝ," Management Science, INFORMS, vol. 50(12_supple), pages 1872-1874, December.
  136. Zhu, Xiaoyan & Wilhelm, Wilbert E., 2007. "Three-stage approaches for optimizing some variations of the resource constrained shortest-path sub-problem in a column generation context," European Journal of Operational Research, Elsevier, vol. 183(2), pages 564-577, December.
  137. Simin Huang & Rajan Batta & Rakesh Nagi, 2005. "Distribution network design: Selection and sizing of congested connections," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(8), pages 701-712, December.
  138. Eleftherios Iakovou & Christos Douligeris & Huan Li & Chi Ip & Lalit Yudhbir, 1999. "A Maritime Global Route Planning Model for Hazardous Materials Transportation," Transportation Science, INFORMS, vol. 33(1), pages 34-48, February.
  139. X. J. Zheng & X. L. Sun & D. Li, 2010. "Separable Relaxation for Nonconvex Quadratic Integer Programming: Integer Diagonalization Approach," Journal of Optimization Theory and Applications, Springer, vol. 146(2), pages 463-489, August.
  140. Gregory Tauer & Rakesh Nagi & Moises Sudit, 2013. "The graph association problem: Mathematical models and a lagrangian heuristic," Naval Research Logistics (NRL), John Wiley & Sons, vol. 60(3), pages 251-268, April.
  141. Bigler, T. & Kammermann, M. & Baumann, P., 2023. "A matheuristic for a customer assignment problem in direct marketing," European Journal of Operational Research, Elsevier, vol. 304(2), pages 689-708.
  142. Anne de Jongh & Michel Gendreau & Martine Labbé, 1999. "Finding Disjoint Routes in Telecommunications Networks with Two Technologies," Operations Research, INFORMS, vol. 47(1), pages 81-92, February.
  143. Larsson, Torbjörn & Marklund, Johan & Olsson, Caroline & Patriksson, Michael, 2008. "Convergent Lagrangian heuristics for nonlinear minimum cost network flows," European Journal of Operational Research, Elsevier, vol. 189(2), pages 324-346, September.
  144. Atoosa Kasirzadeh & Mohammed Saddoune & François Soumis, 2017. "Airline crew scheduling: models, algorithms, and data sets," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 6(2), pages 111-137, June.
  145. Monique Guignard, 2003. "Lagrangean relaxation," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 11(2), pages 151-200, December.
  146. Gregory Dobson & Ramakrishnan S. Nambimadom, 2001. "The Batch Loading and Scheduling Problem," Operations Research, INFORMS, vol. 49(1), pages 52-65, February.
  147. Imai, Akio & Nishimura, Etsuko & Current, John, 2007. "A Lagrangian relaxation-based heuristic for the vehicle routing with full container load," European Journal of Operational Research, Elsevier, vol. 176(1), pages 87-105, January.
  148. Ahmadi, Reza H. & Kouvelis, Panagiotis, 1999. "Design of electronic assembly lines: An analytical framework and its application," European Journal of Operational Research, Elsevier, vol. 115(1), pages 113-137, May.
  149. Diaby, Moustapha, 2000. "Integrated batch size and setup reduction decisions in multi-product, dynamic manufacturing environments," International Journal of Production Economics, Elsevier, vol. 67(3), pages 219-233, October.
  150. Chu, James C. & Huang, Kai-Hsiang, 2018. "Mathematical programming framework for modeling and comparing network-level pavement maintenance strategies," Transportation Research Part B: Methodological, Elsevier, vol. 109(C), pages 1-25.
  151. Kraft, Edwin R., 2002. "Scheduling railway freight delivery appointments using a bid price approach," Transportation Research Part A: Policy and Practice, Elsevier, vol. 36(2), pages 145-165, February.
  152. Daniel Adelman, 2003. "Price-Directed Replenishment of Subsets: Methodology and Its Application to Inventory Routing," Manufacturing & Service Operations Management, INFORMS, vol. 5(4), pages 348-371, May.
  153. Alminana, Marcos & Pastor, Jesus T., 1997. "An adaptation of SH heuristic to the location set covering problem," European Journal of Operational Research, Elsevier, vol. 100(3), pages 586-593, August.
  154. Michael Lim & Mark S. Daskin & Achal Bassamboo & Sunil Chopra, 2010. "A facility reliability problem: Formulation, properties, and algorithm," Naval Research Logistics (NRL), John Wiley & Sons, vol. 57(1), pages 58-70, February.
  155. Shin-yi Wu & Lorin M. Hitt & Pei-yu Chen & G. Anandalingam, 2008. "Customized Bundle Pricing for Information Goods: A Nonlinear Mixed-Integer Programming Approach," Management Science, INFORMS, vol. 54(3), pages 608-622, March.
  156. Vincent Tulasi & Isaac Kwasi Adu & Elikem Kofi Krampa, 2016. "Location of Farmers Warehouse at Adaklu Traditional Area, Volta Region, Ghana," Journal of Optimization, Hindawi, vol. 2016, pages 1-10, July.
  157. Hanif Sherali & J. Smith, 2012. "Dynamic Lagrangian dual and reduced RLT constructs for solving 0–1 mixed-integer programs," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 20(1), pages 173-189, April.
  158. Tiwari, Richa & Jayaswal, Sachin & Sinha, Ankur, 2021. "Competitive hub location problem: Model and solution approaches," Transportation Research Part B: Methodological, Elsevier, vol. 146(C), pages 237-261.
  159. Xiaoling Sun & Duan Li, 2000. "Asymptotic Strong Duality for Bounded Integer Programming: A Logarithmic-Exponential Dual Formulation," Mathematics of Operations Research, INFORMS, vol. 25(4), pages 625-644, November.
  160. Bai, Yun & Ouyang, Yanfeng & Pang, Jong-Shi, 2016. "Enhanced models and improved solution for competitive biofuel supply chain design under land use constraints," European Journal of Operational Research, Elsevier, vol. 249(1), pages 281-297.
  161. Farhad Ghassemi Tari, 2016. "A Hybrid Dynamic Programming for Solving Fixed Cost Transportation with Discounted Mechanism," Journal of Optimization, Hindawi, vol. 2016, pages 1-9, February.
  162. Leyla Ozsen & Mark S. Daskin & Collette R. Coullard, 2009. "Facility Location Modeling and Inventory Management with Multisourcing," Transportation Science, INFORMS, vol. 43(4), pages 455-472, November.
  163. Kazaz, Burak & Altinkemer, Kemal, 2003. "Optimization of multi-feeder (depot) printed circuit board manufacturing with error guarantees," European Journal of Operational Research, Elsevier, vol. 150(2), pages 370-394, October.
  164. Arianna Alfieri & Shuyu Zhou & Rosario Scatamacchia & Steef L. van de Velde, 2021. "Dynamic programming algorithms and Lagrangian lower bounds for a discrete lot streaming problem in a two-machine flow shop," 4OR, Springer, vol. 19(2), pages 265-288, June.
  165. Kristel M. R. Hoen & Tarkan Tan & Jan C. Fransoo & Geert-Jan van Houtum, 2014. "Switching Transport Modes to Meet Voluntary Carbon Emission Targets," Transportation Science, INFORMS, vol. 48(4), pages 592-608, November.
  166. Lim, Seung-Kil & Kim, Yeong-Dae, 1998. "Capacity planning for phased implementation of flexible manufacturing systems under budget restrictions," European Journal of Operational Research, Elsevier, vol. 104(1), pages 175-186, January.
  167. Hasan Pirkul & David A. Schilling, 1998. "An Efficient Procedure for Designing Single Allocation Hub and Spoke Systems," Management Science, INFORMS, vol. 44(12-Part-2), pages 235-242, December.
  168. Kawatra, Rakesh, 2002. "A multiperiod degree constrained minimal spanning tree problem," European Journal of Operational Research, Elsevier, vol. 143(1), pages 53-63, November.
  169. Ishfaq, Rafay & Sox, Charles R., 2011. "Hub location-allocation in intermodal logistic networks," European Journal of Operational Research, Elsevier, vol. 210(2), pages 213-230, April.
  170. Alexandra M. Newman & Martin Weiss, 2013. "A Survey of Linear and Mixed-Integer Optimization Tutorials," INFORMS Transactions on Education, INFORMS, vol. 14(1), pages 26-38, September.
  171. Drexl, Andreas & Kimms, Alf, 1998. "Optimization guided lower and upper bounds for the resource investment problem," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 481, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
  172. Alberto Caprara & David Pisinger & Paolo Toth, 1999. "Exact Solution of the Quadratic Knapsack Problem," INFORMS Journal on Computing, INFORMS, vol. 11(2), pages 125-137, May.
  173. Yu-Wei An & Hong-Sen Yan, 2016. "Lagrangean relaxation approach to joint optimization for production planning and scheduling of synchronous assembly lines," International Journal of Production Research, Taylor & Francis Journals, vol. 54(22), pages 6718-6735, November.
  174. Abilio Lucena, 2005. "Non Delayed Relax-and-Cut Algorithms," Annals of Operations Research, Springer, vol. 140(1), pages 375-410, November.
  175. Yagiura, Mutsunori & Kishida, Masahiro & Ibaraki, Toshihide, 2006. "A 3-flip neighborhood local search for the set covering problem," European Journal of Operational Research, Elsevier, vol. 172(2), pages 472-499, July.
  176. Mohammad Nezhad, Ali & Manzour, Hasan & Salhi, Said, 2013. "Lagrangian relaxation heuristics for the uncapacitated single-source multi-product facility location problem," International Journal of Production Economics, Elsevier, vol. 145(2), pages 713-723.
  177. Veelenturf, L.P. & Potthoff, D. & Huisman, D. & Kroon, L.G., 2009. "Railway Crew Rescheduling with Retiming," Econometric Institute Research Papers EI 2009-24, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
  178. Xing, Tao & Zhou, Xuesong, 2011. "Finding the most reliable path with and without link travel time correlation: A Lagrangian substitution based approach," Transportation Research Part B: Methodological, Elsevier, vol. 45(10), pages 1660-1679.
  179. Ojeong Kwon & Donghan Kang & Kyungsik Lee & Sungsoo Park, 1999. "Lagrangian relaxation approach to the targeting problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 46(6), pages 640-653, September.
  180. X.H. Guan & Q.Z. Zhai & F. Lai, 2002. "New Lagrangian Relaxation Based Algorithm for Resource Scheduling with Homogeneous Subproblems," Journal of Optimization Theory and Applications, Springer, vol. 113(1), pages 65-82, April.
  181. Martinhon, Carlos & Lucena, Abilio & Maculan, Nelson, 2004. "Stronger K-tree relaxations for the vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 158(1), pages 56-71, October.
  182. S Bilgin & M Azizoǧlu, 2006. "Capacity and tool allocation problem in flexible manufacturing systems," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(6), pages 670-681, June.
  183. Anantaram Balakrishnan & François Vanderbeck, 1999. "A Tactical Planning Model for Mixed-Model Electronics Assembly Operations," Operations Research, INFORMS, vol. 47(3), pages 395-409, June.
  184. Kataoka, Seiji & Yamada, Takeo, 2014. "Upper and lower bounding procedures for the multiple knapsack assignment problem," European Journal of Operational Research, Elsevier, vol. 237(2), pages 440-447.
  185. Zhang, Yufeng & Khani, Alireza, 2019. "An algorithm for reliable shortest path problem with travel time correlations," Transportation Research Part B: Methodological, Elsevier, vol. 121(C), pages 92-113.
  186. Elhedhli, Samir, 2005. "Ranking lower bounds for the bin-packing problem," European Journal of Operational Research, Elsevier, vol. 160(1), pages 34-46, January.
  187. Yan, Shangyao & Tu, Yu-ping, 1997. "Multifleet routing and multistop flight scheduling for schedule perturbation," European Journal of Operational Research, Elsevier, vol. 103(1), pages 155-169, November.
  188. Weijun Xie & Yanfeng Ouyang & Sze Chun Wong, 2016. "Reliable Location-Routing Design Under Probabilistic Facility Disruptions," Transportation Science, INFORMS, vol. 50(3), pages 1128-1138, August.
  189. Sergey Shebalov & Diego Klabjan, 2006. "Robust Airline Crew Pairing: Move-up Crews," Transportation Science, INFORMS, vol. 40(3), pages 300-312, August.
  190. An, Kun & Ouyang, Yanfeng, 2016. "Robust grain supply chain design considering post-harvest loss and harvest timing equilibrium," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 88(C), pages 110-128.
  191. Noriyoshi Sukegawa & Yoshitsugu Yamamoto & Liyuan Zhang, 2013. "Lagrangian relaxation and pegging test for the clique partitioning problem," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 7(4), pages 363-391, December.
  192. Larsson, Torbjorn & Patriksson, Michael & Stromberg, Ann-Brith, 1996. "Conditional subgradient optimization -- Theory and applications," European Journal of Operational Research, Elsevier, vol. 88(2), pages 382-403, January.
  193. Arts, Joachim, 2017. "A multi-item approach to repairable stocking and expediting in a fluctuating demand environment," European Journal of Operational Research, Elsevier, vol. 256(1), pages 102-115.
  194. Markus Leitner & Ivana Ljubić & Martin Luipersbeck & Markus Sinnl, 2018. "Decomposition methods for the two-stage stochastic Steiner tree problem," Computational Optimization and Applications, Springer, vol. 69(3), pages 713-752, April.
  195. Peter Francis & Karen Smilowitz & Michal Tzur, 2006. "The Period Vehicle Routing Problem with Service Choice," Transportation Science, INFORMS, vol. 40(4), pages 439-454, November.
  196. Liufang Yao & Andrew G. Carrothers, 2020. "Prepare for the Worst - Using Facility Location to Alleviate Product Recall Risks," Business and Economic Research, Macrothink Institute, vol. 10(4), pages 159-185, December.
  197. George Li, 1997. "Single machine earliness and tardiness scheduling," European Journal of Operational Research, Elsevier, vol. 96(3), pages 546-558, February.
  198. Song, Jiongjiong & Regan, Amelia C & Nandiraju, Srinivas, 2008. "A Bid Analysis Model with Business Constraints for Transportation Procurement Auctions," University of California Transportation Center, Working Papers qt5766c7r1, University of California Transportation Center.
  199. Yanrong Li & Lai Wei & Wei Jiang, 2021. "A Two-stage Pricing Strategy Considering Learning Effects and Word-of-Mouth," Papers 2110.11581, arXiv.org.
  200. Snyder, Lawrence V. & Daskin, Mark S. & Teo, Chung-Piaw, 2007. "The stochastic location model with risk pooling," European Journal of Operational Research, Elsevier, vol. 179(3), pages 1221-1238, June.
  201. Sanjiv Sarin & Mark H. Karwan & Ronald L. Rardin, 1987. "A new surrogate dual multiplier search procedure," Naval Research Logistics (NRL), John Wiley & Sons, vol. 34(3), pages 431-450, June.
  202. Yan, Shangyao & Young, Hwei-Fwa, 1996. "A decision support framework for multi-fleet routing and multi-stop flight scheduling," Transportation Research Part A: Policy and Practice, Elsevier, vol. 30(5), pages 379-398, September.
  203. Amiri, Ali, 2005. "The selection and scheduling of telecommunication calls with time windows," European Journal of Operational Research, Elsevier, vol. 167(1), pages 243-256, November.
  204. Saif Benjaafar & Mohsen ElHafsi & Francis de Véricourt, 2004. "Demand Allocation in Multiple-Product, Multiple-Facility, Make-to-Stock Systems," Management Science, INFORMS, vol. 50(10), pages 1431-1448, October.
  205. Issmail Elhallaoui & Daniel Villeneuve & François Soumis & Guy Desaulniers, 2005. "Dynamic Aggregation of Set-Partitioning Constraints in Column Generation," Operations Research, INFORMS, vol. 53(4), pages 632-645, August.
  206. Şenay Ağca & Burak Eksioglu & Jay B. Ghosh, 2000. "Lagrangian solution of maximum dispersion problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 47(2), pages 97-114, March.
  207. Yoon, Yourim & Kim, Yong-Hyuk & Moon, Byung-Ro, 2012. "A theoretical and empirical investigation on the Lagrangian capacities of the 0-1 multidimensional knapsack problem," European Journal of Operational Research, Elsevier, vol. 218(2), pages 366-376.
  208. Jiang, Zhoutong & Ouyang, Yanfeng, 2021. "Reliable location of first responder stations for cooperative response to disasters," Transportation Research Part B: Methodological, Elsevier, vol. 149(C), pages 20-32.
  209. Shang, You-lin & Zhang, Lian-sheng, 2008. "Finding discrete global minima with a filled function for integer programming," European Journal of Operational Research, Elsevier, vol. 189(1), pages 31-40, August.
  210. Rafic Faddoul & Abdul-Hamid Soubra & Wassim Raphael & Alaa Chateauneuf, 2013. "Extension of dynamic programming models for management optimization from single structure to multi-structures level," Post-Print hal-01006860, HAL.
  211. Bülent Çatay & Ş. Selçuk Erengüç & Asoo J. Vakharia, 2005. "Capacity allocation with machine duplication in semiconductor manufacturing," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(7), pages 659-667, October.
  212. Renato Bruni, 2007. "Reformulation of the support set selection problem in the logical analysis of data," Annals of Operations Research, Springer, vol. 150(1), pages 79-92, March.
  213. Park, Moon-Won & Kim, Yeong-Dae, 2000. "A branch and bound algorithm for a production scheduling problem in an assembly system under due date constraints," European Journal of Operational Research, Elsevier, vol. 123(3), pages 504-518, June.
  214. Tian, Xiaopeng & Niu, Huimin, 2020. "Optimization of demand-oriented train timetables under overtaking operations: A surrogate-dual-variable column generation for eliminating indivisibility," Transportation Research Part B: Methodological, Elsevier, vol. 142(C), pages 143-173.
  215. Daniel Adelman & Adam J. Mersereau, 2008. "Relaxations of Weakly Coupled Stochastic Dynamic Programs," Operations Research, INFORMS, vol. 56(3), pages 712-727, June.
  216. Dilip Chhajed & Timothy J. Lowe, 1998. "Solving a selected class of location problems by exploiting problem structure: A decomposition approach," Naval Research Logistics (NRL), John Wiley & Sons, vol. 45(8), pages 791-815, December.
  217. Drótos, Márton & Kis, Tamás, 2011. "Resource leveling in a machine environment," European Journal of Operational Research, Elsevier, vol. 212(1), pages 12-21, July.
  218. Feng, Xuehao & He, Yucheng & Kim, Kap-Hwan, 2022. "Space planning considering congestion in container terminal yards," Transportation Research Part B: Methodological, Elsevier, vol. 158(C), pages 52-77.
  219. Altinkemer, Kemal & Bose, Indranil, 2003. "Asynchronous transfer mode networks with parallel links and multiple service classes," European Journal of Operational Research, Elsevier, vol. 146(1), pages 181-198, April.
  220. Simpson, N. C., 1999. "Multiple level production planning in rolling horizon assembly environments," European Journal of Operational Research, Elsevier, vol. 114(1), pages 15-28, April.
  221. Shangyao Yan & Chun-Ying Chen & Chuan-Che Wu, 2012. "Solution methods for the taxi pooling problem," Transportation, Springer, vol. 39(3), pages 723-748, May.
  222. Alberto Caprara & Matteo Fischetti & Paolo Toth, 1999. "A Heuristic Method for the Set Covering Problem," Operations Research, INFORMS, vol. 47(5), pages 730-743, October.
  223. Lei, Chao & Ouyang, Yanfeng, 2018. "Continuous approximation for demand balancing in solving large-scale one-commodity pickup and delivery problems," Transportation Research Part B: Methodological, Elsevier, vol. 109(C), pages 90-109.
  224. J R Current & J E Storbeck, 1988. "Capacitated Covering Models," Environment and Planning B, , vol. 15(2), pages 153-163, June.
  225. Beasley, J. E. & Cao, B., 1996. "A tree search algorithm for the crew scheduling problem," European Journal of Operational Research, Elsevier, vol. 94(3), pages 517-526, November.
  226. Wang, Tingsong & Xing, Zheng & Hu, Hongtao & Qu, Xiaobo, 2019. "Overbooking and delivery-delay-allowed strategies for container slot allocation," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 122(C), pages 433-447.
  227. Sarathy, Rathindra & Shetty, Bala & Sen, Arun, 1997. "A constrained nonlinear 0-1 program for data allocation," European Journal of Operational Research, Elsevier, vol. 102(3), pages 626-647, November.
  228. Lawrence V. Snyder & Mark S. Daskin, 2005. "Reliability Models for Facility Location: The Expected Failure Cost Case," Transportation Science, INFORMS, vol. 39(3), pages 400-416, August.
  229. Ziye Tang & Yang Jiao & R. Ravi, 2022. "Combinatorial Heuristics for Inventory Routing Problems," INFORMS Journal on Computing, INFORMS, vol. 34(1), pages 370-384, January.
  230. Carlos Carrion & Zenan Wang & Harikesh Nair & Xianghong Luo & Yulin Lei & Xiliang Lin & Wenlong Chen & Qiyu Hu & Changping Peng & Yongjun Bao & Weipeng Yan, 2021. "Blending Advertising with Organic Content in E-Commerce: A Virtual Bids Optimization Approach," Papers 2105.13556, arXiv.org.
  231. F. Tanhaie & M. Rabbani & N. Manavizadeh, 2020. "Applying available-to-promise (ATP) concept in mixed-model assembly line sequencing problems in a Make-To-Order (MTO) environment: problem extension, model formulation and Lagrangian relaxation algori," OPSEARCH, Springer;Operational Research Society of India, vol. 57(2), pages 320-346, June.
  232. Kawatra, R. & Bricker, D., 2000. "A multiperiod planning model for the capacitated minimal spanning tree problem," European Journal of Operational Research, Elsevier, vol. 121(2), pages 412-419, March.
  233. Marcel Turkensteen & Dmitry Malyshev & Boris Goldengorin & Panos M. Pardalos, 2017. "The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems," Journal of Global Optimization, Springer, vol. 68(3), pages 601-622, July.
  234. Harris, Irina & Mumford, Christine L. & Naim, Mohamed M., 2014. "A hybrid multi-objective approach to capacitated facility location with flexible store allocation for green logistics modeling," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 66(C), pages 1-22.
  235. Xinyu Wu & Ruixiang Cheng & Chuntian Cheng, 2022. "A Simplified Solution Method for End-of-Term Storage Energy Maximization Model of Cascaded Reservoirs," Energies, MDPI, vol. 15(12), pages 1-18, June.
  236. Raidl, Günther R., 2015. "Decomposition based hybrid metaheuristics," European Journal of Operational Research, Elsevier, vol. 244(1), pages 66-76.
  237. Antonino Chiarello & Manlio Gaudioso & Marcello Sammarra, 2018. "Truck synchronization at single door cross-docking terminals," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 40(2), pages 395-447, March.
  238. Aksen, Deniz & Altinkemer, Kemal, 2008. "A location-routing problem for the conversion to the "click-and-mortar" retailing: The static case," European Journal of Operational Research, Elsevier, vol. 186(2), pages 554-575, April.
  239. Jenny Carolina Saldana Cortés, 2011. "Programación semidefinida aplicada a problemas de cantidad económica de pedido," Documentos CEDE 8735, Universidad de los Andes, Facultad de Economía, CEDE.
  240. Aristide Mingozzi & Simone Giorgi & Roberto Baldacci, 1999. "An Exact Method for the Vehicle Routing Problem with Backhauls," Transportation Science, INFORMS, vol. 33(3), pages 315-329, August.
  241. Ronnqvist, Mikael, 1995. "A method for the cutting stock problem with different qualities," European Journal of Operational Research, Elsevier, vol. 83(1), pages 57-68, May.
  242. Amiri, Ali & Barkhi, Reza, 2011. "The combinatorial bandwidth packing problem," European Journal of Operational Research, Elsevier, vol. 208(1), pages 37-45, January.
  243. Zhang, Chuqian & Wan, Yat-wah & Liu, Jiyin & Linn, Richard J., 2002. "Dynamic crane deployment in container storage yards," Transportation Research Part B: Methodological, Elsevier, vol. 36(6), pages 537-555, July.
  244. Min Zhang & Rajan Batta & Rakesh Nagi, 2009. "Modeling of Workflow Congestion and Optimization of Flow Routing in a Manufacturing/Warehouse Facility," Management Science, INFORMS, vol. 55(2), pages 267-280, February.
  245. Tiwari, Richa & Jayaswal, Sachin & Sinha, Ankur, 2019. "Alternate Solution Approaches for Competitive Hub Location Problems," IIMA Working Papers WP 2019-12-01, Indian Institute of Management Ahmedabad, Research and Publication Department.
  246. I. Karakayali & E. Akçalı & S. Çetinkaya & H. Üster, 2013. "Capacitated replenishment and disposal planning for multiple products with resalable returns," Annals of Operations Research, Springer, vol. 203(1), pages 325-350, March.
  247. Lindong Liu & Yuqian Zhou & Zikang Li, 2022. "Lagrangian heuristic for simultaneous subsidization and penalization: implementations on rooted travelling salesman games," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 95(1), pages 81-99, February.
  248. Alexandre Belloni & Mitchell J. Lovett & William Boulding & Richard Staelin, 2012. "Optimal Admission and Scholarship Decisions: Choosing Customized Marketing Offers to Attract a Desirable Mix of Customers," Marketing Science, INFORMS, vol. 31(4), pages 621-636, July.
  249. Tragantalerngsak, Suda & Holt, John & Ronnqvist, Mikael, 1997. "Lagrangian heuristics for the two-echelon, single-source, capacitated facility location problem," European Journal of Operational Research, Elsevier, vol. 102(3), pages 611-625, November.
  250. Ouyang, Yanfeng & Wang, Zhaodong & Yang, Hai, 2015. "Facility location design under continuous traffic equilibrium," Transportation Research Part B: Methodological, Elsevier, vol. 81(P1), pages 18-33.
  251. Dauzère-Pérès, Stéphane & De Almeida, David & Guyon, Olivier & Benhizia, Faten, 2015. "A Lagrangian heuristic framework for a real-life integrated planning problem of railway transportation resources," Transportation Research Part B: Methodological, Elsevier, vol. 74(C), pages 138-150.
  252. Hanif D. Sherali & Youngho Lee & Donald D. Boyer, 1995. "Scheduling target illuminators in naval battle‐group anti‐air warfare," Naval Research Logistics (NRL), John Wiley & Sons, vol. 42(5), pages 737-755, August.
  253. X-Y Li & Y P Aneja & F Baki, 2010. "An ant colony optimization metaheuristic for single-path multicommodity network flow problems," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(9), pages 1340-1355, September.
  254. Li, Xiaohong & Yang, Dong & Hu, Mengqi, 2018. "A scenario-based stochastic programming approach for the product configuration problem under uncertainties and carbon emission regulations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 115(C), pages 126-146.
  255. O Berman & R Huang, 2004. "Minisum collection depots location problem with multiple facilities on a network," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(7), pages 769-779, July.
  256. Navneet Vidyarthi & Emre Çelebi & Samir Elhedhli & Elizabeth Jewkes, 2007. "Integrated Production-Inventory-Distribution System Design with Risk Pooling: Model Formulation and Heuristic Solution," Transportation Science, INFORMS, vol. 41(3), pages 392-408, August.
  257. Samir Elhedhli & Zichao Li & James H. Bookbinder, 2017. "Airfreight forwarding under system-wide and double discounts," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 6(2), pages 165-183, June.
  258. Hinojosa, Y. & Puerto, J. & Fernandez, F. R., 2000. "A multiperiod two-echelon multicommodity capacitated plant location problem," European Journal of Operational Research, Elsevier, vol. 123(2), pages 271-291, June.
  259. Anantaram Balakrishnan & Joseph Geunes, 2003. "Production Planning with Flexible Product Specifications: An Application to Specialty Steel Manufacturing," Operations Research, INFORMS, vol. 51(1), pages 94-112, February.
  260. A. Mingozzi & M. A. Boschetti & S. Ricciardelli & L. Bianco, 1999. "A Set Partitioning Approach to the Crew Scheduling Problem," Operations Research, INFORMS, vol. 47(6), pages 873-888, December.
  261. Li, Jizi & Ku, Yaoyao & Yu, Yue & Liu, Chunling & Zhou, Yuping, 2020. "Optimizing production of new energy vehicles with across-chain cooperation under China’s dual credit policy," Energy, Elsevier, vol. 194(C).
  262. Ali Diabat & Jean-Philippe Richard & Craig Codrington, 2013. "A Lagrangian relaxation approach to simultaneous strategic and tactical planning in supply chain design," Annals of Operations Research, Springer, vol. 203(1), pages 55-80, March.
  263. Kimms, Alf, 1996. "Improved lower bounds for the proportional lot sizing and scheduling problem," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 414, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
  264. Li, Kunpeng & Chen, Bin & Sivakumar, Appa Iyer & Wu, Yong, 2014. "An inventory–routing problem with the objective of travel time minimization," European Journal of Operational Research, Elsevier, vol. 236(3), pages 936-945.
  265. Jans, Raf & Degraeve, Zeger, 2007. "Meta-heuristics for dynamic lot sizing: A review and comparison of solution approaches," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1855-1875, March.
  266. Torbjörn Larsson & Michael Patriksson, 2006. "Global Optimality Conditions for Discrete and Nonconvex Optimization---With Applications to Lagrangian Heuristics and Column Generation," Operations Research, INFORMS, vol. 54(3), pages 436-453, June.
  267. Arabatzis, Garyfallos & Petridis, Konstantinos & Galatsidas, Spyros & Ioannou, Konstantinos, 2013. "A demand scenario based fuelwood supply chain: A conceptual model," Renewable and Sustainable Energy Reviews, Elsevier, vol. 25(C), pages 687-697.
  268. Qiang Meng & Tingsong Wang & Shuaian Wang, 2015. "Multi-period liner ship fleet planning with dependent uncertain container shipment demand," Maritime Policy & Management, Taylor & Francis Journals, vol. 42(1), pages 43-67, January.
  269. Monique Guignard, 2007. "En hommage à Joseph-Louis Lagrange et à Pierre Huard," Annals of Operations Research, Springer, vol. 149(1), pages 103-116, February.
  270. J MacGregor Smith & R S Pelosi, 1984. "Conversational Optimization and Facility-Layout Planning," Environment and Planning B, , vol. 11(1), pages 63-86, March.
  271. Li, Xinyan & Xie, Chi & Bao, Zhaoyao, 2022. "A multimodal multicommodity network equilibrium model with service capacity and bottleneck congestion for China-Europe containerized freight flows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 164(C).
  272. de Matta, Renato & Peters, Emmanuel, 2009. "Developing work schedules for an inter-city transit system with multiple driver types and fleet types," European Journal of Operational Research, Elsevier, vol. 192(3), pages 852-865, February.
  273. Oded Berman & Zvi Ganz & Janet M. Wagner, 1994. "A stochastic optimization model for planning capacity expansion in a service industry under uncertain demand," Naval Research Logistics (NRL), John Wiley & Sons, vol. 41(4), pages 545-564, June.
  274. Shangyao Yan & Chun-Ying Chen, 2011. "An optimization model and a solution algorithm for the many-to-many car pooling problem," Annals of Operations Research, Springer, vol. 191(1), pages 37-71, November.
  275. Kimms, Alf, 1999. "Lagrangean relaxation for scheduling projects under resource constraints to maximize the net present value," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 504, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
  276. Gzara, Fatma & Erkut, Erhan, 2009. "A Lagrangian relaxation approach to large-scale flow interception problems," European Journal of Operational Research, Elsevier, vol. 198(2), pages 405-411, October.
  277. Zhang, Chuntian & Gao, Yuan & Cacchiani, Valentina & Yang, Lixing & Gao, Ziyou, 2023. "Train rescheduling for large-scale disruptions in a large-scale railway network," Transportation Research Part B: Methodological, Elsevier, vol. 174(C).
  278. Li, Jiliu & Qin, Hu & Shen, Huaxiao & Tsui, Kwok Leung, 2019. "The unilateral transportation problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 132(C), pages 1-29.
  279. Chou, Chang-Chi & Chiang, Wen-Chu & Chen, Albert Y., 2022. "Emergency medical response in mass casualty incidents considering the traffic congestions in proximity on-site and hospital delays," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 158(C).
  280. Berghman, Lotte & Leus, Roel, 2015. "Practical solutions for a dock assignment problem with trailer transportation," European Journal of Operational Research, Elsevier, vol. 246(3), pages 787-799.
  281. Jayaraman, Vaidyanathan & Pirkul, Hasan, 2001. "Planning and coordination of production and distribution facilities for multiple commodities," European Journal of Operational Research, Elsevier, vol. 133(2), pages 394-408, January.
  282. Sadan Kulturel-Konak & Bryan A. Norman & David W. Coit & Alice E. Smith, 2004. "Exploiting Tabu Search Memory in Constrained Problems," INFORMS Journal on Computing, INFORMS, vol. 16(3), pages 241-254, August.
  283. Erhan Erkut & Tony Myroon & Kevin Strangway, 2000. "TransAlta Redesigns Its Service-Delivery Network," Interfaces, INFORMS, vol. 30(2), pages 54-69, April.
  284. Naderi, Siamak & Kilic, Kemal & Dasci, Abdullah, 2020. "A deterministic model for the transshipment problem of a fast fashion retailer under capacity constraints," International Journal of Production Economics, Elsevier, vol. 227(C).
  285. M T Ramos & J Sáez, 2005. "Solving capacitated facility location problems by Fenchel cutting planes," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(3), pages 297-306, March.
  286. Kouhei Harada, 2021. "A Feasibility-Ensured Lagrangian Heuristic for General Decomposable Problems," SN Operations Research Forum, Springer, vol. 2(4), pages 1-26, December.
  287. Gaudioso, Manlio & Monaco, Maria Flavia & Sammarra, Marcello, 2021. "A Lagrangian heuristics for the truck scheduling problem in multi-door, multi-product Cross-Docking with constant processing time," Omega, Elsevier, vol. 101(C).
  288. Saez, Jesus, 2000. "Solving linear programming relaxations associated with Lagrangean relaxations by Fenchel cutting planes," European Journal of Operational Research, Elsevier, vol. 121(3), pages 609-626, March.
  289. Marković, Nikola & Ryzhov, Ilya O. & Schonfeld, Paul, 2017. "Evasive flow capture: A multi-period stochastic facility location problem with independent demand," European Journal of Operational Research, Elsevier, vol. 257(2), pages 687-703.
  290. Melda Ormeci & J. G. Dai & John Vande Vate, 2008. "Impulse Control of Brownian Motion: The Constrained Average Cost Case," Operations Research, INFORMS, vol. 56(3), pages 618-629, June.
  291. Kassem Danach & Shahin Gelareh & Rahimeh Neamatian Monemi, 2019. "The capacitated single-allocation p-hub location routing problem: a Lagrangian relaxation and a hyper-heuristic approach," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 8(5), pages 597-631, December.
  292. Drexl, Andreas & Jørnsten, Kurt, 2007. "Pricing the multiple-choice nested knapsack problem," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 626, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
  293. Taaffe, Kevin & Geunes, Joseph & Edwin Romeijn, H., 2010. "Supply capacity acquisition and allocation with uncertain customer demands," European Journal of Operational Research, Elsevier, vol. 204(2), pages 263-273, July.
  294. Robert Fourer & Leo Lopes, 2006. "A management system for decompositions in stochastic programming," Annals of Operations Research, Springer, vol. 142(1), pages 99-118, February.
  295. H-J Kim & D-H Lee & P Xirouchakis & O K Kwon, 2009. "A branch and bound algorithm for disassembly scheduling with assembly product structure," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(3), pages 419-430, March.
  296. Trung Luong, Huynh & Fujiwara, Okitsugu, 2002. "Fund allocation model for pipe repair maintenance in water distribution networks," European Journal of Operational Research, Elsevier, vol. 136(2), pages 403-421, January.
  297. Yankai Cao & Victor M. Zavala, 2019. "A scalable global optimization algorithm for stochastic nonlinear programs," Journal of Global Optimization, Springer, vol. 75(2), pages 393-416, October.
  298. Vairaktarakis, George L. & Cai, Xiaoqiang & Lee, Chung-Yee, 2002. "Workforce planning in synchronous production systems," European Journal of Operational Research, Elsevier, vol. 136(3), pages 551-572, February.
  299. Degraeve, Z. & Jans, R.F., 2003. "A New Dantzig-Wolfe Reformulation And Branch-And-Price Algorithm For The Capacitated Lot Sizing Problem With Set Up Times," ERIM Report Series Research in Management ERS-2003-010-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
  300. Xiaopeng Li & Yanfeng Ouyang, 2012. "Reliable Traffic Sensor Deployment Under Probabilistic Disruptions and Generalized Surveillance Effectiveness Measures," Operations Research, INFORMS, vol. 60(5), pages 1183-1198, October.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.