IDEAS home Printed from https://ideas.repec.org/f/c/pbe674.html
   My authors  Follow this author

John Beasley

Citations

Many of the citations below have been collected in an experimental project, CitEc, where a more detailed citation analysis can be found. These are citations from works listed in RePEc that could be analyzed mechanically. So far, only a minority of all works could be analyzed. See under "Corrections" how you can help improve the citation analysis.

Working papers

  1. N. Meade & J. E. Beasley & C. J. Adcock, 2019. "Quantitative portfolio selection: using density forecasting to find consistent portfolios," Papers 1908.08442, arXiv.org, revised Jun 2020.

    Cited by:

    1. Mynbayeva, Elmira & Lamb, John D. & Zhao, Yuan, 2022. "Why estimation alone causes Markowitz portfolio selection to fail and what we might do about it," European Journal of Operational Research, Elsevier, vol. 301(2), pages 694-707.
    2. Li, Xiaoyue & Uysal, A. Sinem & Mulvey, John M., 2022. "Multi-period portfolio optimization using model predictive control with mean-variance and risk parity frameworks," European Journal of Operational Research, Elsevier, vol. 299(3), pages 1158-1176.

Articles

  1. Meade, N. & Beasley, J.E. & Adcock, C.J., 2021. "Quantitative portfolio selection: Using density forecasting to find consistent portfolios," European Journal of Operational Research, Elsevier, vol. 288(3), pages 1053-1067.
    See citations under working paper version above.
  2. Arbex Valle, Cristiano & Beasley, John E, 2020. "Order batching using an approximation for the distance travelled by pickers," European Journal of Operational Research, Elsevier, vol. 284(2), pages 460-484.

    Cited by:

    1. Pardo, Eduardo G. & Gil-Borrás, Sergio & Alonso-Ayuso, Antonio & Duarte, Abraham, 2024. "Order batching problems: Taxonomy and literature review," European Journal of Operational Research, Elsevier, vol. 313(1), pages 1-24.
    2. Jiang, Min & Huang, George Q., 2022. "Intralogistics synchronization in robotic forward-reserve warehouses for e-commerce last-mile delivery," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 158(C).
    3. Mar Vazquez-Noguerol & Jose A. Comesaña-Benavides & Sara Riveiro-Sanroman & J. Carlos Prado-Prado, 2022. "A mixed integer linear programming model to support e-fulfillment strategies in warehouse-based supermarket chains," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 30(4), pages 1369-1402, December.

  3. Valle, Cristiano Arbex & Beasley, John E. & da Cunha, Alexandre Salles, 2017. "Optimally solving the joint order batching and picker routing problem," European Journal of Operational Research, Elsevier, vol. 262(3), pages 817-834.

    Cited by:

    1. Pardo, Eduardo G. & Gil-Borrás, Sergio & Alonso-Ayuso, Antonio & Duarte, Abraham, 2024. "Order batching problems: Taxonomy and literature review," European Journal of Operational Research, Elsevier, vol. 313(1), pages 1-24.
    2. Minfang Huang & Qiong Guo & Jing Liu & Xiaoxu Huang, 2018. "Mixed Model Assembly Line Scheduling Approach to Order Picking Problem in Online Supermarkets," Sustainability, MDPI, vol. 10(11), pages 1-16, October.
    3. Cambazard, Hadrien & Catusse, Nicolas, 2018. "Fixed-parameter algorithms for rectilinear Steiner tree and rectilinear traveling salesman problem in the plane," European Journal of Operational Research, Elsevier, vol. 270(2), pages 419-429.
    4. Arbex Valle, Cristiano & Beasley, John E, 2020. "Order batching using an approximation for the distance travelled by pickers," European Journal of Operational Research, Elsevier, vol. 284(2), pages 460-484.
    5. Boysen, Nils & de Koster, René & Weidinger, Felix, 2019. "Warehousing in the e-commerce era: A survey," European Journal of Operational Research, Elsevier, vol. 277(2), pages 396-411.
    6. Ardjmand, Ehsan & Shakeri, Heman & Singh, Manjeet & Sanei Bajgiran, Omid, 2018. "Minimizing order picking makespan with multiple pickers in a wave picking warehouse," International Journal of Production Economics, Elsevier, vol. 206(C), pages 169-183.
    7. Wagner, Stefan & Mönch, Lars, 2023. "A variable neighborhood search approach to solve the order batching problem with heterogeneous pick devices," European Journal of Operational Research, Elsevier, vol. 304(2), pages 461-475.
    8. Briant, Olivier & Cambazard, Hadrien & Cattaruzza, Diego & Catusse, Nicolas & Ladier, Anne-Laure & Ogier, Maxime, 2020. "An efficient and general approach for the joint order batching and picker routing problem," European Journal of Operational Research, Elsevier, vol. 285(2), pages 497-512.
    9. van Gils, Teun & Ramaekers, Katrien & Caris, An & de Koster, René B.M., 2018. "Designing efficient order picking systems by combining planning problems: State-of-the-art classification and review," European Journal of Operational Research, Elsevier, vol. 267(1), pages 1-15.
    10. Çelik, Melih & Archetti, Claudia & Süral, Haldun, 2022. "Inventory routing in a warehouse: The storage replenishment routing problem," European Journal of Operational Research, Elsevier, vol. 301(3), pages 1117-1132.
    11. Fangyu Chen & Gangyan Xu & Yongchang Wei, 2019. "An Integrated Metaheuristic Routing Method for Multiple-Block Warehouses with Ultranarrow Aisles and Access Restriction," Complexity, Hindawi, vol. 2019, pages 1-14, June.
    12. Žulj, Ivan & Salewski, Hagen & Goeke, Dominik & Schneider, Michael, 2022. "Order batching and batch sequencing in an AMR-assisted picker-to-parts system," European Journal of Operational Research, Elsevier, vol. 298(1), pages 182-201.
    13. Mustapha Haouassi & Yannick Kergosien & Jorge E. Mendoza & Louis-Martin Rousseau, 2022. "The integrated orderline batching, batch scheduling, and picker routing problem with multiple pickers: the benefits of splitting customer orders," Flexible Services and Manufacturing Journal, Springer, vol. 34(3), pages 614-645, September.
    14. Moaad Abdulaziz Alrasheed & Ateekh Ur Rehman & Ibrahim M. Alharkan, 2024. "Developing an Efficient Model for Online Grocery Order Fulfillment," Sustainability, MDPI, vol. 16(10), pages 1-24, May.
    15. Antonio Maria Coruzzolo & Francesco Lolli & Elia Balugani & Elisa Magnani & Miguel Afonso Sellitto, 2023. "Order Picking Problem: A Model for the Joint Optimisation of Order Batching, Batch Assignment Sequencing, and Picking Routing," Logistics, MDPI, vol. 7(3), pages 1-18, September.
    16. Dominik Goeke & Michael Schneider, 2021. "Modeling Single-Picker Routing Problems in Classical and Modern Warehouses," INFORMS Journal on Computing, INFORMS, vol. 33(2), pages 436-451, May.
    17. Mar Vazquez-Noguerol & Jose Comesaña-Benavides & Raul Poler & J. Carlos Prado-Prado, 2022. "An optimisation approach for the e-grocery order picking and delivery problem," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 30(3), pages 961-990, September.
    18. AERTS, Babiche & CORNELISSENS, Trijntje & SÖRENSEN, Kenneth, 2020. "Solving the joint order batching and picker routing problem, as a clustered vehicle routing problem," Working Papers 2020003, University of Antwerp, Faculty of Business and Economics.
    19. van Gils, Teun & Caris, An & Ramaekers, Katrien & Braekers, Kris, 2019. "Formulating and solving the integrated batching, routing, and picker scheduling problem in a real-life spare parts warehouse," European Journal of Operational Research, Elsevier, vol. 277(3), pages 814-830.
    20. Xie, Lin & Li, Hanyi & Luttmann, Laurin, 2023. "Formulating and solving integrated order batching and routing in multi-depot AGV-assisted mixed-shelves warehouses," European Journal of Operational Research, Elsevier, vol. 307(2), pages 713-730.

  4. López, C.O. & Beasley, J.E., 2016. "A formulation space search heuristic for packing unequal circles in a fixed size circular container," European Journal of Operational Research, Elsevier, vol. 251(1), pages 64-73.

    Cited by:

    1. Alessandro Hill & Eduardo Lalla-Ruiz & Stefan Voß & Marcos Goycoolea, 2019. "A multi-mode resource-constrained project scheduling reformulation for the waterway ship scheduling problem," Journal of Scheduling, Springer, vol. 22(2), pages 173-182, April.
    2. Wang, Yingcong & Wang, Yanfeng & Sun, Junwei & Huang, Chun & Zhang, Xuncai, 2019. "A stimulus–response-based allocation method for the circle packing problem with equilibrium constraints," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 522(C), pages 232-247.
    3. Lai, Xiangjing & Hao, Jin-Kao & Yue, Dong & Lü, Zhipeng & Fu, Zhang-Hua, 2022. "Iterated dynamic thresholding search for packing equal circles into a circular container," European Journal of Operational Research, Elsevier, vol. 299(1), pages 137-153.
    4. Hu, Zhi-Hua & Zheng, Yu-Xin & Wang, You-Gan, 2022. "Packing computing servers into the vessel of an underwater data center considering cooling efficiency," Applied Energy, Elsevier, vol. 314(C).
    5. Bouzid, Mouaouia Cherif & Salhi, Said, 2020. "Packing rectangles into a fixed size circular container: Constructive and metaheuristic search approaches," European Journal of Operational Research, Elsevier, vol. 285(3), pages 865-883.

  5. Valle, C.A. & Meade, N. & Beasley, J.E., 2014. "Absolute return portfolios," Omega, Elsevier, vol. 45(C), pages 20-41.

    Cited by:

    1. Leal, Marina & Ponce, Diego & Puerto, Justo, 2020. "Portfolio problems with two levels decision-makers: Optimal portfolio selection with pricing decisions on transaction costs," European Journal of Operational Research, Elsevier, vol. 284(2), pages 712-727.
    2. Nalan Gülpınar & Dessislava Pachamanova & Ethem Çanakoğlu, 2016. "A robust asset–liability management framework for investment products with guarantees," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 38(4), pages 1007-1041, October.
    3. Luo, Cuicui & Seco, Luis & Wu, Lin-Liang Bill, 2015. "Portfolio optimization in hedge funds by OGARCH and Markov Switching Model," Omega, Elsevier, vol. 57(PA), pages 34-39.
    4. Patrizia Beraldi & Maria Elena Bruni, 2022. "Enhanced indexation via chance constraints," Operational Research, Springer, vol. 22(2), pages 1553-1573, April.
    5. Huang, Jinbo & Li, Yong & Yao, Haixiang, 2018. "Index tracking model, downside risk and non-parametric kernel estimation," Journal of Economic Dynamics and Control, Elsevier, vol. 92(C), pages 103-128.
    6. Strub, O. & Baumann, P., 2018. "Optimal construction and rebalancing of index-tracking portfolios," European Journal of Operational Research, Elsevier, vol. 264(1), pages 370-387.
    7. González-Díaz, Julio & González-Rodríguez, Brais & Leal, Marina & Puerto, Justo, 2021. "Global optimization for bilevel portfolio design: Economic insights from the Dow Jones index," Omega, Elsevier, vol. 102(C).
    8. Huang, Jinbo & Li, Yong & Yao, Haixiang, 2022. "Partial moments and indexation investment strategies," Journal of Empirical Finance, Elsevier, vol. 67(C), pages 39-59.
    9. Gianfranco Guastaroba & Renata Mansini & Wlodzimierz Ogryczak & M. Grazia Speranza, 2020. "Enhanced index tracking with CVaR-based ratio measures," Annals of Operations Research, Springer, vol. 292(2), pages 883-931, September.
    10. Lwin, Khin T. & Qu, Rong & MacCarthy, Bart L., 2017. "Mean-VaR portfolio optimization: A nonparametric approach," European Journal of Operational Research, Elsevier, vol. 260(2), pages 751-766.
    11. Gaustaroba, Gianfranco & Mansini, Renata & Ogryczak, Wlodzimierz & Speranza, M. Grazia, 2014. "Linear Programming Models based on Omega Ratio for the Enhanced Index Tracking Problem," MPRA Paper 67097, University Library of Munich, Germany.
    12. Filippi, C. & Guastaroba, G. & Speranza, M.G., 2016. "A heuristic framework for the bi-objective enhanced index tracking problem," Omega, Elsevier, vol. 65(C), pages 122-137.

  6. H Mezali & J E Beasley, 2013. "Quantile regression for index tracking and enhanced indexation," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 64(11), pages 1676-1692, November.

    Cited by:

    1. Chen, Qi-an & Hu, Qingyu & Yang, Hu & Qi, Kai, 2022. "A kind of new time-weighted nonnegative lasso index-tracking model and its application," The North American Journal of Economics and Finance, Elsevier, vol. 59(C).
    2. Dimitris Andriosopoulos & Michael Doumpos & Panos M. Pardalos & Constantin Zopounidis, 2019. "Computational approaches and data analytics in financial services: A literature review," Post-Print hal-02880149, HAL.
    3. Ruchika Sehgal & Aparna Mehra, 2023. "Quantile Regression Based Enhanced Indexing with Portfolio Rebalancing," Journal of Quantitative Economics, Springer;The Indian Econometric Society (TIES), vol. 21(3), pages 721-742, September.
    4. Xianhua Peng & Chenyin Gong & Xue Dong He, 2023. "Reinforcement Learning for Financial Index Tracking," Papers 2308.02820, arXiv.org, revised Nov 2024.
    5. Fengmin Xu & Meihua Wang & Yu-Hong Dai & Dachuan Xu, 2018. "A sparse enhanced indexation model with chance and cardinality constraints," Journal of Global Optimization, Springer, vol. 70(1), pages 5-25, January.
    6. Zhiping Chen & Shen Peng & Abdel Lisser, 2020. "A sparse chance constrained portfolio selection model with multiple constraints," Journal of Global Optimization, Springer, vol. 77(4), pages 825-852, August.
    7. Valle, C.A. & Meade, N. & Beasley, J.E., 2014. "Absolute return portfolios," Omega, Elsevier, vol. 45(C), pages 20-41.
    8. Li, Xuepeng & Xu, Fengmin & Jing, Kui, 2022. "Robust enhanced indexation with ESG: An empirical study in the Chinese Stock Market," Economic Modelling, Elsevier, vol. 107(C).
    9. Zhiping Chen & Xinkai Zhuang & Jia Liu, 2019. "A Sustainability-Oriented Enhanced Indexation Model with Regime Switching and Cardinality Constraint," Sustainability, MDPI, vol. 11(15), pages 1-14, July.
    10. Gianfranco Guastaroba & Renata Mansini & Wlodzimierz Ogryczak & M. Grazia Speranza, 2020. "Enhanced index tracking with CVaR-based ratio measures," Annals of Operations Research, Springer, vol. 292(2), pages 883-931, September.
    11. Sant’Anna, Leonardo Riegel & Caldeira, João Frois & Filomena, Tiago Pascoal, 2020. "Lasso-based index tracking and statistical arbitrage long-short strategies," The North American Journal of Economics and Finance, Elsevier, vol. 51(C).
    12. Tingting Yang & Xiaoxia Huang, 2022. "A New Portfolio Optimization Model Under Tracking-Error Constraint with Linear Uncertainty Distributions," Journal of Optimization Theory and Applications, Springer, vol. 195(2), pages 723-747, November.
    13. Julio Cezar Soares Silva & Adiel Teixeira de Almeida Filho, 2023. "A systematic literature review on solution approaches for the index tracking problem in the last decade," Papers 2306.01660, arXiv.org, revised Jun 2023.
    14. Gaustaroba, Gianfranco & Mansini, Renata & Ogryczak, Wlodzimierz & Speranza, M. Grazia, 2014. "Linear Programming Models based on Omega Ratio for the Enhanced Index Tracking Problem," MPRA Paper 67097, University Library of Munich, Germany.
    15. Filippi, C. & Guastaroba, G. & Speranza, M.G., 2016. "A heuristic framework for the bi-objective enhanced index tracking problem," Omega, Elsevier, vol. 65(C), pages 122-137.
    16. Sant’Anna, Leonardo Riegel & Righi, Marcelo Brutti & Müller, Fernanda Maria & Guedes, Pablo Cristini, 2022. "Risk measure index tracking model," International Review of Economics & Finance, Elsevier, vol. 80(C), pages 361-383.

  7. Woodside-Oriakhi, M. & Lucas, C. & Beasley, J.E., 2013. "Portfolio rebalancing with an investment horizon and transaction costs," Omega, Elsevier, vol. 41(2), pages 406-420.

    Cited by:

    1. Kourtis, Apostolos, 2014. "On the distribution and estimation of trading costs," Journal of Empirical Finance, Elsevier, vol. 28(C), pages 104-117.
    2. Fu-Sheng Tsai & Chin-Chiung Kuo & Julia L. Lin, 2020. "Knowledge Heterogenization of the Franchising Literature Applying Transaction Cost Economics," Economies, MDPI, vol. 8(4), pages 1-27, November.
    3. Yu, Jing-Rung & Paul Chiou, Wan-Jiun & Lee, Wen-Yi & Lin, Shun-Ji, 2020. "Portfolio models with return forecasting and transaction costs," International Review of Economics & Finance, Elsevier, vol. 66(C), pages 118-130.
    4. Ruchika Sehgal & Aparna Mehra, 2023. "Quantile Regression Based Enhanced Indexing with Portfolio Rebalancing," Journal of Quantitative Economics, Springer;The Indian Econometric Society (TIES), vol. 21(3), pages 721-742, September.
    5. Leal, Marina & Ponce, Diego & Puerto, Justo, 2020. "Portfolio problems with two levels decision-makers: Optimal portfolio selection with pricing decisions on transaction costs," European Journal of Operational Research, Elsevier, vol. 284(2), pages 712-727.
    6. K. Liagkouras & K. Metaxiotis, 2018. "A new efficiently encoded multiobjective algorithm for the solution of the cardinality constrained portfolio optimization problem," Annals of Operations Research, Springer, vol. 267(1), pages 281-319, August.
    7. Emmanouil Platanakis & Athanasios Sakkas & Charles Sutcliffe, 2017. "Harmful Diversification: Evidence from Alternative Investments," ICMA Centre Discussion Papers in Finance icma-dp2017-09, Henley Business School, University of Reading.
    8. Cristiano Arbex Valle, 2024. "Portfolio optimisation: bridging the gap between theory and practice," Papers 2407.00887, arXiv.org, revised Sep 2024.
    9. Mansini, Renata & Ogryczak, Wlodzimierz & Speranza, M. Grazia, 2014. "Twenty years of linear programming based portfolio optimization," European Journal of Operational Research, Elsevier, vol. 234(2), pages 518-535.
    10. Ravi Kashyap, 2024. "To Trade Or Not To Trade: Cascading Waterfall Round Robin Rebalancing Mechanism for Cryptocurrencies," Papers 2407.12150, arXiv.org.
    11. González-Díaz, Julio & González-Rodríguez, Brais & Leal, Marina & Puerto, Justo, 2021. "Global optimization for bilevel portfolio design: Economic insights from the Dow Jones index," Omega, Elsevier, vol. 102(C).
    12. Wei Chen & Yun Wang & Mukesh Kumar Mehlawat, 2018. "A hybrid FA–SA algorithm for fuzzy portfolio selection with transaction costs," Annals of Operations Research, Springer, vol. 269(1), pages 129-147, October.
    13. Gruszka, Jarosław & Szwabiński, Janusz, 2020. "Best portfolio management strategies for synthetic and real assets," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 539(C).
    14. Mostafa Zandieh & Seyed Omid Mohaddesi, 2018. "Portfolio Rebalancing under Uncertainty Using Meta-heuristic Algorithm," Papers 1812.07635, arXiv.org.
    15. Sefair, Jorge A. & Méndez, Carlos Y. & Babat, Onur & Medaglia, Andrés L. & Zuluaga, Luis F., 2017. "Linear solution schemes for Mean-SemiVariance Project portfolio selection problems: An application in the oil and gas industry," Omega, Elsevier, vol. 68(C), pages 39-48.
    16. Jing-Rung Yu & Wan-Jiun Paul Chiou & Jian-Hong Yang, 2017. "Diversification benefits of risk portfolio models: a case of Taiwan’s stock market," Review of Quantitative Finance and Accounting, Springer, vol. 48(2), pages 467-502, February.
    17. Valle, C.A. & Meade, N. & Beasley, J.E., 2014. "Absolute return portfolios," Omega, Elsevier, vol. 45(C), pages 20-41.
    18. Yue, Wei & Wang, Yuping, 2017. "A new fuzzy multi-objective higher order moment portfolio selection model for diversified portfolios," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 465(C), pages 124-140.
    19. Willie Dion Reddic, 2021. "Under pressure: investment behaviour of insurers under different financial and regulatory conditions," The Geneva Papers on Risk and Insurance - Issues and Practice, Palgrave Macmillan;The Geneva Association, vol. 46(1), pages 1-20, January.
    20. Yu, Jing-Rung & Chiou, Wan-Jiun Paul & Mu, Da-Ren, 2015. "A linearized value-at-risk model with transaction costs and short selling," European Journal of Operational Research, Elsevier, vol. 247(3), pages 872-878.
    21. Liu, Wenbin & Zhou, Zhongbao & Liu, Debin & Xiao, Helu, 2015. "Estimation of portfolio efficiency via DEA," Omega, Elsevier, vol. 52(C), pages 107-118.
    22. Lwin, Khin T. & Qu, Rong & MacCarthy, Bart L., 2017. "Mean-VaR portfolio optimization: A nonparametric approach," European Journal of Operational Research, Elsevier, vol. 260(2), pages 751-766.
    23. Yu, Jing-Rung & Paul Chiou, Wan-Jiun & Hsin, Yi-Ting & Sheu, Her-Jiun, 2022. "Omega portfolio models with floating return threshold," International Review of Economics & Finance, Elsevier, vol. 82(C), pages 743-758.
    24. Tahereh Khodamoradi & Maziar Salahi, 2023. "Extended mean-conditional value-at-risk portfolio optimization with PADM and conditional scenario reduction technique," Computational Statistics, Springer, vol. 38(2), pages 1023-1040, June.
    25. Filippi, C. & Guastaroba, G. & Speranza, M.G., 2016. "A heuristic framework for the bi-objective enhanced index tracking problem," Omega, Elsevier, vol. 65(C), pages 122-137.
    26. Patrizia Beraldi & Antonio Violi & Massimiliano Ferrara & Claudio Ciancio & Bruno Antonio Pansera, 2021. "Dealing with complex transaction costs in portfolio management," Annals of Operations Research, Springer, vol. 299(1), pages 7-22, April.

  8. Anken, F. & Beasley, J.E., 2012. "Corporate structure optimisation for multinational companies," Omega, Elsevier, vol. 40(2), pages 230-243, April.

    Cited by:

    1. Karaoglan, Ismail & Altiparmak, Fulya & Kara, Imdat & Dengiz, Berna, 2012. "The location-routing problem with simultaneous pickup and delivery: Formulations and a heuristic approach," Omega, Elsevier, vol. 40(4), pages 465-477.
    2. Valle, C.A. & Meade, N. & Beasley, J.E., 2014. "Absolute return portfolios," Omega, Elsevier, vol. 45(C), pages 20-41.
    3. Ma, Hong & Cheang, Brenda & Lim, Andrew & Zhang, Lei & Zhu, Yi, 2012. "An investigation into the vehicle routing problem with time windows and link capacity constraints," Omega, Elsevier, vol. 40(3), pages 336-347.
    4. Woodside-Oriakhi, M. & Lucas, C. & Beasley, J.E., 2013. "Portfolio rebalancing with an investment horizon and transaction costs," Omega, Elsevier, vol. 41(2), pages 406-420.

  9. N. Meade & J. E. Beasley, 2011. "Detection of momentum effects using an index out-performance strategy," Quantitative Finance, Taylor & Francis Journals, vol. 11(2), pages 313-326.

    Cited by:

    1. Renato Bruni & Francesco Cesarone & Andrea Scozzari & Fabio Tardella, 2013. "No arbitrage and a linear portfolio selection model," Economics Bulletin, AccessEcon, vol. 33(2), pages 1247-1258.
    2. Ruchika Sehgal & Aparna Mehra, 2023. "Quantile Regression Based Enhanced Indexing with Portfolio Rebalancing," Journal of Quantitative Economics, Springer;The Indian Econometric Society (TIES), vol. 21(3), pages 721-742, September.
    3. Li, Helong & Huang, Qin & Wu, Baiyi, 2021. "Improving the naive diversification: An enhanced indexation approach," Finance Research Letters, Elsevier, vol. 39(C).
    4. Ruchika Sehgal & Aparna Mehra, 2019. "Enhanced indexing using weighted conditional value at risk," Annals of Operations Research, Springer, vol. 280(1), pages 211-240, September.
    5. Guastaroba, G. & Speranza, M.G., 2012. "Kernel Search: An application to the index tracking problem," European Journal of Operational Research, Elsevier, vol. 217(1), pages 54-68.
    6. Valle, C.A. & Meade, N. & Beasley, J.E., 2014. "Absolute return portfolios," Omega, Elsevier, vol. 45(C), pages 20-41.
    7. H Mezali & J E Beasley, 2013. "Quantile regression for index tracking and enhanced indexation," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 64(11), pages 1676-1692, November.
    8. Gianfranco Guastaroba & Renata Mansini & Wlodzimierz Ogryczak & M. Grazia Speranza, 2020. "Enhanced index tracking with CVaR-based ratio measures," Annals of Operations Research, Springer, vol. 292(2), pages 883-931, September.
    9. Renato Bruni & Francesco Cesarone & Andrea Scozzari & Fabio Tardella, 2012. "A New Lp Model For Enhanced Indexation," Departmental Working Papers of Economics - University 'Roma Tre' 0168, Department of Economics - University Roma Tre.
    10. Gaustaroba, Gianfranco & Mansini, Renata & Ogryczak, Wlodzimierz & Speranza, M. Grazia, 2014. "Linear Programming Models based on Omega Ratio for the Enhanced Index Tracking Problem," MPRA Paper 67097, University Library of Munich, Germany.

  10. G Mitchell & J E Beasley, 2011. "Optimisation of sludge treatment and transport," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(6), pages 939-948, June.

    Cited by:

    1. De Meyer, Annelies & Cattrysse, Dirk & Ostermeyer, Pieter & Van Orshoven, Jos, 2016. "Implementation of OPTIMASS to optimise municipal wastewater sludge processing chains: Proof of concept," Resources, Conservation & Recycling, Elsevier, vol. 114(C), pages 168-178.

  11. López, C.O. & Beasley, J.E., 2011. "A heuristic for the circle packing problem with a variety of containers," European Journal of Operational Research, Elsevier, vol. 214(3), pages 512-525, November.

    Cited by:

    1. Liu, Jingfa & Jiang, Yucong & Li, Gang & Xue, Yu & Liu, Zhaoxia & Zhang, Zhen, 2015. "Heuristic-based energy landscape paving for the circular packing problem with performance constraints of equilibrium," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 431(C), pages 166-174.
    2. Brimberg, Jack & Kalczynski, Pawel & Drezner, Zvi, 2024. "Different formulations of the gray pattern problem and their optimal solutions," European Journal of Operational Research, Elsevier, vol. 316(1), pages 61-71.
    3. López, C.O. & Beasley, J.E., 2016. "A formulation space search heuristic for packing unequal circles in a fixed size circular container," European Journal of Operational Research, Elsevier, vol. 251(1), pages 64-73.
    4. Papp, Dávid & Regős, Krisztina & Domokos, Gábor & Bozóki, Sándor, 2023. "The smallest mono-unstable convex polyhedron with point masses has 8 faces and 11 vertices," European Journal of Operational Research, Elsevier, vol. 310(2), pages 511-517.
    5. Zhu, Dingju, 2016. "Quasi-human seniority-order algorithm for unequal circles packing," Chaos, Solitons & Fractals, Elsevier, vol. 89(C), pages 506-517.
    6. Wang, Yingcong & Wang, Yanfeng & Sun, Junwei & Huang, Chun & Zhang, Xuncai, 2019. "A stimulus–response-based allocation method for the circle packing problem with equilibrium constraints," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 522(C), pages 232-247.
    7. Frank J. Kampas & János D. Pintér & Ignacio Castillo, 2020. "Packing ovals in optimized regular polygons," Journal of Global Optimization, Springer, vol. 77(1), pages 175-196, May.
    8. Lai, Xiangjing & Hao, Jin-Kao & Yue, Dong & Lü, Zhipeng & Fu, Zhang-Hua, 2022. "Iterated dynamic thresholding search for packing equal circles into a circular container," European Journal of Operational Research, Elsevier, vol. 299(1), pages 137-153.
    9. Zhengguan Dai & Kathleen Xu & Melkior Ornik, 2021. "Repulsion-based p-dispersion with distance constraints in non-convex polygons," Annals of Operations Research, Springer, vol. 307(1), pages 75-91, December.
    10. Amirgaliyeva, Zhazira & Mladenović, Nenad & Todosijević, Raca & Urošević, Dragan, 2017. "Solving the maximum min-sum dispersion by alternating formulations of two different problems," European Journal of Operational Research, Elsevier, vol. 260(2), pages 444-459.
    11. Xiangjing Lai & Jin-Kao Hao & Renbin Xiao & Fred Glover, 2023. "Perturbation-Based Thresholding Search for Packing Equal Circles and Spheres," INFORMS Journal on Computing, INFORMS, vol. 35(4), pages 725-746, July.
    12. Bouzid, Mouaouia Cherif & Salhi, Said, 2020. "Packing rectangles into a fixed size circular container: Constructive and metaheuristic search approaches," European Journal of Operational Research, Elsevier, vol. 285(3), pages 865-883.
    13. Akang Wang & Chrysanthos E. Gounaris, 2021. "On tackling reverse convex constraints for non-overlapping of unequal circles," Journal of Global Optimization, Springer, vol. 80(2), pages 357-385, June.

  12. Woodside-Oriakhi, M. & Lucas, C. & Beasley, J.E., 2011. "Heuristic algorithms for the cardinality constrained efficient frontier," European Journal of Operational Research, Elsevier, vol. 213(3), pages 538-550, September.

    Cited by:

    1. Babaei, Sadra & Sepehri, Mohammad Mehdi & Babaei, Edris, 2015. "Multi-objective portfolio optimization considering the dependence structure of asset returns," European Journal of Operational Research, Elsevier, vol. 244(2), pages 525-539.
    2. Guo, Yanhong & Zhou, Wenjun & Luo, Chunyu & Liu, Chuanren & Xiong, Hui, 2016. "Instance-based credit risk assessment for investment decisions in P2P lending," European Journal of Operational Research, Elsevier, vol. 249(2), pages 417-426.
    3. Foroudi, Pantea & Jin, Zhongqi & Gupta, Suraksha & Melewar, T.C. & Foroudi, Mohammad Mahdi, 2016. "Influence of innovation capability and customer experience on reputation and loyalty," Journal of Business Research, Elsevier, vol. 69(11), pages 4882-4889.
    4. Cui, Tianxiang & Du, Nanjiang & Yang, Xiaoying & Ding, Shusheng, 2024. "Multi-period portfolio optimization using a deep reinforcement learning hyper-heuristic approach," Technological Forecasting and Social Change, Elsevier, vol. 198(C).
    5. Andriosopoulos, Kostas & Doumpos, Michael & Papapostolou, Nikos C. & Pouliasis, Panos K., 2013. "Portfolio optimization and index tracking for the shipping stock and freight markets using evolutionary algorithms," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 52(C), pages 16-34.
    6. Dimitris Andriosopoulos & Michael Doumpos & Panos M. Pardalos & Constantin Zopounidis, 2019. "Computational approaches and data analytics in financial services: A literature review," Post-Print hal-02880149, HAL.
    7. Liu, Weilong & Zhang, Yong & Liu, Kailong & Quinn, Barry & Yang, Xingyu & Peng, Qiao, 2023. "Evolutionary multi-objective optimisation for large-scale portfolio selection with both random and uncertain returns," QBS Working Paper Series 2023/02, Queen's University Belfast, Queen's Business School.
    8. Janusz Miroforidis, 2021. "Bounds on efficient outcomes for large-scale cardinality-constrained Markowitz problems," Journal of Global Optimization, Springer, vol. 80(3), pages 617-634, July.
    9. Rui Pedro Brito & Hélder Sebastião & Pedro Godinho, 2015. "Portfolio Management With Higher Moments: The Cardinality Impact," GEMF Working Papers 2015-15, GEMF, Faculty of Economics, University of Coimbra.
    10. Zhou, Zhongbao & Jin, Qianying & Xiao, Helu & Wu, Qian & Liu, Wenbin, 2018. "Estimation of cardinality constrained portfolio efficiency via segmented DEA," Omega, Elsevier, vol. 76(C), pages 28-37.
    11. K. Liagkouras & K. Metaxiotis, 2018. "A new efficiently encoded multiobjective algorithm for the solution of the cardinality constrained portfolio optimization problem," Annals of Operations Research, Springer, vol. 267(1), pages 281-319, August.
    12. Ageeva, Elena & Melewar, T.C. & Foroudi, Pantea & Dennis, Charles & Jin, Zhongqi, 2018. "Examining the influence of corporate website favorability on corporate image and corporate reputation: Findings from fsQCA," Journal of Business Research, Elsevier, vol. 89(C), pages 287-304.
    13. Akiko Takeda & Mahesan Niranjan & Jun-ya Gotoh & Yoshinobu Kawahara, 2013. "Simultaneous pursuit of out-of-sample performance and sparsity in index tracking portfolios," Computational Management Science, Springer, vol. 10(1), pages 21-49, February.
    14. Gupta, Suraksha & Malhotra, Naresh K. & Czinkota, Michael & Foroudi, Pantea, 2016. "Marketing innovation: A consequence of competitiveness," Journal of Business Research, Elsevier, vol. 69(12), pages 5671-5681.
    15. A. Hilario-Caballero & A. Garcia-Bernabeu & J. V. Salcedo & M. Vercher, 2020. "Tri-criterion model for constructing low-carbon mutual fund portfolios: a preference-based multi-objective genetic algorithm approach," Papers 2006.11888, arXiv.org.
    16. Guastaroba, G. & Speranza, M.G., 2012. "Kernel Search: An application to the index tracking problem," European Journal of Operational Research, Elsevier, vol. 217(1), pages 54-68.
    17. Ralph Steuer & Markus Hirschberger & Kalyanmoy Deb, 2016. "Extracting from the relaxed for large-scale semi-continuous variable nondominated frontiers," Journal of Global Optimization, Springer, vol. 64(1), pages 33-48, January.
    18. Francesco Cesarone & Andrea Scozzari & Fabio Tardella, 2013. "A new method for mean-variance portfolio optimization with cardinality constraints," Annals of Operations Research, Springer, vol. 205(1), pages 213-234, May.
    19. Doering, Jana & Kizys, Renatas & Juan, Angel A. & Fitó, Àngels & Polat, Onur, 2019. "Metaheuristics for rich portfolio optimisation and risk management: Current state and future trends," Operations Research Perspectives, Elsevier, vol. 6(C).
    20. Massimiliano Kaucic & Mojtaba Moradi & Mohmmad Mirzazadeh, 2019. "Portfolio optimization by improved NSGA-II and SPEA 2 based on different risk measures," Financial Innovation, Springer;Southwestern University of Finance and Economics, vol. 5(1), pages 1-28, December.
    21. Michele Costola & Bertrand Maillet & Zhining Yuan & Xiang Zhang, 2024. "Mean-Variance Efficient Large Portfolios : A Simple Machine Learning Heuristic Technique based on the Two-Fund Separation Theorem," Post-Print hal-04514343, HAL.
    22. Xiaojin Zheng & Xiaoling Sun & Duan Li & Jie Sun, 2014. "Successive convex approximations to cardinality-constrained convex programs: a piecewise-linear DC approach," Computational Optimization and Applications, Springer, vol. 59(1), pages 379-397, October.
    23. Yu Zheng & Bowei Chen & Timothy M. Hospedales & Yongxin Yang, 2019. "Index Tracking with Cardinality Constraints: A Stochastic Neural Networks Approach," Papers 1911.05052, arXiv.org, revised Nov 2019.
    24. Paolo Giudici & Gloria Polinesi & Alessandro Spelta, 2022. "Network models to improve robot advisory portfolios," Annals of Operations Research, Springer, vol. 313(2), pages 965-989, June.
    25. Cerqueti, Roy & Falbo, Paolo & Guastaroba, Gianfranco & Pelizzari, Cristian, 2013. "A Tabu Search heuristic procedure in Markov chain bootstrapping," European Journal of Operational Research, Elsevier, vol. 227(2), pages 367-384.
    26. Jyotirmayee Behera & Pankaj Kumar, 2024. "Implementation of machine learning in $$\ell _{\infty }$$ ℓ ∞ -based sparse Sharpe ratio portfolio optimization: a case study on Indian stock market," Operational Research, Springer, vol. 24(4), pages 1-26, December.
    27. Yuanyuan Zhang & Xiang Li & Sini Guo, 2018. "Portfolio selection problems with Markowitz’s mean–variance framework: a review of literature," Fuzzy Optimization and Decision Making, Springer, vol. 17(2), pages 125-158, June.
    28. Amir Alimi, 2015. "A Two-Stage Method for Considering Cardinality in Portfolio Optimization of Mutual Funds," Modern Applied Science, Canadian Center of Science and Education, vol. 9(8), pages 289-289, August.
    29. Wei Xu & Jie Tang & Ka Fai Cedric Yiu & Jian Wen Peng, 2024. "An Efficient Global Optimal Method for Cardinality Constrained Portfolio Optimization," INFORMS Journal on Computing, INFORMS, vol. 36(2), pages 690-704, March.
    30. A. Garcia-Bernabeu & J. V. Salcedo & A. Hilario & D. Pla-Santamaria & Juan M. Herrero, 2019. "Computing the Mean-Variance-Sustainability Nondominated Surface by ev-MOGA," Complexity, Hindawi, vol. 2019, pages 1-12, December.
    31. Salo, Ahti & Doumpos, Michalis & Liesiö, Juuso & Zopounidis, Constantin, 2024. "Fifty years of portfolio optimization," European Journal of Operational Research, Elsevier, vol. 318(1), pages 1-18.
    32. Nasim Dehghan Hardoroudi & Abolfazl Keshvari & Markku Kallio & Pekka Korhonen, 2017. "Solving cardinality constrained mean-variance portfolio problems via MILP," Annals of Operations Research, Springer, vol. 254(1), pages 47-59, July.
    33. Yucheng Kao & Hsiu-Tzu Cheng, 2013. "Bacterial Foraging Optimization Approach to Portfolio Optimization," Computational Economics, Springer;Society for Computational Economics, vol. 42(4), pages 453-470, December.
    34. Anubha Goel & Damir Filipovi'c & Puneet Pasricha, 2024. "Sparse Portfolio Selection via Topological Data Analysis based Clustering," Papers 2401.16920, arXiv.org.
    35. Alexander Nikiporenko, 2023. "Time-limited Metaheuristics for Cardinality-constrained Portfolio Optimisation," Papers 2307.04045, arXiv.org.
    36. Yue Qi, 2022. "Classifying the minimum-variance surface of multiple-objective portfolio selection for capital asset pricing models," Annals of Operations Research, Springer, vol. 311(2), pages 1203-1227, April.
    37. Yu Zheng & Timothy M. Hospedales & Yongxin Yang, 2018. "Diversity and Sparsity: A New Perspective on Index Tracking," Papers 1809.01989, arXiv.org, revised Feb 2020.
    38. Adolfo Hilario-Caballero & Ana Garcia-Bernabeu & Jose Vicente Salcedo & Marisa Vercher, 2020. "Tri-Criterion Model for Constructing Low-Carbon Mutual Fund Portfolios: A Preference-Based Multi-Objective Genetic Algorithm Approach," IJERPH, MDPI, vol. 17(17), pages 1-15, August.
    39. Yue Qi & Ralph E. Steuer, 2020. "On the analytical derivation of efficient sets in quad-and-higher criterion portfolio selection," Annals of Operations Research, Springer, vol. 293(2), pages 521-538, October.
    40. Steuer, Ralph E. & Qi, Yue & Wimmer, Maximilian, 2024. "Computing cardinality constrained portfolio selection efficient frontiers via closest correlation matrices," European Journal of Operational Research, Elsevier, vol. 313(2), pages 628-636.
    41. Juan Francisco Monge, 2017. "Cardinality constrained portfolio selection via factor models," Papers 1708.02424, arXiv.org.
    42. Gupta, Suraksha & Malhotra, Naresh K. & Czinkota, Michael & Foroudi, Pantea, 2016. "The local brand representative in reseller networks," Journal of Business Research, Elsevier, vol. 69(12), pages 5712-5723.
    43. Fulga, Cristinca, 2016. "Portfolio optimization with disutility-based risk measure," European Journal of Operational Research, Elsevier, vol. 251(2), pages 541-553.
    44. Yue Qi & Xiaolin Li, 2020. "On Imposing ESG Constraints of Portfolio Selection for Sustainable Investment and Comparing the Efficient Frontiers in the Weight Space," SAGE Open, , vol. 10(4), pages 21582440209, December.

  13. Poojari, C.A. & Beasley, J.E., 2009. "Improving benders decomposition using a genetic algorithm," European Journal of Operational Research, Elsevier, vol. 199(1), pages 89-97, November.

    Cited by:

    1. M. Jenabi & S. M. T. Fatemi Ghomi & S. A. Torabi & Moeen Sammak Jalali, 2022. "An accelerated Benders decomposition algorithm for stochastic power system expansion planning using sample average approximation," OPSEARCH, Springer;Operational Research Society of India, vol. 59(4), pages 1304-1336, December.
    2. Lixin Tang & Wei Jiang & Georgios Saharidis, 2013. "An improved Benders decomposition algorithm for the logistics facility location problem with capacity expansions," Annals of Operations Research, Springer, vol. 210(1), pages 165-190, November.
    3. Faria, Victor. A.D. & de Queiroz, Anderson Rodrigo & Lima, Luana M.M. & Lima, José W.M., 2018. "Cooperative game theory and last addition method in the allocation of firm energy rights," Applied Energy, Elsevier, vol. 226(C), pages 905-915.
    4. Teodor Gabriel Crainic & Mike Hewitt & Francesca Maggioni & Walter Rei, 2021. "Partial Benders Decomposition: General Methodology and Application to Stochastic Network Design," Transportation Science, INFORMS, vol. 55(2), pages 414-435, March.
    5. Reddy, K. Nageswara & Kumar, Akhilesh & Choudhary, Alok & Cheng, T. C. Edwin, 2022. "Multi-period green reverse logistics network design: An improved Benders-decomposition-based heuristic approach," European Journal of Operational Research, Elsevier, vol. 303(2), pages 735-752.
    6. Shoufeng Ji & Qi Sun, 2017. "Low-Carbon Planning and Design in B&R Logistics Service: A Case Study of an E-Commerce Big Data Platform in China," Sustainability, MDPI, vol. 9(11), pages 1-27, November.
    7. Brech, Claus-Henning & Ernst, Andreas & Kolisch, Rainer, 2019. "Scheduling medical residents’ training at university hospitals," European Journal of Operational Research, Elsevier, vol. 274(1), pages 253-266.
    8. Raidl, Günther R., 2015. "Decomposition based hybrid metaheuristics," European Journal of Operational Research, Elsevier, vol. 244(1), pages 66-76.
    9. Kuthambalayan, Thyagaraj S. & Mehta, Peeyush & Shanker, Kripa, 2014. "Integrating operations and marketing decisions using delayed differentiation of products and guaranteed delivery time under stochastic demand," European Journal of Operational Research, Elsevier, vol. 237(2), pages 617-627.
    10. Vahab Vahdat & Mohammad Ali Vahdatzad, 2017. "Accelerated Benders’ Decomposition for Integrated Forward/Reverse Logistics Network Design under Uncertainty," Logistics, MDPI, vol. 1(2), pages 1-21, December.
    11. M. Jenabi & S. Fatemi Ghomi & S. Torabi & S. Hosseinian, 2015. "Acceleration strategies of Benders decomposition for the security constraints power system expansion planning," Annals of Operations Research, Springer, vol. 235(1), pages 337-369, December.
    12. Witthayapraphakorn, Aphisak & Charnsethikul, Peerayuth, 2019. "Benders decomposition with special purpose method for the sub problem in lot sizing problem under uncertain demand," Operations Research Perspectives, Elsevier, vol. 6(C).
    13. Rahmaniani, Ragheb & Crainic, Teodor Gabriel & Gendreau, Michel & Rei, Walter, 2017. "The Benders decomposition algorithm: A literature review," European Journal of Operational Research, Elsevier, vol. 259(3), pages 801-817.
    14. Jalali, Sajjad & Seifbarghy, Mehdi & Niaki, Seyed Taghi Akhavan, 2018. "A risk-averse location-protection problem under intentional facility disruptions: A modified hybrid decomposition algorithm," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 114(C), pages 196-219.
    15. Gelareh, Shahin & Neamatian Monemi, Rahimeh & Nickel, Stefan, 2015. "Multi-period hub location problems in transportation," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 75(C), pages 67-94.
    16. de Sá, Elisangela Martins & de Camargo, Ricardo Saraiva & de Miranda, Gilberto, 2013. "An improved Benders decomposition algorithm for the tree of hubs location problem," European Journal of Operational Research, Elsevier, vol. 226(2), pages 185-202.
    17. Soler, Edilaine Martins & de Sousa, Vanusa Alves & da Costa, Geraldo R.M., 2012. "A modified Primal–Dual Logarithmic-Barrier Method for solving the Optimal Power Flow problem with discrete and continuous control variables," European Journal of Operational Research, Elsevier, vol. 222(3), pages 616-622.
    18. Neamatian Monemi, Rahimeh & Gelareh, Shahin & Nagih, Anass & Maculan, Nelson & Danach, Kassem, 2021. "Multi-period hub location problem with serial demands: A case study of humanitarian aids distribution in Lebanon," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 149(C).
    19. Gelareh, Shahin & Pisinger, David, 2011. "Fleet deployment, network design and hub location of liner shipping companies," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 47(6), pages 947-964.
    20. Ashkan Fakhri & Mehdi Ghatee, 2013. "Solution of preemptive multi-objective network design problems applying Benders decomposition method," Annals of Operations Research, Springer, vol. 210(1), pages 295-307, November.
    21. N. Beheshti Asl & S. A. MirHassani, 2019. "Accelerating benders decomposition: multiple cuts via multiple solutions," Journal of Combinatorial Optimization, Springer, vol. 37(3), pages 806-826, April.

  14. Canakgoz, N.A. & Beasley, J.E., 2009. "Mixed-integer programming approaches for index tracking and enhanced indexation," European Journal of Operational Research, Elsevier, vol. 196(1), pages 384-399, July.

    Cited by:

    1. Francesco Cesarone & Andrea Scozzari & Fabio Tardella, 2011. "Portfolio selection problems in practice: a comparison between linear and quadratic optimization models," Papers 1105.3594, arXiv.org.
    2. Francesco Cesarone & Raffaello Cesetti & Giuseppe Orlando & Manuel Luis Martino & Jacopo Maria Ricci, 2022. "Comparing SSD-Efficient Portfolios with a Skewed Reference Distribution," Mathematics, MDPI, vol. 11(1), pages 1-20, December.
    3. Chen, Qi-an & Hu, Qingyu & Yang, Hu & Qi, Kai, 2022. "A kind of new time-weighted nonnegative lasso index-tracking model and its application," The North American Journal of Economics and Finance, Elsevier, vol. 59(C).
    4. Renato Bruni & Francesco Cesarone & Andrea Scozzari & Fabio Tardella, 2013. "No arbitrage and a linear portfolio selection model," Economics Bulletin, AccessEcon, vol. 33(2), pages 1247-1258.
    5. Andrea Scozzari & Fabio Tardella & Sandra Paterlini & Thiemo Krink, 2012. "Exact and heuristic approaches for the index tracking problem with UCITS constraints," Center for Economic Research (RECent) 081, University of Modena and Reggio E., Dept. of Economics "Marco Biagi".
    6. Ruchika Sehgal & Aparna Mehra, 2023. "Quantile Regression Based Enhanced Indexing with Portfolio Rebalancing," Journal of Quantitative Economics, Springer;The Indian Econometric Society (TIES), vol. 21(3), pages 721-742, September.
    7. 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.
    8. Yoonsik Hong & Yanghoon Kim & Jeonghun Kim & Yongmin Choi, 2022. "Index Tracking via Learning to Predict Market Sensitivities," Papers 2209.00780, arXiv.org, revised Dec 2022.
    9. Liang-chuan Wu & I-chan Tsai, 2014. "Three fuzzy goal programming models for index portfolios," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 65(8), pages 1155-1169, August.
    10. Ruchika Sehgal & Aparna Mehra, 2019. "Enhanced indexing using weighted conditional value at risk," Annals of Operations Research, Springer, vol. 280(1), pages 211-240, September.
    11. Cesarone, Francesco & Lampariello, Lorenzo & Sagratella, Simone, 2019. "A risk-gain dominance maximization approach to enhanced index tracking," Finance Research Letters, Elsevier, vol. 29(C), pages 231-238.
    12. Xianhua Peng & Chenyin Gong & Xue Dong He, 2023. "Reinforcement Learning for Financial Index Tracking," Papers 2308.02820, arXiv.org, revised Nov 2024.
    13. Hoai An Le Thi & Mahdi Moeini, 2014. "Long-Short Portfolio Optimization Under Cardinality Constraints by Difference of Convex Functions Algorithm," Journal of Optimization Theory and Applications, Springer, vol. 161(1), pages 199-224, April.
    14. Patrizia Beraldi & Maria Elena Bruni, 2022. "Enhanced indexation via chance constraints," Operational Research, Springer, vol. 22(2), pages 1553-1573, April.
    15. Huang, Jinbo & Li, Yong & Yao, Haixiang, 2018. "Index tracking model, downside risk and non-parametric kernel estimation," Journal of Economic Dynamics and Control, Elsevier, vol. 92(C), pages 103-128.
    16. Strub, O. & Baumann, P., 2018. "Optimal construction and rebalancing of index-tracking portfolios," European Journal of Operational Research, Elsevier, vol. 264(1), pages 370-387.
    17. Guastaroba, G. & Speranza, M.G., 2012. "Kernel Search: An application to the index tracking problem," European Journal of Operational Research, Elsevier, vol. 217(1), pages 54-68.
    18. Fengmin Xu & Meihua Wang & Yu-Hong Dai & Dachuan Xu, 2018. "A sparse enhanced indexation model with chance and cardinality constraints," Journal of Global Optimization, Springer, vol. 70(1), pages 5-25, January.
    19. Francesco Cesarone & Andrea Scozzari & Fabio Tardella, 2013. "A new method for mean-variance portfolio optimization with cardinality constraints," Annals of Operations Research, Springer, vol. 205(1), pages 213-234, May.
    20. Zhiping Chen & Shen Peng & Abdel Lisser, 2020. "A sparse chance constrained portfolio selection model with multiple constraints," Journal of Global Optimization, Springer, vol. 77(4), pages 825-852, August.
    21. Doering, Jana & Kizys, Renatas & Juan, Angel A. & Fitó, Àngels & Polat, Onur, 2019. "Metaheuristics for rich portfolio optimisation and risk management: Current state and future trends," Operations Research Perspectives, Elsevier, vol. 6(C).
    22. Bj�rn Fastrich & Sandra Paterlini & Peter Winker, 2014. "Cardinality versus q -norm constraints for index tracking," Quantitative Finance, Taylor & Francis Journals, vol. 14(11), pages 2019-2032, November.
    23. David Puelz & Carlos M. Carvalho & P. Richard Hahn, 2015. "Optimal ETF Selection for Passive Investing," Papers 1510.03385, arXiv.org, revised Nov 2015.
    24. Spyridon D. Mourtas & Chrysostomos Kasimis, 2022. "Exploiting Mean-Variance Portfolio Optimization Problems through Zeroing Neural Networks," Mathematics, MDPI, vol. 10(17), pages 1-20, August.
    25. Panos Xidonas & George Mavrotas, 2014. "Comparative issues between linear and non-linear risk measures for non-convex portfolio optimization: evidence from the S&P 500," Quantitative Finance, Taylor & Francis Journals, vol. 14(7), pages 1229-1242, July.
    26. Li, Qian & Bao, Liang, 2014. "Enhanced index tracking with multiple time-scale analysis," Economic Modelling, Elsevier, vol. 39(C), pages 282-292.
    27. Meihua Wang & Chengxian Xu & Fengmin Xu & Hongang Xue, 2012. "A mixed 0–1 LP for index tracking problem with CVaR risk constraints," Annals of Operations Research, Springer, vol. 196(1), pages 591-609, July.
    28. Yu Zheng & Bowei Chen & Timothy M. Hospedales & Yongxin Yang, 2019. "Index Tracking with Cardinality Constraints: A Stochastic Neural Networks Approach," Papers 1911.05052, arXiv.org, revised Nov 2019.
    29. Blitz, David & Huij, Joop, 2012. "Evaluating the performance of global emerging markets equity exchange-traded funds," Emerging Markets Review, Elsevier, vol. 13(2), pages 149-158.
    30. Valle, C.A. & Meade, N. & Beasley, J.E., 2014. "Absolute return portfolios," Omega, Elsevier, vol. 45(C), pages 20-41.
    31. Miguel A. Lejeune, 2012. "Game Theoretical Approach for Reliable Enhanced Indexation," Decision Analysis, INFORMS, vol. 9(2), pages 146-155, June.
    32. Renato Bruni & Francesco Cesarone & Andrea Scozzari & Fabio Tardella, 2012. "A new stochastic dominance approach to enhanced index tracking problems," Economics Bulletin, AccessEcon, vol. 32(4), pages 3460-3470.
    33. Li, Xuepeng & Xu, Fengmin & Jing, Kui, 2022. "Robust enhanced indexation with ESG: An empirical study in the Chinese Stock Market," Economic Modelling, Elsevier, vol. 107(C).
    34. Huang, Jinbo & Li, Yong & Yao, Haixiang, 2022. "Partial moments and indexation investment strategies," Journal of Empirical Finance, Elsevier, vol. 67(C), pages 39-59.
    35. H Mezali & J E Beasley, 2013. "Quantile regression for index tracking and enhanced indexation," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 64(11), pages 1676-1692, November.
    36. Yang, Tingting & Huang, Xiaoxia, 2022. "Two new mean–variance enhanced index tracking models based on uncertainty theory," The North American Journal of Economics and Finance, Elsevier, vol. 59(C).
    37. Xiangyu Cui & Xuan Zhang, 2021. "Index tracking strategy based on mixed-frequency financial data," PLOS ONE, Public Library of Science, vol. 16(4), pages 1-15, April.
    38. Zhiping Chen & Xinkai Zhuang & Jia Liu, 2019. "A Sustainability-Oriented Enhanced Indexation Model with Regime Switching and Cardinality Constraint," Sustainability, MDPI, vol. 11(15), pages 1-14, July.
    39. Donatien Tafin Djoko & Yves Till�, 2015. "Selection of balanced portfolios to track the main properties of a large market," Quantitative Finance, Taylor & Francis Journals, vol. 15(2), pages 359-370, February.
    40. Eduardo Acosta-Gonz�lez & Reinaldo Armas-Herrera & Fernando Fern�ndez-Rodr�guez, 2015. "On the index tracking and the statistical arbitrage choosing the stocks by means of cointegration: the role of stock picking," Quantitative Finance, Taylor & Francis Journals, vol. 15(6), pages 1075-1091, June.
    41. Seo Woo Hong & Pierre Miasnikof & Roy Kwon & Yuri Lawryshyn, 2021. "Market Graph Clustering via QUBO and Digital Annealing," JRFM, MDPI, vol. 14(1), pages 1-13, January.
    42. Emilio Ricardo Carvalhais & Antonio Marcos Duarte Júnior, 2015. "Indexation of Fixed-Income Portfolios to the IMA-B," Brazilian Business Review, Fucape Business School, vol. 12(3), pages 116-142, May.
    43. Jun Nakayama & Daisuke Yokouchi, 2018. "Applying Time Series Decomposition to Construct Index-Tracking Portfolio," Asia-Pacific Financial Markets, Springer;Japanese Association of Financial Economics and Engineering, vol. 25(4), pages 341-352, December.
    44. Panos Xidonas & Christis Hassapis & George Mavrotas & Christos Staikouras & Constantin Zopounidis, 2018. "Multiobjective portfolio optimization: bridging mathematical theory with asset management practice," Annals of Operations Research, Springer, vol. 267(1), pages 585-606, August.
    45. Lorenzo Reus & Rodolfo Prado, 2022. "Need to Meet Investment Goals? Track Synthetic Indexes with the SDDP Method," Computational Economics, Springer;Society for Computational Economics, vol. 60(1), pages 47-69, June.
    46. Gabriele Torri & Rosella Giacometti & Sandra Paterlini, 2024. "Penalized enhanced portfolio replication with asymmetric deviation measures," Annals of Operations Research, Springer, vol. 332(1), pages 481-531, January.
    47. Reza Bradrania & Davood Pirayesh Neghab & Mojtaba Shafizadeh, 2022. "State-dependent stock selection in index tracking: a machine learning approach," Financial Markets and Portfolio Management, Springer;Swiss Society for Financial Market Research, vol. 36(1), pages 1-28, March.
    48. Francesco Cesarone & Justo Puerto, 2024. "New approximate stochastic dominance approaches for Enhanced Indexation models," Papers 2401.12669, arXiv.org.
    49. Gianfranco Guastaroba & Renata Mansini & Wlodzimierz Ogryczak & M. Grazia Speranza, 2020. "Enhanced index tracking with CVaR-based ratio measures," Annals of Operations Research, Springer, vol. 292(2), pages 883-931, September.
    50. Anubha Goel & Damir Filipovi'c & Puneet Pasricha, 2024. "Sparse Portfolio Selection via Topological Data Analysis based Clustering," Papers 2401.16920, arXiv.org.
    51. Zhiping Chen & Qianhui Hu, 2018. "On Coherent Risk Measures Induced by Convex Risk Measures," Methodology and Computing in Applied Probability, Springer, vol. 20(2), pages 673-698, June.
    52. Giuzio, Margherita & Ferrari, Davide & Paterlini, Sandra, 2016. "Sparse and robust normal and t- portfolios by penalized Lq-likelihood minimization," European Journal of Operational Research, Elsevier, vol. 250(1), pages 251-261.
    53. Steven Campbell & Qien Song & Ting-Kam Leonard Wong, 2024. "Macroscopic properties of equity markets: stylized facts and portfolio performance," Papers 2409.10859, arXiv.org, revised Oct 2024.
    54. Yu Zheng & Timothy M. Hospedales & Yongxin Yang, 2018. "Diversity and Sparsity: A New Perspective on Index Tracking," Papers 1809.01989, arXiv.org, revised Feb 2020.
    55. Renato Bruni & Francesco Cesarone & Andrea Scozzari & Fabio Tardella, 2012. "A New Lp Model For Enhanced Indexation," Departmental Working Papers of Economics - University 'Roma Tre' 0168, Department of Economics - University Roma Tre.
    56. Sant’Anna, Leonardo R. & Filomena, Tiago P. & Caldeira, João F., 2017. "Index tracking and enhanced indexing using cointegration and correlation with endogenous portfolio selection," The Quarterly Review of Economics and Finance, Elsevier, vol. 65(C), pages 146-157.
    57. Julio Cezar Soares Silva & Adiel Teixeira de Almeida Filho, 2023. "A systematic literature review on solution approaches for the index tracking problem in the last decade," Papers 2306.01660, arXiv.org, revised Jun 2023.
    58. Leonardo Riegel Sant’Anna & Tiago Pascoal Filomena & Pablo Cristini Guedes & Denis Borenstein, 2017. "Index tracking with controlled number of assets using a hybrid heuristic combining genetic algorithm and non-linear programming," Annals of Operations Research, Springer, vol. 258(2), pages 849-867, November.
    59. Gaustaroba, Gianfranco & Mansini, Renata & Ogryczak, Wlodzimierz & Speranza, M. Grazia, 2014. "Linear Programming Models based on Omega Ratio for the Enhanced Index Tracking Problem," MPRA Paper 67097, University Library of Munich, Germany.
    60. Filippi, C. & Guastaroba, G. & Speranza, M.G., 2016. "A heuristic framework for the bi-objective enhanced index tracking problem," Omega, Elsevier, vol. 65(C), pages 122-137.
    61. Panos Xidonas & Ilias Lekkos & Charis Giannakidis & Christos Staikouras, 2023. "Multicriteria security evaluation: does it cost to be traditional?," Annals of Operations Research, Springer, vol. 323(1), pages 301-330, April.
    62. Woodside-Oriakhi, M. & Lucas, C. & Beasley, J.E., 2013. "Portfolio rebalancing with an investment horizon and transaction costs," Omega, Elsevier, vol. 41(2), pages 406-420.
    63. Juan Francisco Monge, 2017. "Cardinality constrained portfolio selection via factor models," Papers 1708.02424, arXiv.org.
    64. Spyridon D. Mourtas & Vasilios N. Katsikis, 2022. "V-Shaped BAS: Applications on Large Portfolios Selection Problem," Computational Economics, Springer;Society for Computational Economics, vol. 60(4), pages 1353-1373, December.
    65. Xuan Vinh Doan & Xiaobo Li & Karthik Natarajan, 2015. "Robustness to Dependency in Portfolio Optimization Using Overlapping Marginals," Operations Research, INFORMS, vol. 63(6), pages 1468-1488, December.

  15. F Alonso & M J Alvarez & J E Beasley, 2008. "A tabu search algorithm for the periodic vehicle routing problem with multiple vehicle trips and accessibility restrictions," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(7), pages 963-976, July.

    Cited by:

    1. Diego Cattaruzza & Nabil Absi & Dominique Feillet, 2018. "Vehicle routing problems with multiple trips," Annals of Operations Research, Springer, vol. 271(1), pages 127-159, December.
    2. S Coene & A Arnout & F C R Spieksma, 2010. "On a periodic vehicle routing problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(12), pages 1719-1728, December.
    3. Song, Ruidian & Zhao, Lei & Van Woensel, Tom & Fransoo, Jan C., 2019. "Coordinated delivery in urban retail," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 126(C), pages 122-148.
    4. De Bruecker, Philippe & Beliën, Jeroen & De Boeck, Liesje & De Jaeger, Simon & Demeulemeester, Erik, 2018. "A model enhancement approach for optimizing the integrated shift scheduling and vehicle routing problem in waste collection," European Journal of Operational Research, Elsevier, vol. 266(1), pages 278-290.
    5. Lahyani, Rahma & Khemakhem, Mahdi & Semet, Frédéric, 2015. "Rich vehicle routing problems: From a taxonomy to a definition," European Journal of Operational Research, Elsevier, vol. 241(1), pages 1-14.
    6. Cattaruzza, Diego & Absi, Nabil & Feillet, Dominique & Vidal, Thibaut, 2014. "A memetic algorithm for the Multi Trip Vehicle Routing Problem," European Journal of Operational Research, Elsevier, vol. 236(3), pages 833-848.
    7. Ho, Sin C. & Leung, Janny M.Y., 2010. "Solving a manpower scheduling problem for airline catering using metaheuristics," European Journal of Operational Research, Elsevier, vol. 202(3), pages 903-921, May.
    8. Diego Cattaruzza & Nabil Absi & Dominique Feillet, 2016. "Vehicle routing problems with multiple trips," 4OR, Springer, vol. 14(3), pages 223-259, September.
    9. Pan, Binbin & Zhang, Zhenzhen & Lim, Andrew, 2021. "Multi-trip time-dependent vehicle routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 291(1), pages 218-231.
    10. Macedo, Rita & Alves, Cláudio & Valério de Carvalho, J.M. & Clautiaux, François & Hanafi, Saïd, 2011. "Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model," European Journal of Operational Research, Elsevier, vol. 214(3), pages 536-545, November.
    11. Paraskevopoulos, Dimitris C. & Laporte, Gilbert & Repoussis, Panagiotis P. & Tarantilis, Christos D., 2017. "Resource constrained routing and scheduling: Review and research prospects," European Journal of Operational Research, Elsevier, vol. 263(3), pages 737-754.
    12. Vidal, Thibaut & Crainic, Teodor Gabriel & Gendreau, Michel & Prins, Christian, 2013. "Heuristics for multi-attribute vehicle routing problems: A survey and synthesis," European Journal of Operational Research, Elsevier, vol. 231(1), pages 1-21.
    13. Davis, Lauren B. & Sengul, Irem & Ivy, Julie S. & Brock, Luther G. & Miles, Lastella, 2014. "Scheduling food bank collections and deliveries to ensure food safety and improve access," Socio-Economic Planning Sciences, Elsevier, vol. 48(3), pages 175-188.
    14. Ramos, Tânia Rodrigues Pereira & Gomes, Maria Isabel & Barbosa-Póvoa, Ana Paula, 2014. "Assessing and improving management practices when planning packaging waste collection systems," Resources, Conservation & Recycling, Elsevier, vol. 85(C), pages 116-129.

  16. L Vogt & C A Poojari & J E Beasley, 2007. "A tabu search algorithm for the single vehicle routing allocation problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(4), pages 467-480, April.

    Cited by:

    1. Glock, Katharina & Meyer, Anne, 2023. "Spatial coverage in routing and path planning problems," European Journal of Operational Research, Elsevier, vol. 305(1), pages 1-20.
    2. Miranda, Pablo A. & Blazquez, Carola A. & Obreque, Carlos & Maturana-Ross, Javier & Gutierrez-Jarpa, Gabriel, 2018. "The bi-objective insular traveling salesman problem with maritime and ground transportation costs," European Journal of Operational Research, Elsevier, vol. 271(3), pages 1014-1036.
    3. Reihaneh, Mohammad & Ghoniem, Ahmed, 2019. "A branch-and-price algorithm for a vehicle routing with demand allocation problem," European Journal of Operational Research, Elsevier, vol. 272(2), pages 523-538.
    4. Pierre Hansen & Nenad Mladenović & José Moreno Pérez, 2010. "Variable neighbourhood search: methods and applications," Annals of Operations Research, Springer, vol. 175(1), pages 367-407, March.

  17. Pinol, H. & Beasley, J.E., 2006. "Scatter Search and Bionomic Algorithms for the aircraft landing problem," European Journal of Operational Research, Elsevier, vol. 171(2), pages 439-462, June.

    Cited by:

    1. Julia Bennell & Mohammad Mesgarpour & Chris Potts, 2013. "Airport runway scheduling," Annals of Operations Research, Springer, vol. 204(1), pages 249-270, April.
    2. V. Van Peteghem & M. Vanhoucke, 2009. "Using Resource Scarceness Characteristics to Solve the Multi-Mode Resource-Constrained Project Scheduling Problem," Working Papers of Faculty of Economics and Business Administration, Ghent University, Belgium 09/595, Ghent University, Faculty of Economics and Business Administration.
    3. Sabar, Nasser R. & Kendall, Graham, 2015. "An iterated local search with multiple perturbation operators and time varying perturbation strength for the aircraft landing problem," Omega, Elsevier, vol. 56(C), pages 88-98.
    4. Pohl, Maximilian & Artigues, Christian & Kolisch, Rainer, 2022. "Solving the time-discrete winter runway scheduling problem: A column generation and constraint programming approach," European Journal of Operational Research, Elsevier, vol. 299(2), pages 674-689.
    5. Salehipour, Amir, 2020. "An algorithm for single- and multiple-runway aircraft landing problem," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 175(C), pages 179-191.
    6. Marie-Sklaerder Vié & Nicolas Zufferey & Roel Leus, 2022. "Aircraft landing planning under uncertain conditions," Journal of Scheduling, Springer, vol. 25(2), pages 203-228, April.
    7. Ghoniem, Ahmed & Farhadi, Farbod & Reihaneh, Mohammad, 2015. "An accelerated branch-and-price algorithm for multiple-runway aircraft sequencing problems," European Journal of Operational Research, Elsevier, vol. 246(1), pages 34-43.
    8. Yiting Xing & Ling Li & Zhuming Bi & Marzena Wilamowska‐Korsak & Li Zhang, 2013. "Operations Research (OR) in Service Industries: A Comprehensive Review," Systems Research and Behavioral Science, Wiley Blackwell, vol. 30(3), pages 300-353, May.
    9. Vadlamani, Satish & Hosseini, Seyedmohsen, 2014. "A novel heuristic approach for solving aircraft landing problem with single runway," Journal of Air Transport Management, Elsevier, vol. 40(C), pages 144-148.
    10. Hancerliogullari, Gulsah & Rabadi, Ghaith & Al-Salem, Ameer H. & Kharbeche, Mohamed, 2013. "Greedy algorithms and metaheuristics for a multiple runway combined arrival-departure aircraft sequencing problem," Journal of Air Transport Management, Elsevier, vol. 32(C), pages 39-48.
    11. Lieder, Alexander & Stolletz, Raik, 2016. "Scheduling aircraft take-offs and landings on interdependent and heterogeneous runways," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 88(C), pages 167-188.
    12. Pohl, Maximilian & Kolisch, Rainer & Schiffer, Maximilian, 2021. "Runway scheduling during winter operations," Omega, Elsevier, vol. 102(C).
    13. Bennell, Julia A. & Mesgarpour, Mohammad & Potts, Chris N., 2017. "Dynamic scheduling of aircraft landings," European Journal of Operational Research, Elsevier, vol. 258(1), pages 315-327.
    14. Bo Xu & Weimin Ma & Hui Huang & Lei Yue, 2016. "Weighted Constrained Position Shift Model for Aircraft Arrival Sequencing and Scheduling Problem," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 33(04), pages 1-22, August.
    15. Lieder, Alexander & Briskorn, Dirk & Stolletz, Raik, 2015. "A dynamic programming approach for the aircraft landing problem with aircraft classes," European Journal of Operational Research, Elsevier, vol. 243(1), pages 61-69.
    16. Faye, Alain, 2015. "Solving the Aircraft Landing Problem with time discretization approach," European Journal of Operational Research, Elsevier, vol. 242(3), pages 1028-1038.
    17. Ng, K.K.H. & Lee, C.K.M. & Chan, Felix T.S. & Qin, Yichen, 2017. "Robust aircraft sequencing and scheduling problem with arrival/departure delay using the min-max regret approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 106(C), pages 115-136.

  18. Beasley, J. E., 2004. "A population heuristic for constrained two-dimensional non-guillotine cutting," European Journal of Operational Research, Elsevier, vol. 156(3), pages 601-627, August.

    Cited by:

    1. Igor Kierkosz & Maciej Luczak, 2014. "A hybrid evolutionary algorithm for the two-dimensional packing problem," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 22(4), pages 729-753, December.
    2. Alvarez-Valdes, R. & Parreno, F. & Tamarit, J.M., 2007. "A tabu search algorithm for a two-dimensional non-guillotine cutting problem," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1167-1182, December.
    3. Demiröz, Barış Evrim & Altınel, İ. Kuban & Akarun, Lale, 2019. "Rectangle blanket problem: Binary integer linear programming formulation and solution algorithms," European Journal of Operational Research, Elsevier, vol. 277(1), pages 62-83.
    4. Bennell, Julia A. & Soon Lee, Lai & Potts, Chris N., 2013. "A genetic algorithm for two-dimensional bin packing with due dates," International Journal of Production Economics, Elsevier, vol. 145(2), pages 547-560.
    5. Bortfeldt, Andreas, 2013. "A reduction approach for solving the rectangle packing area minimization problem," European Journal of Operational Research, Elsevier, vol. 224(3), pages 486-496.
    6. Felix Prause & Kai Hoppmann-Baum & Boris Defourny & Thorsten Koch, 2021. "The maximum diversity assortment selection problem," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 93(3), pages 521-554, June.
    7. E G Birgin & J M Martínez & W F Mascarenhas & D P Ronconi, 2006. "Method of sentinels for packing items within arbitrary convex regions," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(6), pages 735-746, June.
    8. Wascher, Gerhard & Hau[ss]ner, Heike & Schumann, Holger, 2007. "An improved typology of cutting and packing problems," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1109-1130, December.
    9. Polyakovsky, Sergey & M'Hallah, Rym, 2009. "An agent-based approach to the two-dimensional guillotine bin packing problem," European Journal of Operational Research, Elsevier, vol. 192(3), pages 767-781, February.
    10. José Fernando Gonçalves & Mauricio G. C. Resende, 2011. "A parallel multi-population genetic algorithm for a constrained two-dimensional orthogonal packing problem," Journal of Combinatorial Optimization, Springer, vol. 22(2), pages 180-201, August.
    11. Hadjiconstantinou, Eleni & Iori, Manuel, 2007. "A hybrid genetic algorithm for the two-dimensional single large object placement problem," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1150-1166, December.
    12. R Alvarez-Valdes & F Parreño & J M Tamarit, 2005. "A GRASP algorithm for constrained two-dimensional non-guillotine cutting problems," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(4), pages 414-425, April.
    13. Hong, Shaohui & Zhang, Defu & Lau, Hoong Chuin & Zeng, XiangXiang & Si, Yain-Whar, 2014. "A hybrid heuristic algorithm for the 2D variable-sized bin packing problem," European Journal of Operational Research, Elsevier, vol. 238(1), pages 95-103.
    14. Ben Messaoud, Said & Chu, Chengbin & Espinouse, Marie-Laure, 2008. "Characterization and modelling of guillotine constraints," European Journal of Operational Research, Elsevier, vol. 191(1), pages 112-126, November.
    15. Wei, Lijun & Hu, Qian & Lim, Andrew & Liu, Qiang, 2018. "A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem," European Journal of Operational Research, Elsevier, vol. 270(2), pages 448-474.
    16. Vera Neidlein & Andrèa C. G. Vianna & Marcos N. Arenales & Gerhard Wäscher, 2008. "The Two-Dimensional, Rectangular, Guillotineable-Layout Cutting Problem with a Single Defect," FEMM Working Papers 08035, Otto-von-Guericke University Magdeburg, Faculty of Economics and Management.
    17. István Borgulya, 2019. "An EDA for the 2D knapsack problem with guillotine constraint," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 27(2), pages 329-356, June.
    18. Gonçalves, José Fernando & Wäscher, Gerhard, 2020. "A MIP model and a biased random-key genetic algorithm based approach for a two-dimensional cutting problem with defects," European Journal of Operational Research, Elsevier, vol. 286(3), pages 867-882.
    19. Silva, Elsa & Oliveira, José F. & Wäscher, Gerhard, 2014. "2DCPackGen: A problem generator for two-dimensional rectangular cutting and packing problems," European Journal of Operational Research, Elsevier, vol. 237(3), pages 846-856.
    20. Gasimov, Rafail N. & Sipahioglu, Aydin & Sarac, Tugba, 2007. "A multi-objective programming approach to 1.5-dimensional assortment problem," European Journal of Operational Research, Elsevier, vol. 179(1), pages 64-79, May.
    21. Wei, Lijun & Lim, Andrew, 2015. "A bidirectional building approach for the 2D constrained guillotine knapsack packing problem," European Journal of Operational Research, Elsevier, vol. 242(1), pages 63-71.

  19. J E Beasley & M Krishnamoorthy & Y M Sharaiha & D Abramson, 2004. "Displacement problem and dynamically scheduling aircraft landings," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(1), pages 54-64, January.

    Cited by:

    1. Julia Bennell & Mohammad Mesgarpour & Chris Potts, 2013. "Airport runway scheduling," Annals of Operations Research, Springer, vol. 204(1), pages 249-270, April.
    2. Sabar, Nasser R. & Kendall, Graham, 2015. "An iterated local search with multiple perturbation operators and time varying perturbation strength for the aircraft landing problem," Omega, Elsevier, vol. 56(C), pages 88-98.
    3. Soomer, M.J. & Franx, G.J., 2008. "Scheduling aircraft landings using airlines' preferences," European Journal of Operational Research, Elsevier, vol. 190(1), pages 277-291, October.
    4. Samà, Marcella & D’Ariano, Andrea & D’Ariano, Paolo & Pacciarelli, Dario, 2017. "Scheduling models for optimal aircraft traffic control at busy airports: Tardiness, priorities, equity and violations considerations," Omega, Elsevier, vol. 67(C), pages 81-98.
    5. A R Brentnall & R C H Cheng, 2009. "Some effects of aircraft arrival sequence algorithms," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(7), pages 962-972, July.
    6. Şeyma Güven-Koçak & Aliza Heching & Pınar Keskinocak & Alejandro Toriello, 2024. "Continuity of care in home health care scheduling: a rolling horizon approach," Journal of Scheduling, Springer, vol. 27(4), pages 375-392, August.
    7. Hancerliogullari, Gulsah & Rabadi, Ghaith & Al-Salem, Ameer H. & Kharbeche, Mohamed, 2013. "Greedy algorithms and metaheuristics for a multiple runway combined arrival-departure aircraft sequencing problem," Journal of Air Transport Management, Elsevier, vol. 32(C), pages 39-48.
    8. Pohl, Maximilian & Kolisch, Rainer & Schiffer, Maximilian, 2021. "Runway scheduling during winter operations," Omega, Elsevier, vol. 102(C).
    9. Marcella Samà & Andrea D’Ariano & Konstantin Palagachev & Matthias Gerdts, 2019. "Integration methods for aircraft scheduling and trajectory optimization at a busy terminal manoeuvring area," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 41(3), pages 641-681, September.
    10. Bennell, Julia A. & Mesgarpour, Mohammad & Potts, Chris N., 2017. "Dynamic scheduling of aircraft landings," European Journal of Operational Research, Elsevier, vol. 258(1), pages 315-327.
    11. Daniel Karapetyan & Jason A. D. Atkin & Andrew J. Parkes & Juan Castro-Gutierrez, 2017. "Lessons from building an automated pre-departure sequencer for airports," Annals of Operations Research, Springer, vol. 252(2), pages 435-453, May.
    12. Faye, Alain, 2015. "Solving the Aircraft Landing Problem with time discretization approach," European Journal of Operational Research, Elsevier, vol. 242(3), pages 1028-1038.
    13. Ng, K.K.H. & Lee, C.K.M. & Chan, Felix T.S. & Qin, Yichen, 2017. "Robust aircraft sequencing and scheduling problem with arrival/departure delay using the min-max regret approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 106(C), pages 115-136.
    14. Pinol, H. & Beasley, J.E., 2006. "Scatter Search and Bionomic Algorithms for the aircraft landing problem," European Journal of Operational Research, Elsevier, vol. 171(2), pages 439-462, June.
    15. Murça, Mayara Condé Rocha & Müller, Carlos, 2015. "Control-based optimization approach for aircraft scheduling in a terminal area with alternative arrival routes," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 73(C), pages 96-113.

  20. Beasley, J. E. & Meade, N. & Chang, T. -J., 2003. "An evolutionary heuristic for the index tracking problem," European Journal of Operational Research, Elsevier, vol. 148(3), pages 621-643, August.

    Cited by:

    1. Corielli, Francesco & Marcellino, Massimiliano, 2006. "Factor based index tracking," Journal of Banking & Finance, Elsevier, vol. 30(8), pages 2215-2233, August.
    2. Margherita Giuzio, 2017. "Genetic algorithm versus classical methods in sparse index tracking," Decisions in Economics and Finance, Springer;Associazione per la Matematica, vol. 40(1), pages 243-256, November.
    3. Spiridon Penev & Pavel Shevchenko & Wei Wu, 2019. "Myopic robust index tracking with Bregman divergence," Papers 1908.07659, arXiv.org, revised Jul 2021.
    4. James Primbs & Chang Sung, 2008. "A Stochastic Receding Horizon Control Approach to Constrained Index Tracking," Asia-Pacific Financial Markets, Springer;Japanese Association of Financial Economics and Engineering, vol. 15(1), pages 3-24, March.
    5. Andriosopoulos, Kostas & Nomikos, Nikos, 2014. "Performance replication of the Spot Energy Index with optimal equity portfolio selection: Evidence from the UK, US and Brazilian markets," European Journal of Operational Research, Elsevier, vol. 234(2), pages 571-582.
    6. Samuel Fern'andez-Lorenzo & Diego Porras & Juan Jos'e Garc'ia-Ripoll, 2020. "Hybrid quantum-classical optimization for financial index tracking," Papers 2008.12050, arXiv.org, revised Oct 2021.
    7. Gnägi, M. & Strub, O., 2020. "Tracking and outperforming large stock-market indices," Omega, Elsevier, vol. 90(C).
    8. Francesco Cesarone & Raffaello Cesetti & Giuseppe Orlando & Manuel Luis Martino & Jacopo Maria Ricci, 2022. "Comparing SSD-Efficient Portfolios with a Skewed Reference Distribution," Mathematics, MDPI, vol. 11(1), pages 1-20, December.
    9. Andriosopoulos, Kostas & Doumpos, Michael & Papapostolou, Nikos C. & Pouliasis, Panos K., 2013. "Portfolio optimization and index tracking for the shipping stock and freight markets using evolutionary algorithms," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 52(C), pages 16-34.
    10. Chen, Qi-an & Hu, Qingyu & Yang, Hu & Qi, Kai, 2022. "A kind of new time-weighted nonnegative lasso index-tracking model and its application," The North American Journal of Economics and Finance, Elsevier, vol. 59(C).
    11. Renato Bruni & Francesco Cesarone & Andrea Scozzari & Fabio Tardella, 2013. "No arbitrage and a linear portfolio selection model," Economics Bulletin, AccessEcon, vol. 33(2), pages 1247-1258.
    12. Andrea Scozzari & Fabio Tardella & Sandra Paterlini & Thiemo Krink, 2012. "Exact and heuristic approaches for the index tracking problem with UCITS constraints," Center for Economic Research (RECent) 081, University of Modena and Reggio E., Dept. of Economics "Marco Biagi".
    13. Li, Helong & Huang, Qin & Wu, Baiyi, 2021. "Improving the naive diversification: An enhanced indexation approach," Finance Research Letters, Elsevier, vol. 39(C).
    14. Seyoung Park & Eun Ryung Lee & Sungchul Lee & Geonwoo Kim, 2019. "Dantzig Type Optimization Method with Applications to Portfolio Selection," Sustainability, MDPI, vol. 11(11), pages 1-32, June.
    15. Aleksandr G. Alekseev & Mikhail V. Sokolov, 2016. "Benchmark-based evaluation of portfolio performance: a characterization," Annals of Finance, Springer, vol. 12(3), pages 409-440, December.
    16. Xia, Siwei & Yang, Yuehan & Yang, Hu, 2023. "High-dimensional sparse portfolio selection with nonnegative constraint," Applied Mathematics and Computation, Elsevier, vol. 443(C).
    17. Thiemo Krink & Stefan Mittnik & Sandra Paterlini, 2009. "Differential evolution and combinatorial search for constrained index-tracking," Annals of Operations Research, Springer, vol. 172(1), pages 153-176, November.
    18. de Paulo, Wanderlei Lima & de Oliveira, Estela Mara & do Valle Costa, Oswaldo Luiz, 2016. "Enhanced index tracking optimal portfolio selection," Finance Research Letters, Elsevier, vol. 16(C), pages 93-102.
    19. 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.
    20. K. Liagkouras & K. Metaxiotis, 2018. "A new efficiently encoded multiobjective algorithm for the solution of the cardinality constrained portfolio optimization problem," Annals of Operations Research, Springer, vol. 267(1), pages 281-319, August.
    21. Ruchika Sehgal & Aparna Mehra, 2019. "Enhanced indexing using weighted conditional value at risk," Annals of Operations Research, Springer, vol. 280(1), pages 211-240, September.
    22. Dietmar Maringer & Olufemi Oyewumi, 2007. "Index tracking with constrained portfolios," Intelligent Systems in Accounting, Finance and Management, John Wiley & Sons, Ltd., vol. 15(1‐2), pages 57-71, January.
    23. Andria, Joseph & di Tollo, Giacomo & Kalda, Jaan, 2022. "The predictive power of power-laws: An empirical time-arrow based investigation," Chaos, Solitons & Fractals, Elsevier, vol. 162(C).
    24. Xianhua Peng & Chenyin Gong & Xue Dong He, 2023. "Reinforcement Learning for Financial Index Tracking," Papers 2308.02820, arXiv.org, revised Nov 2024.
    25. Rubén Ruiz-Torrubiano & Alberto Suárez, 2009. "A hybrid optimization approach to index tracking," Annals of Operations Research, Springer, vol. 166(1), pages 57-71, February.
    26. Nesri-super-˙n Okay & Uğur Akman, 2003. "Index tracking with constraint aggregation," Applied Economics Letters, Taylor & Francis Journals, vol. 10(14), pages 913-916.
    27. Patrizia Beraldi & Maria Elena Bruni, 2022. "Enhanced indexation via chance constraints," Operational Research, Springer, vol. 22(2), pages 1553-1573, April.
    28. Mahdi Moeini, 2022. "Solving the index tracking problem: a continuous optimization approach," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 30(2), pages 807-835, June.
    29. Huang, Jinbo & Li, Yong & Yao, Haixiang, 2018. "Index tracking model, downside risk and non-parametric kernel estimation," Journal of Economic Dynamics and Control, Elsevier, vol. 92(C), pages 103-128.
    30. Strub, O. & Baumann, P., 2018. "Optimal construction and rebalancing of index-tracking portfolios," European Journal of Operational Research, Elsevier, vol. 264(1), pages 370-387.
    31. Guastaroba, G. & Speranza, M.G., 2012. "Kernel Search: An application to the index tracking problem," European Journal of Operational Research, Elsevier, vol. 217(1), pages 54-68.
    32. Fengmin Xu & Meihua Wang & Yu-Hong Dai & Dachuan Xu, 2018. "A sparse enhanced indexation model with chance and cardinality constraints," Journal of Global Optimization, Springer, vol. 70(1), pages 5-25, January.
    33. Jiang, Pan & Perez, M. Fabricio, 2021. "Follow the leader: Index tracking with factor models," Journal of Empirical Finance, Elsevier, vol. 64(C), pages 337-350.
    34. Nikos S. Thomaidis & Timotheos Angelidis & Vassilios Vassiliadis & Georgios Dounias, 2009. "Active Portfolio Management With Cardinality Constraints: An Application Of Particle Swarm Optimization," New Mathematics and Natural Computation (NMNC), World Scientific Publishing Co. Pte. Ltd., vol. 5(03), pages 535-555.
    35. Beasley, J. E., 2004. "A population heuristic for constrained two-dimensional non-guillotine cutting," European Journal of Operational Research, Elsevier, vol. 156(3), pages 601-627, August.
    36. Doering, Jana & Kizys, Renatas & Juan, Angel A. & Fitó, Àngels & Polat, Onur, 2019. "Metaheuristics for rich portfolio optimisation and risk management: Current state and future trends," Operations Research Perspectives, Elsevier, vol. 6(C).
    37. Bj�rn Fastrich & Sandra Paterlini & Peter Winker, 2014. "Cardinality versus q -norm constraints for index tracking," Quantitative Finance, Taylor & Francis Journals, vol. 14(11), pages 2019-2032, November.
    38. David Puelz & Carlos M. Carvalho & P. Richard Hahn, 2015. "Optimal ETF Selection for Passive Investing," Papers 1510.03385, arXiv.org, revised Nov 2015.
    39. Eisuke Yamagata & Shunsuke Ono, 2023. "Sparse Index Tracking: Simultaneous Asset Selection and Capital Allocation via $\ell_0$-Constrained Portfolio," Papers 2309.10152, arXiv.org, revised Mar 2024.
    40. Ling, Aifan & Li, Junxue & Wen, Limin & Zhang, Yi, 2023. "When trackers are aware of ESG: Do ESG ratings matter to tracking error portfolio performance?," Economic Modelling, Elsevier, vol. 125(C).
    41. Roman, Diana & Mitra, Gautam & Zverovich, Victor, 2013. "Enhanced indexation based on second-order stochastic dominance," European Journal of Operational Research, Elsevier, vol. 228(1), pages 273-281.
    42. Li, Qian & Bao, Liang, 2014. "Enhanced index tracking with multiple time-scale analysis," Economic Modelling, Elsevier, vol. 39(C), pages 282-292.
    43. Meihua Wang & Chengxian Xu & Fengmin Xu & Hongang Xue, 2012. "A mixed 0–1 LP for index tracking problem with CVaR risk constraints," Annals of Operations Research, Springer, vol. 196(1), pages 591-609, July.
    44. Wu, Dexiang & Wu, Desheng Dash, 2020. "A decision support approach for two-stage multi-objective index tracking using improved lagrangian decomposition," Omega, Elsevier, vol. 91(C).
    45. Aleksandr Alekseev & Mikhail Sokolov, 2016. "Portfolio Return Relative to a Benchmark," EUSP Department of Economics Working Paper Series 2016/04, European University at St. Petersburg, Department of Economics.
    46. K. Liagkouras & K. Metaxiotis & G. Tsihrintzis, 2022. "Incorporating environmental and social considerations into the portfolio optimization process," Annals of Operations Research, Springer, vol. 316(2), pages 1493-1518, September.
    47. Yu Zheng & Bowei Chen & Timothy M. Hospedales & Yongxin Yang, 2019. "Index Tracking with Cardinality Constraints: A Stochastic Neural Networks Approach," Papers 1911.05052, arXiv.org, revised Nov 2019.
    48. Blitz, David & Huij, Joop, 2012. "Evaluating the performance of global emerging markets equity exchange-traded funds," Emerging Markets Review, Elsevier, vol. 13(2), pages 149-158.
    49. Detlef Seese & Christof Weinhardt & Frank Schlottmann (ed.), 2008. "Handbook on Information Technology in Finance," International Handbooks on Information Systems, Springer, number 978-3-540-49487-4, November.
    50. Erdemlioglu, Deniz & Joliet, Robert, 2019. "Long-term asset allocation, risk tolerance and market sentiment," Journal of International Financial Markets, Institutions and Money, Elsevier, vol. 62(C), pages 1-19.
    51. Renato Bruni & Francesco Cesarone & Andrea Scozzari & Fabio Tardella, 2012. "A new stochastic dominance approach to enhanced index tracking problems," Economics Bulletin, AccessEcon, vol. 32(4), pages 3460-3470.
    52. Li, Xuepeng & Xu, Fengmin & Jing, Kui, 2022. "Robust enhanced indexation with ESG: An empirical study in the Chinese Stock Market," Economic Modelling, Elsevier, vol. 107(C).
    53. Sergio Focardi & Frank Fabozzi, 2004. "A methodology for index tracking based on time-series clustering," Quantitative Finance, Taylor & Francis Journals, vol. 4(4), pages 417-425.
    54. Huang, Jinbo & Li, Yong & Yao, Haixiang, 2022. "Partial moments and indexation investment strategies," Journal of Empirical Finance, Elsevier, vol. 67(C), pages 39-59.
    55. H Mezali & J E Beasley, 2013. "Quantile regression for index tracking and enhanced indexation," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 64(11), pages 1676-1692, November.
    56. Zhiping Chen & Xinkai Zhuang & Jia Liu, 2019. "A Sustainability-Oriented Enhanced Indexation Model with Regime Switching and Cardinality Constraint," Sustainability, MDPI, vol. 11(15), pages 1-14, July.
    57. Eduardo Acosta-Gonz�lez & Reinaldo Armas-Herrera & Fernando Fern�ndez-Rodr�guez, 2015. "On the index tracking and the statistical arbitrage choosing the stocks by means of cointegration: the role of stock picking," Quantitative Finance, Taylor & Francis Journals, vol. 15(6), pages 1075-1091, June.
    58. Hassine, Marlène & Roncalli, Thierry, 2013. "Measuring Performance of Exchange Traded Funds," MPRA Paper 44298, University Library of Munich, Germany.
    59. Sant'Anna, Leonardo Riegel & de Oliveira, Alan Delgado & Filomena, Tiago Pascoal & Caldeira, João Frois, 2020. "Solving the index tracking problem based on a convex reformulation for cointegration," Finance Research Letters, Elsevier, vol. 37(C).
    60. Francesco Cesarone & Justo Puerto, 2024. "New approximate stochastic dominance approaches for Enhanced Indexation models," Papers 2401.12669, arXiv.org.
    61. Gianfranco Guastaroba & Renata Mansini & Wlodzimierz Ogryczak & M. Grazia Speranza, 2020. "Enhanced index tracking with CVaR-based ratio measures," Annals of Operations Research, Springer, vol. 292(2), pages 883-931, September.
    62. Anubha Goel & Damir Filipovi'c & Puneet Pasricha, 2024. "Sparse Portfolio Selection via Topological Data Analysis based Clustering," Papers 2401.16920, arXiv.org.
    63. Chuting Sun & Qi Wu & Xing Yan, 2023. "Dynamic CVaR Portfolio Construction with Attention-Powered Generative Factor Learning," Papers 2301.07318, arXiv.org, revised Jan 2024.
    64. Giuzio, Margherita & Ferrari, Davide & Paterlini, Sandra, 2016. "Sparse and robust normal and t- portfolios by penalized Lq-likelihood minimization," European Journal of Operational Research, Elsevier, vol. 250(1), pages 251-261.
    65. Yu Zheng & Timothy M. Hospedales & Yongxin Yang, 2018. "Diversity and Sparsity: A New Perspective on Index Tracking," Papers 1809.01989, arXiv.org, revised Feb 2020.
    66. Renato Bruni & Francesco Cesarone & Andrea Scozzari & Fabio Tardella, 2012. "A New Lp Model For Enhanced Indexation," Departmental Working Papers of Economics - University 'Roma Tre' 0168, Department of Economics - University Roma Tre.
    67. Sant’Anna, Leonardo Riegel & Caldeira, João Frois & Filomena, Tiago Pascoal, 2020. "Lasso-based index tracking and statistical arbitrage long-short strategies," The North American Journal of Economics and Finance, Elsevier, vol. 51(C).
    68. Sant’Anna, Leonardo R. & Filomena, Tiago P. & Caldeira, João F., 2017. "Index tracking and enhanced indexing using cointegration and correlation with endogenous portfolio selection," The Quarterly Review of Economics and Finance, Elsevier, vol. 65(C), pages 146-157.
    69. Tingting Yang & Xiaoxia Huang, 2022. "A New Portfolio Optimization Model Under Tracking-Error Constraint with Linear Uncertainty Distributions," Journal of Optimization Theory and Applications, Springer, vol. 195(2), pages 723-747, November.
    70. Julio Cezar Soares Silva & Adiel Teixeira de Almeida Filho, 2023. "A systematic literature review on solution approaches for the index tracking problem in the last decade," Papers 2306.01660, arXiv.org, revised Jun 2023.
    71. Leonardo Riegel Sant’Anna & Tiago Pascoal Filomena & Pablo Cristini Guedes & Denis Borenstein, 2017. "Index tracking with controlled number of assets using a hybrid heuristic combining genetic algorithm and non-linear programming," Annals of Operations Research, Springer, vol. 258(2), pages 849-867, November.
    72. Rubio-García, Álvaro & Fernández-Lorenzo, Samuel & García-Ripoll, Juan José & Porras, Diego, 2024. "Accurate solution of the Index Tracking problem with a hybrid simulated annealing algorithm," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 639(C).
    73. Gaustaroba, Gianfranco & Mansini, Renata & Ogryczak, Wlodzimierz & Speranza, M. Grazia, 2014. "Linear Programming Models based on Omega Ratio for the Enhanced Index Tracking Problem," MPRA Paper 67097, University Library of Munich, Germany.
    74. Filippi, C. & Guastaroba, G. & Speranza, M.G., 2016. "A heuristic framework for the bi-objective enhanced index tracking problem," Omega, Elsevier, vol. 65(C), pages 122-137.
    75. Sant’Anna, Leonardo Riegel & Righi, Marcelo Brutti & Müller, Fernanda Maria & Guedes, Pablo Cristini, 2022. "Risk measure index tracking model," International Review of Economics & Finance, Elsevier, vol. 80(C), pages 361-383.
    76. Sun, Chuting & Wu, Qi & Yan, Xing, 2024. "Dynamic CVaR portfolio construction with attention-powered generative factor learning," Journal of Economic Dynamics and Control, Elsevier, vol. 160(C).
    77. Ravi Kashyap, 2019. "Concepts, Components and Collections of Trading Strategies and Market Color," Papers 1910.02144, arXiv.org, revised Jan 2020.
    78. Wu, Dexiang & Dash Wu, Desheng, 2019. "An enhanced decision support approach for learning and tracking derivative index," Omega, Elsevier, vol. 88(C), pages 63-76.
    79. Aboura, Sofiane & Chevallier, Julien, 2017. "A new weighting-scheme for equity indexes," International Review of Financial Analysis, Elsevier, vol. 54(C), pages 159-175.
    80. Jin Zhang & Dietmar Maringer, 2010. "Index Mutual Fund Replication," Working Papers 035, COMISEF.
    81. Dose, Christian & Cincotti, Silvano, 2005. "Clustering of financial time series with application to index and enhanced index tracking portfolio," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 355(1), pages 145-151.
    82. Juan Francisco Monge, 2017. "Cardinality constrained portfolio selection via factor models," Papers 1708.02424, arXiv.org.
    83. Canakgoz, N.A. & Beasley, J.E., 2009. "Mixed-integer programming approaches for index tracking and enhanced indexation," European Journal of Operational Research, Elsevier, vol. 196(1), pages 384-399, July.

  21. Beasley, J. E., 2003. "Allocating fixed costs and resources via data envelopment analysis," European Journal of Operational Research, Elsevier, vol. 147(1), pages 198-216, May.

    Cited by:

    1. Adel Hatami-Marbini & Zahra Ghelej Beigi & Hirofumi Fukuyama & Kobra Gholami, 2015. "Modeling Centralized Resources Allocation and Target Setting in Imprecise Data Envelopment Analysis," International Journal of Information Technology & Decision Making (IJITDM), World Scientific Publishing Co. Pte. Ltd., vol. 14(06), pages 1189-1213, November.
    2. Du, Juan & Liang, Liang & Chen, Yao & Bi, Gong-bing, 2010. "DEA-based production planning," Omega, Elsevier, vol. 38(1-2), pages 105-112, February.
    3. Ke Wang & Xian Zhang & Yi-Ming Wei & Shiwei Yu, 2011. "Regional allocation of CO2 emissions allowance over provinces in China by 2020," CEEP-BIT Working Papers 18, Center for Energy and Environmental Policy Research (CEEP), Beijing Institute of Technology.
    4. Anyu Yu & Hao Zhang & Hu-chen Liu & Yu Shi & Weilong Bi, 2024. "Dynamic centralized resource allocation approach with contextual impacts: analyzing Chinese carbon allocation plans," Annals of Operations Research, Springer, vol. 341(1), pages 451-483, October.
    5. Menghan Chen & Sheng Ang & Lijing Jiang & Feng Yang, 2020. "Centralized resource allocation based on cross-evaluation considering organizational objective and individual preferences," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 42(2), pages 529-565, June.
    6. Barnabé Walheer, 2019. "Disaggregation for efficiency analysis," Journal of Productivity Analysis, Springer, vol. 51(2), pages 137-151, June.
    7. C. Vaz & A. Camanho & R. Guimarães, 2010. "The assessment of retailing efficiency using Network Data Envelopment Analysis," Annals of Operations Research, Springer, vol. 173(1), pages 5-24, January.
    8. Chih-Ching Yang, 2017. "Measuring health indicators and allocating health resources: a DEA-based approach," Health Care Management Science, Springer, vol. 20(3), pages 365-378, September.
    9. S Lozano & G Villa, 2005. "Centralized DEA models with the possibility of downsizing," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(4), pages 357-364, April.
    10. Mohsen Afsharian & Mohammadreza Alirezaee & Peter Reichling, 2012. "The master Malmquist index measurement using DEA-based weighted average efficiency," International Journal of Data Analysis Techniques and Strategies, Inderscience Enterprises Ltd, vol. 4(1), pages 21-42.
    11. Feng, Chenpeng & Chu, Feng & Ding, Jingjing & Bi, Gongbing & Liang, Liang, 2015. "Carbon Emissions Abatement (CEA) allocation and compensation schemes based on DEA," Omega, Elsevier, vol. 53(C), pages 78-89.
    12. Akram Dehnokhalaji & Mojtaba Ghiyasi & Pekka Korhonen, 2017. "Resource allocation based on cost efficiency," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(10), pages 1279-1289, October.
    13. Gholam Reza Jahanshahloo & Jafar Sadeghi & Mohammad Khodabakhshi, 2017. "Proposing a method for fixed cost allocation using DEA based on the efficiency invariance and common set of weights principles," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 85(2), pages 223-240, April.
    14. Chu, Junfei & Wu, Jie & Chu, Chengbin & Zhang, Tinglong, 2020. "DEA-based fixed cost allocation in two-stage systems: Leader-follower and satisfaction degree bargaining game approaches," Omega, Elsevier, vol. 94(C).
    15. Du, Juan & Cook, Wade D. & Liang, Liang & Zhu, Joe, 2014. "Fixed cost and resource allocation based on DEA cross-efficiency," European Journal of Operational Research, Elsevier, vol. 235(1), pages 206-214.
    16. Xiong, Xi & Yang, Guo-liang & Zhou, De-qun & Wang, Zi-long, 2022. "How to allocate multi-period research resources? Centralized resource allocation for public universities in China using a parallel DEA-based approach," Socio-Economic Planning Sciences, Elsevier, vol. 82(PB).
    17. Jiekun Song & Rui Chen & Xiaoping Ma, 2022. "Provincial Allocation of Energy Consumption, Air Pollutant and CO 2 Emission Quotas in China: Based on a Weighted Environment ZSG-DEA Model," Sustainability, MDPI, vol. 14(4), pages 1-21, February.
    18. Lozano, S. & Villa, G. & Adenso-Díaz, B., 2004. "Centralised target setting for regional recycling operations using DEA," Omega, Elsevier, vol. 32(2), pages 101-110, April.
    19. Walheer, Barnabé & Zhang, Linjia, 2018. "Profit Luenberger and Malmquist-Luenberger indexes for multi-activity decision making units: the case of the star-rated hotel industry in China," RIEI Working Papers 2018-06, Xi'an Jiaotong-Liverpool University, Research Institute for Economic Integration.
    20. Dai, Qianzhi & Li, Yongjun & Lei, Xiyang & Wu, Dengsheng, 2021. "A DEA-based incentive approach for allocating common revenues or fixed costs," European Journal of Operational Research, Elsevier, vol. 292(2), pages 675-686.
    21. Yongjun Li & Feng Li & Ali Emrouznejad & Liang Liang & Qiwei Xie, 2019. "Allocating the fixed cost: an approach based on data envelopment analysis and cooperative game," Annals of Operations Research, Springer, vol. 274(1), pages 373-394, March.
    22. Xi Jin & Bin Zou & Chan Wang & Kaifeng Rao & Xiaowen Tang, 2019. "Carbon Emission Allocation in a Chinese Province-Level Region Based on Two-Stage Network Structures," Sustainability, MDPI, vol. 11(5), pages 1-24, March.
    23. Yang, Jiawei & Li, Dan & Li, Yongjun, 2024. "A generalized data envelopment analysis approach for fixed cost allocation with preference information," Omega, Elsevier, vol. 122(C).
    24. Barnum, Darold T. & Karlaftis, Matthew G. & Tandon, Sonali, 2011. "Improving the efficiency of metropolitan area transit by joint analysis of its multiple providers," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 47(6), pages 1160-1176.
    25. Yu, Ming-Miin, 2008. "Assessing the technical efficiency, service effectiveness, and technical effectiveness of the world's railways through NDEA analysis," Transportation Research Part A: Policy and Practice, Elsevier, vol. 42(10), pages 1283-1294, December.
    26. S Lozano & G Villa, 2010. "DEA-based pre-merger planning tool," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(10), pages 1485-1497, October.
    27. Andreas C. Georgiou & Konstantinos Kaparis & Eleni-Maria Vretta & Kyriakos Bitsis & George Paltayian, 2024. "A Bilevel DEA Model for Efficiency Evaluation and Target Setting with Stochastic Conditions," Mathematics, MDPI, vol. 12(4), pages 1-21, February.
    28. Zhang, Yanfang & Wei, Jinpeng & Gao, Qi & Shi, Xunpeng & Zhou, Dequn, 2022. "Coordination between the energy-consumption permit trading scheme and carbon emissions trading: Evidence from China," Energy Economics, Elsevier, vol. 116(C).
    29. Ming-Miin Yu & Chih-Ku Fan, 2006. "Measuring the Cost Effectiveness of Multimode Bus Transit in the Presence of Accident Risks," Transportation Planning and Technology, Taylor & Francis Journals, vol. 29(5), pages 383-407, July.
    30. Laurens Cherchye & Bram De Rock & Barnabé Walheer, 2013. "Multi-Output Efficiency with Good and Bad Outputs," Working Papers ECARES ECARES 2013-35, ULB -- Universite Libre de Bruxelles.
    31. Ming-Miin Yu, 2008. "Measuring the efficiency and return to scale status of multi-mode bus transit - evidence from Taiwan's bus system," Applied Economics Letters, Taylor & Francis Journals, vol. 15(8), pages 647-653.
    32. Yang, Zhihua & Zhang, Qianwei, 2015. "Resource allocation based on DEA and modified Shapley value," Applied Mathematics and Computation, Elsevier, vol. 263(C), pages 280-286.
    33. A Z Milioni & J V G de Avellar & T N Rabello & G M de Freitas, 2011. "Hyperbolic frontier model: a parametric DEA approach for the distribution of a total fixed output," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(6), pages 1029-1037, June.
    34. Hougaard, Jens Leth & Tind, Jørgen, 2009. "Cost allocation and convex data envelopment," European Journal of Operational Research, Elsevier, vol. 194(3), pages 939-947, May.
    35. Liu, John S. & Lu, Louis Y.Y. & Lu, Wen-Min, 2016. "Research fronts in data envelopment analysis," Omega, Elsevier, vol. 58(C), pages 33-45.
    36. Ruiyue Lin & Zhiping Chen & Zongxin Li, 2016. "An equitable DEA-based approach for assigning fixed resources along with targets," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 67(11), pages 1373-1381, November.
    37. Laurens Cherchye & Bram De Rock & Barnabé Walheer, 2014. "Multi-output Profit Efficiency and Directional Distance Functions," Working Papers ECARES ECARES 2014-51, ULB -- Universite Libre de Bruxelles.
    38. Chen, Po-Chi & Hsu, Shih-Hsun & Chang, Ching-Cheng & Ming-Miin, Yu, 2009. "Efficiency Measurements in Multi-activity Data Envelopment Analysis with Shared Inputs: An Application to Farmers’ Organizations in Taiwan," 2009 Conference, August 16-22, 2009, Beijing, China 51657, International Association of Agricultural Economists.
    39. Amirteimoori, Alireza & Kazemi Matin, Reza & Yadollahi, Amir Hossein, 2024. "Stochastic resource reallocation in two-stage production processes with undesirable outputs: An empirical study on the power industry," Socio-Economic Planning Sciences, Elsevier, vol. 93(C).
    40. Tao Ding & Ya Chen & Huaqing Wu & Yuqi Wei, 2018. "Centralized fixed cost and resource allocation considering technology heterogeneity: a DEA approach," Annals of Operations Research, Springer, vol. 268(1), pages 497-511, September.
    41. Jianhui Xie & Qiwei Xie & Yongjun Li & Liang Liang, 2021. "Solving data envelopment analysis models with sum-of-fractional objectives: a global optimal approach based on the multiparametric disaggregation technique," Annals of Operations Research, Springer, vol. 304(1), pages 453-480, September.
    42. Min Yang & Qingxian An & Tao Ding & Pengzhen Yin & Liang Liang, 2019. "Carbon emission allocation in China based on gradually efficiency improvement and emission reduction planning principle," Annals of Operations Research, Springer, vol. 278(1), pages 123-139, July.
    43. Ane Elixabete Ripoll-Zarraga & Sebastián Lozano, 2020. "A centralised DEA approach to resource reallocation in Spanish airports," Annals of Operations Research, Springer, vol. 288(2), pages 701-732, May.
    44. Li, Yongjun & Yang, Min & Chen, Ya & Dai, Qianzhi & Liang, Liang, 2013. "Allocating a fixed cost based on data envelopment analysis and satisfaction degree," Omega, Elsevier, vol. 41(1), pages 55-60.
    45. Pendharkar, Parag C., 2021. "Allocating fixed costs using multi-coalition epsilon equilibrium," International Journal of Production Economics, Elsevier, vol. 239(C).
    46. Lei Fang & C-Q Zhang, 2008. "Resource allocation based on the DEA model," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(8), pages 1136-1141, August.
    47. Feng Li & Qingyuan Zhu & Liang Liang, 2019. "A new data envelopment analysis based approach for fixed cost allocation," Annals of Operations Research, Springer, vol. 274(1), pages 347-372, March.
    48. Lorenzo Castelli & Raffaele Pesenti & Walter Ukovich, 2010. "A classification of DEA models when the internal structure of the Decision Making Units is considered," Annals of Operations Research, Springer, vol. 173(1), pages 207-235, January.
    49. Lau, Kwok Hung, 2013. "Measuring distribution efficiency of a retail network through data envelopment analysis," International Journal of Production Economics, Elsevier, vol. 146(2), pages 598-611.
    50. Ang, Sheng & Liu, Pei & Yang, Feng, 2020. "Intra-Organizational and inter-organizational resource allocation in two-stage network systems," Omega, Elsevier, vol. 91(C).
    51. Yang, Min & Li, Yong Jun & Liang, Liang, 2015. "A generalized equilibrium efficient frontier data envelopment analysis approach for evaluating DMUs with fixed-sum outputs," European Journal of Operational Research, Elsevier, vol. 246(1), pages 209-217.
    52. Silva, Rodrigo Cesar & Milioni, Armando Zeferino, 2012. "The Adjusted Spherical Frontier Model with weight restrictions," European Journal of Operational Research, Elsevier, vol. 220(3), pages 729-735.
    53. Sebastián Lozano & Gabriel Villa, 2004. "Centralized Resource Allocation Using Data Envelopment Analysis," Journal of Productivity Analysis, Springer, vol. 22(1), pages 143-161, July.
    54. Saeedi, Hamid & Behdani, Behzad & Wiegmans, Bart & Zuidwijk, Rob, 2019. "Assessing the technical efficiency of intermodal freight transport chains using a modified network DEA approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 126(C), pages 66-86.
    55. Li, Yongjun & Lin, Lin & Dai, Qianzhi & Zhang, Linda, 2020. "Allocating common costs of multinational companies based on arm's length principle and Nash non-cooperative game," European Journal of Operational Research, Elsevier, vol. 283(3), pages 1002-1010.
    56. Yu, Anyu & You, Jianxin & Rudkin, Simon & Zhang, Hao, 2019. "Industrial carbon abatement allocations and regional collaboration: Re-evaluating China through a modified data envelopment analysis," Applied Energy, Elsevier, vol. 233, pages 232-243.
    57. Yang, Mian & Hou, Yaru & Ji, Qiang & Zhang, Dayong, 2020. "Assessment and optimization of provincial CO2 emission reduction scheme in China: An improved ZSG-DEA approach," Energy Economics, Elsevier, vol. 91(C).
    58. Xie, Qiwei & Xu, Qifan & Zhu, Da & Rao, Kaifeng & Dai, Qianzhi, 2020. "Fair allocation of wastewater discharge permits based on satisfaction criteria using data envelopment analysis," Utilities Policy, Elsevier, vol. 66(C).
    59. Chao, Shih-Liang & Yu, Ming-Miin, 2022. "Applying data envelopment analysis to allocate incentive bonuses for container terminal operators," Transport Policy, Elsevier, vol. 125(C), pages 231-240.
    60. Yingying Shao & Gongbing Bi & Feng Yang & Qiong Xia, 2018. "Resource allocation for branch network system with considering heterogeneity based on DEA method," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 26(4), pages 1005-1025, December.
    61. Liang, Liang & Wu, Jie & Cook, Wade D. & Zhu, Joe, 2008. "Alternative secondary goals in DEA cross-efficiency evaluation," International Journal of Production Economics, Elsevier, vol. 113(2), pages 1025-1030, June.
    62. Weiwei Zhu & Qian Zhang & Haiqing Wang, 2019. "Fixed costs and shared resources allocation in two-stage network DEA," Annals of Operations Research, Springer, vol. 278(1), pages 177-194, July.
    63. Mehdi Soltanifar & Farhad Hosseinzadeh Lotfi & Hamid Sharafi & Sebastián Lozano, 2022. "Resource allocation and target setting: a CSW–DEA based approach," Annals of Operations Research, Springer, vol. 318(1), pages 557-589, November.
    64. Afsharian, Mohsen & Ahn, Heinz & Harms, Sören Guntram, 2021. "A review of DEA approaches applying a common set of weights: The perspective of centralized management," European Journal of Operational Research, Elsevier, vol. 294(1), pages 3-15.
    65. Li, Feng & Zhu, Qingyuan & Chen, Zhi, 2019. "Allocating a fixed cost across the decision making units with two-stage network structures," Omega, Elsevier, vol. 83(C), pages 139-154.
    66. J V Guedes de Avellar & A Z Milioni & T N Rabello, 2007. "Spherical frontier DEA model based on a constant sum of inputs," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(9), pages 1246-1251, September.
    67. Pachkova, Elena V., 2009. "Restricted reallocation of resources," European Journal of Operational Research, Elsevier, vol. 196(3), pages 1049-1057, August.
    68. Qingxian An & Ping Wang & Honglin Yang & Zongrun Wang, 2021. "Fixed cost allocation in two-stage system using DEA from a noncooperative view," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 43(4), pages 1077-1102, December.
    69. Lozano, S., 2012. "Information sharing in DEA: A cooperative game theory approach," European Journal of Operational Research, Elsevier, vol. 222(3), pages 558-565.
    70. Milioni, Armando Zeferino & de Avellar, José Virgílio Guedes & Gomes, Eliane Gonçalves & Soares de Mello, João Carlos Correia Baptista, 2011. "An ellipsoidal frontier model: Allocating input via parametric DEA," European Journal of Operational Research, Elsevier, vol. 209(2), pages 113-121, March.
    71. Ma, Gang & Li, Xu & Zheng, Jianping, 2020. "Efficiency and equity in regional coal de-capacity allocation in China: A multiple objective programming model based on Gini coefficient and Data Envelopment Analysis," Resources Policy, Elsevier, vol. 66(C).
    72. Yu, Anyu & Zhang, Qin & Yu, Rongjian & Cheng, Yu, 2023. "More is better or in waste? A resource allocation measure of government grants for facilitating firm innovations," Technological Forecasting and Social Change, Elsevier, vol. 197(C).
    73. Pendharkar, Parag C., 2015. "Cost minimizing target setting heuristics for making inefficient decision-making units efficient," International Journal of Production Economics, Elsevier, vol. 162(C), pages 1-12.
    74. Arocena, Pablo & Cabasés, Fermín & Pascual, Pedro, 2022. "A centralized directional distance model for efficient and horizontally equitable grants allocation to local governments," Socio-Economic Planning Sciences, Elsevier, vol. 81(C).
    75. Walheer, Barnabe & Hudik, Marek, 2019. "Reallocation of resources in multidivisional firms: A nonparametric approach," International Journal of Production Economics, Elsevier, vol. 214(C), pages 196-205.
    76. Li, Yongjun & Yang, Feng & Liang, Liang & Hua, Zhongsheng, 2009. "Allocating the fixed cost as a complement of other cost inputs: A DEA approach," European Journal of Operational Research, Elsevier, vol. 197(1), pages 389-401, August.
    77. Xie, Qiwei & Hu, Ping & Jiang, An & Li, Yongjun, 2019. "Carbon emissions allocation based on satisfaction perspective and data envelopment analysis," Energy Policy, Elsevier, vol. 132(C), pages 254-264.
    78. Chien-Ming Chen & Joe Zhu, 2011. "Efficient Resource Allocation via Efficiency Bootstraps: An Application to R&D Project Budgeting," Operations Research, INFORMS, vol. 59(3), pages 729-741, June.
    79. An, Qingxian & Wang, Ping & Emrouznejad, Ali & Hu, Junhua, 2020. "Fixed cost allocation based on the principle of efficiency invariance in two-stage systems," European Journal of Operational Research, Elsevier, vol. 283(2), pages 662-675.
    80. Jie Wu & Qingyuan Zhu & Wade D Cook & Joe Zhu, 2016. "Best cooperative partner selection and input resource reallocation using DEA," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 67(9), pages 1221-1237, September.
    81. Yu, Ming-Miin & Chen, Li-Hsueh & Hsiao, Bo, 2018. "A performance-based subsidy allocation of ferry transportation: A data envelopment approach," Transport Policy, Elsevier, vol. 68(C), pages 13-19.
    82. White, Sheneeta W. & Badinelli, Ralph D., 2012. "A model for efficiency-based resource integration in services," European Journal of Operational Research, Elsevier, vol. 217(2), pages 439-447.
    83. Wu, Jie & Zhu, Qingyuan & Liang, Liang, 2016. "CO2 emissions and energy intensity reduction allocation over provincial industrial sectors in China," Applied Energy, Elsevier, vol. 166(C), pages 282-291.
    84. Soltanifar, Mehdi & Shahghobadi, Saeid, 2013. "Selecting a benevolent secondary goal model in data envelopment analysis cross-efficiency evaluation by a voting model," Socio-Economic Planning Sciences, Elsevier, vol. 47(1), pages 65-74.
    85. Jiekun Song & Zhicheng Liu & Rui Chen & Xueli Leng, 2023. "Calculation and Allocation of Atmospheric Environment Governance Cost in the Yangtze River Economic Belt of China," IJERPH, MDPI, vol. 20(5), pages 1-21, February.
    86. Hamid Sharafi & Farhad Hosseinzadeh Lotfi & Gholam Reza Jahanshahloo & Somayeh Razipour-GhalehJough, 2020. "Fair Allocation Fixed Cost Using Cross-Efficiency Based on Pareto Concept," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 37(01), pages 1-23, January.
    87. Mahdiloo, Mahdi & Ngwenyama, Ojelanki & Scheepers, Rens & Tamaddoni, Ali, 2018. "Managing emissions allowances of electricity producers to maximize CO2 abatement: DEA models for analyzing emissions and allocating emissions allowances," International Journal of Production Economics, Elsevier, vol. 205(C), pages 244-255.
    88. Jie Wu & Jun-Fei Chu & Liang Liang, 2016. "Target setting and allocation of carbon emissions abatement based on DEA and closest target: an application to 20 APEC economies," Natural Hazards: Journal of the International Society for the Prevention and Mitigation of Natural Hazards, Springer;International Society for the Prevention and Mitigation of Natural Hazards, vol. 84(1), pages 279-296, November.
    89. An, Qingxian & Tao, Xiangyang & Xiong, Beibei & Chen, Xiaohong, 2022. "Frontier-based incentive mechanisms for allocating common revenues or fixed costs," European Journal of Operational Research, Elsevier, vol. 302(1), pages 294-308.
    90. Yu, Ming-Miin & Chen, Li-Hsueh & Hsiao, Bo, 2016. "A fixed cost allocation based on the two-stage network data envelopment approach," Journal of Business Research, Elsevier, vol. 69(5), pages 1817-1822.

  22. N P Hoare & J E Beasley, 2001. "Placing boxes on shelves: a case study," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 52(6), pages 605-614, June.

    Cited by:

    1. Robert Russell & Timothy Urban, 2010. "The location and allocation of products and product families on retail shelves," Annals of Operations Research, Springer, vol. 179(1), pages 131-147, September.
    2. A Curşeu & T van Woensel & J Fransoo & K van Donselaar & R Broekmeulen, 2009. "Modelling handling operations in grocery retail stores: an empirical analysis," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(2), pages 200-214, February.
    3. Kateryna Czerniachowska, 2022. "A genetic algorithm for the retail shelf space allocation problem with virtual segments," OPSEARCH, Springer;Operational Research Society of India, vol. 59(1), pages 364-412, March.

  23. J E Beasley & J Sonander & P Havelock, 2001. "Scheduling aircraft landings at London Heathrow using a population heuristic," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 52(5), pages 483-493, May.

    Cited by:

    1. Julia Bennell & Mohammad Mesgarpour & Chris Potts, 2013. "Airport runway scheduling," Annals of Operations Research, Springer, vol. 204(1), pages 249-270, April.
    2. Jason A. D. Atkin & Edmund K. Burke & John S. Greenwood & Dale Reeson, 2009. "An examination of take-off scheduling constraints at London Heathrow airport," Public Transport, Springer, vol. 1(3), pages 169-187, August.
    3. Soomer, M.J. & Franx, G.J., 2008. "Scheduling aircraft landings using airlines' preferences," European Journal of Operational Research, Elsevier, vol. 190(1), pages 277-291, October.
    4. Marie-Sklaerder Vié & Nicolas Zufferey & Roel Leus, 2022. "Aircraft landing planning under uncertain conditions," Journal of Scheduling, Springer, vol. 25(2), pages 203-228, April.
    5. Samà, Marcella & D’Ariano, Andrea & D’Ariano, Paolo & Pacciarelli, Dario, 2017. "Scheduling models for optimal aircraft traffic control at busy airports: Tardiness, priorities, equity and violations considerations," Omega, Elsevier, vol. 67(C), pages 81-98.
    6. A R Brentnall & R C H Cheng, 2009. "Some effects of aircraft arrival sequence algorithms," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(7), pages 962-972, July.
    7. Jianan Yin & Yuanyuan Ma & Yuxin Hu & Ke Han & Suwan Yin & Hua Xie, 2021. "Delay, Throughput and Emission Tradeoffs in Airport Runway Scheduling with Uncertainty Considerations," Networks and Spatial Economics, Springer, vol. 21(1), pages 85-122, March.
    8. J E Beasley & M Krishnamoorthy & Y M Sharaiha & D Abramson, 2004. "Displacement problem and dynamically scheduling aircraft landings," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(1), pages 54-64, January.
    9. Beasley, J. E., 2004. "A population heuristic for constrained two-dimensional non-guillotine cutting," European Journal of Operational Research, Elsevier, vol. 156(3), pages 601-627, August.
    10. Jason A. D. Atkin & Edmund K. Burke & John S. Greenwood & Dale Reeson, 2007. "Hybrid Metaheuristics to Aid Runway Scheduling at London Heathrow Airport," Transportation Science, INFORMS, vol. 41(1), pages 90-106, February.
    11. Hancerliogullari, Gulsah & Rabadi, Ghaith & Al-Salem, Ameer H. & Kharbeche, Mohamed, 2013. "Greedy algorithms and metaheuristics for a multiple runway combined arrival-departure aircraft sequencing problem," Journal of Air Transport Management, Elsevier, vol. 32(C), pages 39-48.
    12. Dixit, Aasheesh & Jakhar, Suresh Kumar, 2021. "Airport capacity management: A review and bibliometric analysis," Journal of Air Transport Management, Elsevier, vol. 91(C).
    13. Anna Kwasiborska & Jacek Skorupski, 2021. "Assessment of the Method of Merging Landing Aircraft Streams in the Context of Fuel Consumption in the Airspace," Sustainability, MDPI, vol. 13(22), pages 1-18, November.
    14. Bennell, Julia A. & Mesgarpour, Mohammad & Potts, Chris N., 2017. "Dynamic scheduling of aircraft landings," European Journal of Operational Research, Elsevier, vol. 258(1), pages 315-327.
    15. Daniel Karapetyan & Jason A. D. Atkin & Andrew J. Parkes & Juan Castro-Gutierrez, 2017. "Lessons from building an automated pre-departure sequencer for airports," Annals of Operations Research, Springer, vol. 252(2), pages 435-453, May.
    16. Lieder, Alexander & Briskorn, Dirk & Stolletz, Raik, 2015. "A dynamic programming approach for the aircraft landing problem with aircraft classes," European Journal of Operational Research, Elsevier, vol. 243(1), pages 61-69.
    17. Chandra, Aitichya & Choubey, Nipun & Verma, Ashish & Sooraj, K.P., 2024. "Quasi-stochastic optimization model for time-based arrival scheduling considering Standard Terminal Arrival (STAR) track time and a new delay-conflict relationship," Journal of Air Transport Management, Elsevier, vol. 115(C).
    18. Faye, Alain, 2015. "Solving the Aircraft Landing Problem with time discretization approach," European Journal of Operational Research, Elsevier, vol. 242(3), pages 1028-1038.
    19. Ng, K.K.H. & Lee, C.K.M. & Chan, Felix T.S. & Qin, Yichen, 2017. "Robust aircraft sequencing and scheduling problem with arrival/departure delay using the min-max regret approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 106(C), pages 115-136.
    20. C N Potts & V A Strusevich, 2009. "Fifty years of scheduling: a survey of milestones," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 41-68, May.
    21. Pinol, H. & Beasley, J.E., 2006. "Scatter Search and Bionomic Algorithms for the aircraft landing problem," European Journal of Operational Research, Elsevier, vol. 171(2), pages 439-462, June.

  24. J. E. Beasley & M. Krishnamoorthy & Y. M. Sharaiha & D. Abramson, 2000. "Scheduling Aircraft Landings—The Static Case," Transportation Science, INFORMS, vol. 34(2), pages 180-197, May.

    Cited by:

    1. Julia Bennell & Mohammad Mesgarpour & Chris Potts, 2013. "Airport runway scheduling," Annals of Operations Research, Springer, vol. 204(1), pages 249-270, April.
    2. Jason A. D. Atkin & Edmund K. Burke & John S. Greenwood & Dale Reeson, 2009. "An examination of take-off scheduling constraints at London Heathrow airport," Public Transport, Springer, vol. 1(3), pages 169-187, August.
    3. Han Zhong & Wei Guan & Wenyi Zhang & Shixiong Jiang & Lingling Fan, 2018. "A bi-objective integer programming model for partly-restricted flight departure scheduling," PLOS ONE, Public Library of Science, vol. 13(5), pages 1-18, May.
    4. Hamsa Balakrishnan & Bala G. Chandran, 2010. "Algorithms for Scheduling Runway Operations Under Constrained Position Shifting," Operations Research, INFORMS, vol. 58(6), pages 1650-1665, December.
    5. Pohl, Maximilian & Artigues, Christian & Kolisch, Rainer, 2022. "Solving the time-discrete winter runway scheduling problem: A column generation and constraint programming approach," European Journal of Operational Research, Elsevier, vol. 299(2), pages 674-689.
    6. Rakesh Prakash & Jitamitra Desai & Rajesh Piplani, 2022. "An optimal data-splitting algorithm for aircraft sequencing on a single runway," Annals of Operations Research, Springer, vol. 309(2), pages 587-610, February.
    7. Salehipour, Amir, 2020. "An algorithm for single- and multiple-runway aircraft landing problem," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 175(C), pages 179-191.
    8. A R Brentnall & R C H Cheng, 2009. "Some effects of aircraft arrival sequence algorithms," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(7), pages 962-972, July.
    9. Jason A. D. Atkin & Geert De Maere & Edmund K. Burke & John S. Greenwood, 2013. "Addressing the Pushback Time Allocation Problem at Heathrow Airport," Transportation Science, INFORMS, vol. 47(4), pages 584-602, November.
    10. J E Beasley & M Krishnamoorthy & Y M Sharaiha & D Abramson, 2004. "Displacement problem and dynamically scheduling aircraft landings," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(1), pages 54-64, January.
    11. Mohamed Ali Kammoun & Sadok Turki & Nidhal Rezg, 2020. "Optimization of Flight Rescheduling Problem under Carbon Tax," Sustainability, MDPI, vol. 12(14), pages 1-19, July.
    12. Jason A. D. Atkin & Edmund K. Burke & John S. Greenwood & Dale Reeson, 2007. "Hybrid Metaheuristics to Aid Runway Scheduling at London Heathrow Airport," Transportation Science, INFORMS, vol. 41(1), pages 90-106, February.
    13. Gui, Dongdong & Le, Meilong & Huang, Zhouchun & Zhang, Junfeng & D’Ariano, Andrea, 2023. "Optimal aircraft arrival scheduling with continuous descent operations in busy terminal maneuvering areas," Journal of Air Transport Management, Elsevier, vol. 107(C).
    14. Murça, Mayara Condé Rocha, 2018. "Collaborative air traffic flow management: Incorporating airline preferences in rerouting decisions," Journal of Air Transport Management, Elsevier, vol. 71(C), pages 97-107.
    15. Guépet, Julien & Briant, Olivier & Gayon, Jean-Philippe & Acuna-Agost, Rodrigo, 2017. "Integration of aircraft ground movements and runway operations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 104(C), pages 131-149.
    16. Dixit, Aasheesh & Jakhar, Suresh Kumar, 2021. "Airport capacity management: A review and bibliometric analysis," Journal of Air Transport Management, Elsevier, vol. 91(C).
    17. Zhang, Junfeng & Zhao, Pengli & Zhang, Yu & Dai, Ximei & Sui, Dong, 2020. "Criteria selection and multi-objective optimization of aircraft landing problem," Journal of Air Transport Management, Elsevier, vol. 82(C).
    18. Ahmed Khassiba & Fabian Bastin & Sonia Cafieri & Bernard Gendron & Marcel Mongeau, 2020. "Two-Stage Stochastic Mixed-Integer Programming with Chance Constraints for Extended Aircraft Arrival Management," Transportation Science, INFORMS, vol. 54(4), pages 897-919, July.
    19. Pohl, Maximilian & Kolisch, Rainer & Schiffer, Maximilian, 2021. "Runway scheduling during winter operations," Omega, Elsevier, vol. 102(C).
    20. Santos, Bruno F. & Wormer, Maarten M.E.C. & Achola, Thomas A.O. & Curran, Richard, 2017. "Airline delay management problem with airport capacity constraints and priority decisions," Journal of Air Transport Management, Elsevier, vol. 63(C), pages 34-44.
    21. Anna Kwasiborska & Jacek Skorupski, 2021. "Assessment of the Method of Merging Landing Aircraft Streams in the Context of Fuel Consumption in the Airspace," Sustainability, MDPI, vol. 13(22), pages 1-18, November.
    22. Bennell, Julia A. & Mesgarpour, Mohammad & Potts, Chris N., 2017. "Dynamic scheduling of aircraft landings," European Journal of Operational Research, Elsevier, vol. 258(1), pages 315-327.
    23. Chen, Shuiwang & Wu, Lingxiao & Ng, Kam K.H. & Liu, Wei & Wang, Kun, 2024. "How airports enhance the environmental sustainability of operations: A critical review from the perspective of Operations Research," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 183(C).
    24. Bo Xu & Weimin Ma & Hui Huang & Lei Yue, 2016. "Weighted Constrained Position Shift Model for Aircraft Arrival Sequencing and Scheduling Problem," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 33(04), pages 1-22, August.
    25. Daniel Karapetyan & Jason A. D. Atkin & Andrew J. Parkes & Juan Castro-Gutierrez, 2017. "Lessons from building an automated pre-departure sequencer for airports," Annals of Operations Research, Springer, vol. 252(2), pages 435-453, May.
    26. Kapolke, Manu & Fürstenau, Norbert & Heidt, Andreas & Liers, Frauke & Mittendorf, Monika & Weiß, Christian, 2016. "Pre-tactical optimization of runway utilization under uncertainty," Journal of Air Transport Management, Elsevier, vol. 56(PA), pages 48-56.
    27. Senay Solak & Gustaf Solveling & John-Paul B. Clarke & Ellis L. Johnson, 2018. "Stochastic Runway Scheduling," Transportation Science, INFORMS, vol. 52(4), pages 917-940, August.
    28. Chandra, Aitichya & Choubey, Nipun & Verma, Ashish & Sooraj, K.P., 2024. "Quasi-stochastic optimization model for time-based arrival scheduling considering Standard Terminal Arrival (STAR) track time and a new delay-conflict relationship," Journal of Air Transport Management, Elsevier, vol. 115(C).
    29. Heidt, Andreas & Helmke, Hartmut & Kapolke, Manu & Liers, Frauke & Martin, Alexander, 2016. "Robust runway scheduling under uncertain conditions," Journal of Air Transport Management, Elsevier, vol. 56(PA), pages 28-37.
    30. Ng, K.K.H. & Lee, C.K.M. & Chan, Felix T.S. & Qin, Yichen, 2017. "Robust aircraft sequencing and scheduling problem with arrival/departure delay using the min-max regret approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 106(C), pages 115-136.
    31. Geert De Maere & Jason A. D. Atkin & Edmund K. Burke, 2018. "Pruning Rules for Optimal Runway Sequencing," Transportation Science, INFORMS, vol. 52(4), pages 898-916, August.

  25. Y.M. Sharaiha & J.E. Beasley, 1999. "Foreword," Annals of Operations Research, Springer, vol. 86(0), pages 0, January.

    Cited by:

    1. Alexia Gaudeul, 2008. "Consumer Welfare and Market Structure in a Model of Competition between Open Source and Proprietary Software," Working Paper series, University of East Anglia, Centre for Competition Policy (CCP) 2008-31, Centre for Competition Policy, University of East Anglia, Norwich, UK..
    2. Claude Diebolt, 2009. "The Stakes of Cliometrics in Ancient History," Working Papers 09-12, Association Française de Cliométrie (AFC).
    3. Andrews, Matthew, 2008. "Is Black Economic Empowerment a South African Growth Catalyst? (Or Could It Be...)," Working Paper Series rwp08-033, Harvard University, John F. Kennedy School of Government.
    4. O'Regan, Philip, 2010. "'A dense mass of petty accountability': Accounting in the service of cultural imperialism during the Irish Famine, 1846-1847," Accounting, Organizations and Society, Elsevier, vol. 35(4), pages 416-430, May.

  26. Beasley, J. E. & Christofides, N., 1997. "Vehicle routing with a sparse feasibility graph," European Journal of Operational Research, Elsevier, vol. 98(3), pages 499-511, May.

    Cited by:

    1. Tan, K.C. & Chew, Y.H. & Lee, L.H., 2006. "A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems," European Journal of Operational Research, Elsevier, vol. 172(3), pages 855-885, August.
    2. Yu, Junfang & Dong, Yuanyuan, 2013. "Maximizing profit for vehicle routing under time and weight constraints," International Journal of Production Economics, Elsevier, vol. 145(2), pages 573-583.
    3. Ilgaz Sungur & Yingtao Ren & Fernando Ordóñez & Maged Dessouky & Hongsheng Zhong, 2010. "A Model and Algorithm for the Courier Delivery Problem with Uncertainty," Transportation Science, INFORMS, vol. 44(2), pages 193-205, May.
    4. Hongsheng Zhong & Randolph W. Hall & Maged Dessouky, 2007. "Territory Planning and Vehicle Dispatching with Driver Learning," Transportation Science, INFORMS, vol. 41(1), pages 74-89, February.

  27. 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.

    Cited by:

    1. Ciancio, Claudio & Laganà, Demetrio & Musmanno, Roberto & Santoro, Francesco, 2018. "An integrated algorithm for shift scheduling problems for local public transport companies," Omega, Elsevier, vol. 75(C), pages 139-153.
    2. Yan, Shangyao & Yang, Ta-Hui & Chen, Hsuan-Hung, 2004. "Airline short-term maintenance manpower supply planning," Transportation Research Part A: Policy and Practice, Elsevier, vol. 38(9-10), pages 615-642.
    3. Vahid Zeighami & François Soumis, 2019. "Combining Benders’ Decomposition and Column Generation for Integrated Crew Pairing and Personalized Crew Assignment Problems," Transportation Science, INFORMS, vol. 53(5), pages 1479-1499, September.
    4. Shangyao Yan & Chia-Hung Chen & Chung-Kai Chen, 2008. "Short-term shift setting and manpower supplying under stochastic demands for air cargo terminals," Transportation, Springer, vol. 35(3), pages 425-444, May.
    5. Jorge Amaya & Paula Uribe, 2018. "A model and computational tool for crew scheduling in train transportation of mine materials by using a local search strategy," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 26(3), pages 383-402, October.
    6. Abdallah Abu Abdallah & Ra’ed Masa’deh, 2019. "Modeling and Analysis of Bus Scheduling Systems of Public Bus Transport in Aqaba Special Economic Zone Authority," Journal of Business & Management (COES&RJ-JBM), , vol. 7(2), pages 137-161, April.
    7. Parmentier, Axel & Meunier, Frédéric, 2020. "Aircraft routing and crew pairing: Updated algorithms at Air France," Omega, Elsevier, vol. 93(C).
    8. Eveborn, Patrik & Flisberg, Patrik & Ronnqvist, Mikael, 2006. "Laps Care--an operational system for staff planning of home care," European Journal of Operational Research, Elsevier, vol. 171(3), pages 962-976, June.
    9. Yan, Shangyao & Chen, Chia-Hung & Chen, Chung-Kai, 2006. "Long-term manpower supply planning for air cargo terminals," Journal of Air Transport Management, Elsevier, vol. 12(4), pages 175-181.
    10. Matteo Fischetti & Andrea Lodi & Silvano Martello & Paolo Toth, 2001. "A Polyhedral Approach to Simplified Crew Scheduling and Vehicle Scheduling Problems," Management Science, INFORMS, vol. 47(6), pages 833-850, June.
    11. Zeren, Bahadır & Özcan, Ender & Deveci, Muhammet, 2024. "An adaptive greedy heuristic for large scale airline crew pairing problems," Journal of Air Transport Management, Elsevier, vol. 114(C).
    12. 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.
    13. Heil, Julia & Hoffmann, Kirsten & Buscher, Udo, 2020. "Railway crew scheduling: Models, methods and applications," European Journal of Operational Research, Elsevier, vol. 283(2), pages 405-425.
    14. Amy Mainville Cohn & Cynthia Barnhart, 2003. "Improving Crew Scheduling by Incorporating Key Maintenance Routing Decisions," Operations Research, INFORMS, vol. 51(3), pages 387-396, June.
    15. 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.
    16. Yang, Ta-Hui & Yan, Shangyao & Chen, Hsuan-Hung, 2003. "An airline maintenance manpower planning model with flexible strategies," Journal of Air Transport Management, Elsevier, vol. 9(4), pages 233-239.

  28. J. Beasley & E. Nascimento, 1996. "The Vehicle Routing-Allocation Problem: A unifying framework," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 4(1), pages 65-86, June.

    Cited by:

    1. Baldacci, Roberto & Hill, Alessandro & Hoshino, Edna A. & Lim, Andrew, 2017. "Pricing strategies for capacitated ring-star problems based on dynamic programming algorithms," European Journal of Operational Research, Elsevier, vol. 262(3), pages 879-893.
    2. Glock, Katharina & Meyer, Anne, 2023. "Spatial coverage in routing and path planning problems," European Journal of Operational Research, Elsevier, vol. 305(1), pages 1-20.
    3. Frey, Christian M.M. & Jungwirth, Alexander & Frey, Markus & Kolisch, Rainer, 2023. "The vehicle routing problem with time windows and flexible delivery locations," European Journal of Operational Research, Elsevier, vol. 308(3), pages 1142-1159.
    4. Xujin Chen & Xiaodong Hu & Xiaohua Jia & Zhongzheng Tang & Chenhao Wang & Ying Zhang, 0. "Algorithms for the metric ring star problem with fixed edge-cost ratio," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-25.
    5. Wang, Mengtong & Zhang, Canrong & Bell, Michael G.H. & Miao, Lixin, 2022. "A branch-and-price algorithm for location-routing problems with pick-up stations in the last-mile distribution system," European Journal of Operational Research, Elsevier, vol. 303(3), pages 1258-1276.
    6. Fatih Rahim & Canan Sepil, 2014. "A location-routing problem in glass recycling," Annals of Operations Research, Springer, vol. 223(1), pages 329-353, December.
    7. Miranda, Pablo A. & Blazquez, Carola A. & Obreque, Carlos & Maturana-Ross, Javier & Gutierrez-Jarpa, Gabriel, 2018. "The bi-objective insular traveling salesman problem with maritime and ground transportation costs," European Journal of Operational Research, Elsevier, vol. 271(3), pages 1014-1036.
    8. Baldacci, R. & Dell'Amico, M., 2010. "Heuristic algorithms for the multi-depot ring-star problem," European Journal of Operational Research, Elsevier, vol. 203(1), pages 270-281, May.
    9. Reihaneh, Mohammad & Ghoniem, Ahmed, 2019. "A branch-and-price algorithm for a vehicle routing with demand allocation problem," European Journal of Operational Research, Elsevier, vol. 272(2), pages 523-538.
    10. R. Baldacci & M. Dell'Amico & J. Salazar González, 2007. "The Capacitated m -Ring-Star Problem," Operations Research, INFORMS, vol. 55(6), pages 1147-1162, December.
    11. Nagy, Gabor & Salhi, Said, 2007. "Location-routing: Issues, models and methods," European Journal of Operational Research, Elsevier, vol. 177(2), pages 649-672, March.
    12. Xujin Chen & Xiaodong Hu & Xiaohua Jia & Zhongzheng Tang & Chenhao Wang & Ying Zhang, 2021. "Algorithms for the metric ring star problem with fixed edge-cost ratio," Journal of Combinatorial Optimization, Springer, vol. 42(3), pages 499-523, October.
    13. Senay Solak & Christina Scherrer & Ahmed Ghoniem, 2014. "The stop-and-drop problem in nonprofit food distribution networks," Annals of Operations Research, Springer, vol. 221(1), pages 407-426, October.
    14. Alexander Jungwirth & Guy Desaulniers & Markus Frey & Rainer Kolisch, 2022. "Exact Branch-Price-and-Cut for a Hospital Therapist Scheduling Problem with Flexible Service Locations and Time-Dependent Location Capacity," INFORMS Journal on Computing, INFORMS, vol. 34(2), pages 1157-1175, March.
    15. L Vogt & C A Poojari & J E Beasley, 2007. "A tabu search algorithm for the single vehicle routing allocation problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(4), pages 467-480, April.
    16. Veenstra, Marjolein & Roodbergen, Kees Jan & Coelho, Leandro C. & Zhu, Stuart X., 2018. "A simultaneous facility location and vehicle routing problem arising in health care logistics in the Netherlands," European Journal of Operational Research, Elsevier, vol. 268(2), pages 703-715.

  29. Beasley, J. E. & Chu, P. C., 1996. "A genetic algorithm for the set covering problem," European Journal of Operational Research, Elsevier, vol. 94(2), pages 392-404, October.

    Cited by:

    1. Grossman, Tal & Wool, Avishai, 1997. "Computational experience with approximation algorithms for the set covering problem," European Journal of Operational Research, Elsevier, vol. 101(1), pages 81-92, August.
    2. Maenhout, Broos & Vanhoucke, Mario, 2010. "A hybrid scatter search heuristic for personalized crew rostering in the airline industry," European Journal of Operational Research, Elsevier, vol. 206(1), pages 155-167, October.
    3. Yourim Yoon & Yong-Hyuk Kim, 2020. "Gene-Similarity Normalization in a Genetic Algorithm for the Maximum k -Coverage Problem," Mathematics, MDPI, vol. 8(4), pages 1-16, April.
    4. Coslovich, Luca & Pesenti, Raffaele & Ukovich, Walter, 2006. "Minimizing fleet operating costs for a container transportation company," European Journal of Operational Research, Elsevier, vol. 171(3), pages 776-786, June.
    5. Alexouda, Georgia & Paparrizos, Konstantinos, 2001. "A genetic algorithm approach to the product line design problem using the seller's return criterion: An extensive comparative computational study," European Journal of Operational Research, Elsevier, vol. 134(1), pages 165-178, October.
    6. Naji-Azimi, Zahra & Toth, Paolo & Galli, Laura, 2010. "An electromagnetism metaheuristic for the unicost set covering problem," European Journal of Operational Research, Elsevier, vol. 205(2), pages 290-300, September.
    7. He, Shiwei & Song, Rui & Chaudhry, Sohail S., 2000. "Fuzzy dispatching model and genetic algorithms for railyards operations," European Journal of Operational Research, Elsevier, vol. 124(2), pages 307-331, July.
    8. F J Vasko & P J Knolle & D S Spiegel, 2005. "An empirical study of hybrid genetic algorithms for the set covering problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(10), pages 1213-1223, October.
    9. Gao, Chao & Yao, Xin & Weise, Thomas & Li, Jinlong, 2015. "An efficient local search heuristic with row weighting for the unicost set covering problem," European Journal of Operational Research, Elsevier, vol. 246(3), pages 750-761.
    10. Francesco Di Maio & Samuele Baronchelli & Enrico Zio, 2015. "A Computational Framework for Prime Implicants Identification in Noncoherent Dynamic Systems," Risk Analysis, John Wiley & Sons, vol. 35(1), pages 142-156, January.
    11. Bautista, Joaquín & Pereira, Jordi, 2006. "Modeling the problem of locating collection areas for urban waste management. An application to the metropolitan area of Barcelona," Omega, Elsevier, vol. 34(6), pages 617-629, December.
    12. Rita Portugal & Helena Ramalhinho-Lourenço & José P. Paixao, 2006. "Driver scheduling problem modelling," Economics Working Papers 991, Department of Economics and Business, Universitat Pompeu Fabra.
    13. Helena R. Lourenço & José P. Paixão & Rita Portugal, 2001. "Multiobjective Metaheuristics for the Bus Driver Scheduling Problem," Transportation Science, INFORMS, vol. 35(3), pages 331-343, August.
    14. Amir Khakbaz & Ali Nookabadi & S. Shetab-bushehri, 2013. "A Model for Locating Park-and-Ride Facilities on Urban Networks Based on Maximizing Flow Capture: A Case Study of Isfahan, Iran," Networks and Spatial Economics, Springer, vol. 13(1), pages 43-66, March.
    15. Patrizia Beraldi & Andrzej Ruszczyński, 2002. "The Probabilistic Set-Covering Problem," Operations Research, INFORMS, vol. 50(6), pages 956-967, December.
    16. José García & Gino Astorga & Víctor Yepes, 2021. "An Analysis of a KNN Perturbation Operator: An Application to the Binarization of Continuous Metaheuristics," Mathematics, MDPI, vol. 9(3), pages 1-20, January.
    17. Helena Ramalhinho-Lourenço & José Pinto & Rita Portugal, 1998. "Metaheuristics for the bus-driver scheduling problem," Economics Working Papers 304, Department of Economics and Business, Universitat Pompeu Fabra.
    18. Beasley, J. E., 2004. "A population heuristic for constrained two-dimensional non-guillotine cutting," European Journal of Operational Research, Elsevier, vol. 156(3), pages 601-627, August.
    19. Lingping Kong & Jeng-Shyang Pan & Václav Snášel & Pei-Wei Tsai & Tien-Wen Sung, 2018. "An energy-aware routing protocol for wireless sensor network based on genetic algorithm," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 67(3), pages 451-463, March.
    20. Cochran, Jeffery K. & Marquez Uribe, Alberto, 2005. "A set covering formulation for agile capacity planning within supply chains," International Journal of Production Economics, Elsevier, vol. 95(2), pages 139-149, February.
    21. Meixian Jiang & Jiajia Feng & Jian Zhou & Lin Zhou & Fangzheng Ma & Guanghua Wu & Yuqiu Zhang, 2023. "Multi-Terminal Berth and Quay Crane Joint Scheduling in Container Ports Considering Carbon Cost," Sustainability, MDPI, vol. 15(6), pages 1-20, March.
    22. Cunha, Claudio B. & Silva, Marcos Roberto, 2007. "A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil," European Journal of Operational Research, Elsevier, vol. 179(3), pages 747-758, June.
    23. Irnich, Stefan, 2000. "A multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles," European Journal of Operational Research, Elsevier, vol. 122(2), pages 310-328, April.
    24. Zhengyu Ma & Hong Seo Ryoo, 2021. "Spherical Classification of Data, a New Rule-Based Learning Method," Journal of Classification, Springer;The Classification Society, vol. 38(1), pages 44-71, April.
    25. Sabrina De Nardi & Claudio Carnevale & Sara Raccagni & Lucia Sangiorgi, 2024. "Data-Driven Models to Forecast the Impact of Temperature Anomalies on Rice Production in Southeast Asia," Forecasting, MDPI, vol. 6(1), pages 1-15, January.
    26. Jans, Raf & Degraeve, Zeger, 2008. "A note on a symmetrical set covering problem: The lottery problem," European Journal of Operational Research, Elsevier, vol. 186(1), pages 104-110, April.
    27. Jordi Pereira & Igor Averbakh, 2013. "The Robust Set Covering Problem with interval data," Annals of Operations Research, Springer, vol. 207(1), pages 217-235, August.
    28. Csondes, Tibor & Kotnyek, Balazs & Zoltan Szabo, Janos, 2002. "Application of heuristic methods for conformance test selection," European Journal of Operational Research, Elsevier, vol. 142(1), pages 203-218, October.
    29. Rudabeh Meskarian & Marion L Penn & Sarah Williams & Thomas Monks, 2017. "A facility location model for analysis of current and future demand for sexual health services," PLOS ONE, Public Library of Science, vol. 12(8), pages 1-18, August.
    30. Sachchida Nand Chaurasia & Shyam Sundar & Alok Singh, 2017. "Hybrid metaheuristic approaches for the single machine total stepwise tardiness problem with release dates," Operational Research, Springer, vol. 17(1), pages 275-295, April.
    31. Xueping Li & Zhaoxia Zhao & Xiaoyan Zhu & Tami Wyatt, 2011. "Covering models and optimization techniques for emergency response facility location and planning: a review," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 74(3), pages 281-310, December.
    32. Andrés Felipe Pérez Posada & Juan G. Villegas & Jesús M. López-Lezama, 2017. "A Scatter Search Heuristic for the Optimal Location, Sizing and Contract Pricing of Distributed Generation in Electric Distribution Systems," Energies, MDPI, vol. 10(10), pages 1-16, September.
    33. Rajagopalan, Hari K. & Vergara, F. Elizabeth & Saydam, Cem & Xiao, Jing, 2007. "Developing effective meta-heuristics for a probabilistic location model via experimental design," European Journal of Operational Research, Elsevier, vol. 177(1), pages 83-101, February.
    34. Singh, Kavita & Sundar, Shyam, 2019. "A hybrid steady-state genetic algorithm for the min-degree constrained minimum spanning tree problem," European Journal of Operational Research, Elsevier, vol. 276(1), pages 88-105.
    35. Lan, Guanghui & DePuy, Gail W. & Whitehouse, Gary E., 2007. "An effective and simple heuristic for the set covering problem," European Journal of Operational Research, Elsevier, vol. 176(3), pages 1387-1403, February.
    36. Li, Gang & Jiang, Hongxun & He, Tian, 2015. "A genetic algorithm-based decomposition approach to solve an integrated equipment-workforce-service planning problem," Omega, Elsevier, vol. 50(C), pages 1-17.
    37. Fernando Lepe-Silva & Broderick Crawford & Felipe Cisternas-Caneo & José Barrera-Garcia & Ricardo Soto, 2024. "A Binary Chaotic White Shark Optimizer," Mathematics, MDPI, vol. 12(20), pages 1-35, October.
    38. Nguyen, Tri-Dung, 2014. "A fast approximation algorithm for solving the complete set packing problem," European Journal of Operational Research, Elsevier, vol. 237(1), pages 62-70.
    39. Victor Reyes & Ignacio Araya, 2021. "A GRASP-based scheme for the set covering problem," Operational Research, Springer, vol. 21(4), pages 2391-2408, December.
    40. Xiaoyun Xiong & Peng Zhou & Yunqiang Yin & T. C. E. Cheng & Dengfeng Li, 2019. "An exact branch‐and‐price algorithm for multitasking scheduling on unrelated parallel machines," Naval Research Logistics (NRL), John Wiley & Sons, vol. 66(6), pages 502-516, September.
    41. Vazifeh, Mohammad M. & Zhang, Hongmou & Santi, Paolo & Ratti, Carlo, 2019. "Optimizing the deployment of electric vehicle charging stations using pervasive mobility data," Transportation Research Part A: Policy and Practice, Elsevier, vol. 121(C), pages 75-91.
    42. Mohamed Kashkoush & Hoda ElMaraghy, 2017. "An integer programming model for discovering associations between manufacturing system capabilities and product features," Journal of Intelligent Manufacturing, Springer, vol. 28(4), pages 1031-1044, April.
    43. Luis Fernando Grisales-Noreña & Brandon Cortés-Caicedo & Gerardo Alcalá & Oscar Danilo Montoya, 2023. "Applying the Crow Search Algorithm for the Optimal Integration of PV Generation Units in DC Networks," Mathematics, MDPI, vol. 11(2), pages 1-18, January.
    44. Helena Ramalhinho-Lourenço, 2001. "The crew-scheduling module in the GIST system," Economics Working Papers 547, Department of Economics and Business, Universitat Pompeu Fabra.
    45. Chunyan Liu & Hejiao Huang & Hongwei Du & Xiaohua Jia, 2017. "Optimal RSUs placement with delay bounded message dissemination in vehicular networks," Journal of Combinatorial Optimization, Springer, vol. 33(4), pages 1276-1299, May.
    46. Cihan Çetinkaya & Samer Haffar, 2018. "A Risk-Based Location-Allocation Approach for Weapon Logistics," Logistics, MDPI, vol. 2(2), pages 1-15, May.
    47. Vié, Marie-Sklaerder & Zufferey, Nicolas & Cordeau, Jean-François, 2019. "Solving the Wire-Harness Design Problem at a European car manufacturer," European Journal of Operational Research, Elsevier, vol. 272(2), pages 712-724.
    48. Geroliminis, Nikolas & Kepaptsoglou, Konstantinos & Karlaftis, Matthew G., 2011. "A hybrid hypercube - Genetic algorithm approach for deploying many emergency response mobile units in an urban network," European Journal of Operational Research, Elsevier, vol. 210(2), pages 287-300, April.
    49. 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.
    50. Koutras, M. V. & Tsitmidelis, S. & Zissimopoulos, V., 2003. "Evaluation of reliability bounds by set covering models," Statistics & Probability Letters, Elsevier, vol. 61(2), pages 163-175, January.
    51. Brandon Cortés-Caicedo & Luis Fernando Grisales-Noreña & Oscar Danilo Montoya & Miguel-Angel Perea-Moreno & Alberto-Jesus Perea-Moreno, 2022. "Optimal Location and Sizing of PV Generation Units in Electrical Networks to Reduce the Total Annual Operating Costs: An Application of the Crow Search Algorithm," Mathematics, MDPI, vol. 10(20), pages 1-22, October.
    52. Wang, Yiyuan & Pan, Shiwei & Al-Shihabi, Sameh & Zhou, Junping & Yang, Nan & Yin, Minghao, 2021. "An improved configuration checking-based algorithm for the unicost set covering problem," European Journal of Operational Research, Elsevier, vol. 294(2), pages 476-491.
    53. Ibrahim, Walid & El-Sayed, Hesham & El-Chouemie, Amr & Amer, Hoda, 2009. "An adaptive heuristic algorithm for VLSI test vectors selection," European Journal of Operational Research, Elsevier, vol. 199(3), pages 630-639, December.
    54. Abdullah Alshehri & Mahmoud Owais & Jayadev Gyani & Mishal H. Aljarbou & Saleh Alsulamy, 2023. "Residual Neural Networks for Origin–Destination Trip Matrix Estimation from Traffic Sensor Information," Sustainability, MDPI, vol. 15(13), pages 1-21, June.
    55. Di Maio, Francesco & Baronchelli, Samuele & Zio, Enrico, 2014. "Hierarchical differential evolution for minimal cut sets identification: Application to nuclear safety systems," European Journal of Operational Research, Elsevier, vol. 238(2), pages 645-652.
    56. 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.
    57. Masoud Yaghini & Mohammad Karimi & Mohadeseh Rahbar, 2015. "A set covering approach for multi-depot train driver scheduling," Journal of Combinatorial Optimization, Springer, vol. 29(3), pages 636-654, April.
    58. Maenhout, Broos & Vanhoucke, Mario, 2018. "A perturbation matheuristic for the integrated personnel shift and task re-scheduling problem," European Journal of Operational Research, Elsevier, vol. 269(3), pages 806-823.
    59. Youngho Lee & Hanif D. Sherali & Ikhyun Kwon & Seongin Kim, 2006. "A new reformulation approach for the generalized partial covering problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 53(2), pages 170-179, March.
    60. Carvajal, Jimmy & Castaño, Fabian & Sarache, William & Costa, Yasel, 2020. "Heuristic approaches for a two-echelon constrained joint replenishment and delivery problem," International Journal of Production Economics, Elsevier, vol. 220(C).
    61. Mhand Hifi & Slim Sadfi & Abdelkader Sbihi, 2004. "An Exact Algorithm for the Multiple-choice Multidimensional Knapsack Problem," Post-Print halshs-03322716, HAL.
    62. Owais, Mahmoud & Moussa, Ghada S. & Hussain, Khaled F., 2019. "Sensor location model for O/D estimation: Multi-criteria meta-heuristics approach," Operations Research Perspectives, Elsevier, vol. 6(C).
    63. Zhou, Gengui & Min, Hokey & Gen, Mitsuo, 2003. "A genetic algorithm approach to the bi-criteria allocation of customers to warehouses," International Journal of Production Economics, Elsevier, vol. 86(1), pages 35-45, October.
    64. Ran Wei & Alan Murray & Rajan Batta, 2014. "A bounding-based solution approach for the continuous arc covering problem," Journal of Geographical Systems, Springer, vol. 16(2), pages 161-182, April.
    65. Aytug, Haldun & Saydam, Cem, 2002. "Solving large-scale maximum expected covering location problems by genetic algorithms: A comparative study," European Journal of Operational Research, Elsevier, vol. 141(3), pages 480-494, September.
    66. Saydam, Cem & Aytug, Haldun, 2003. "Accurate estimation of expected coverage: revisited," Socio-Economic Planning Sciences, Elsevier, vol. 37(1), pages 69-80, March.
    67. Chih-Wei Lin & Yu Hong & Weihao Tu & Jinfu Liu, 2022. "Multiperiod Dynamic Programming Algorithm for Optimizing a Nature Reserve," Sustainability, MDPI, vol. 14(6), pages 1-17, March.
    68. Seona Lee & Sang-Ho Lee & HyungJune Lee, 2020. "Timely directional data delivery to multiple destinations through relay population control in vehicular ad hoc network," International Journal of Distributed Sensor Networks, , vol. 16(5), pages 15501477209, May.
    69. Mhand Hifi & Slim Sadfi & Abdelkader Sbihi, 2004. "An Exact Algorithm for the Multiple-choice Multidimensional Knapsack Problem," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-03322716, HAL.
    70. Hertz, Alain & Kobler, Daniel, 2000. "A framework for the description of evolutionary algorithms," European Journal of Operational Research, Elsevier, vol. 126(1), pages 1-12, October.
    71. P A Huegler & F J Vasko, 2007. "Metaheuristics for meltshop scheduling in the steel industry," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(6), pages 791-796, June.

  30. Beasley, J. E., 1993. "Lagrangean heuristics for location problems," European Journal of Operational Research, Elsevier, vol. 65(3), pages 383-399, March.

    Cited by:

    1. Holmberg, Kaj & Ronnqvist, Mikael & Yuan, Di, 1999. "An exact algorithm for the capacitated facility location problems with single sourcing," European Journal of Operational Research, Elsevier, vol. 113(3), pages 544-559, March.
    2. Kenneth Carling & Xiangli Meng, 2015. "Confidence in heuristic solutions?," Journal of Global Optimization, Springer, vol. 63(2), pages 381-399, October.
    3. Klose, Andreas & Gortz, Simon, 2007. "A branch-and-price algorithm for the capacitated facility location problem," European Journal of Operational Research, Elsevier, vol. 179(3), pages 1109-1125, June.
    4. Resende, Mauricio G.C. & Werneck, Renato F., 2006. "A hybrid multistart heuristic for the uncapacitated facility location problem," European Journal of Operational Research, Elsevier, vol. 174(1), pages 54-68, October.
    5. 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.
    6. J Brimberg & N Mladenovic & S Salhi, 2004. "The multi-source Weber problem with constant opening cost," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(6), pages 640-646, June.
    7. Zhizhu Lai & Qun Yue & Zheng Wang & Dongmei Ge & Yulong Chen & Zhihong Zhou, 2022. "The min-p robust optimization approach for facility location problem under uncertainty," Journal of Combinatorial Optimization, Springer, vol. 44(2), pages 1134-1160, September.
    8. Christian Prins & Caroline Prodhon & Angel Ruiz & Patrick Soriano & Roberto Wolfler Calvo, 2007. "Solving the Capacitated Location-Routing Problem by a Cooperative Lagrangean Relaxation-Granular Tabu Search Heuristic," Transportation Science, INFORMS, vol. 41(4), pages 470-483, November.
    9. B Goldengorin & J Keane & V Kuzmenko & M K-S Tso, 2011. "Optimal supplier choice with discounting," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(4), pages 690-699, April.
    10. Nanda Piersma, 1999. "A Probabilistic Analysis of the Capacitated Facility Location Problem," Journal of Combinatorial Optimization, Springer, vol. 3(1), pages 31-50, July.
    11. Samir Elhedhli & Jean-Louis Goffin, 2005. "Efficient Production-Distribution System Design," Management Science, INFORMS, vol. 51(7), pages 1151-1164, July.
    12. 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.
    13. Klose, Andreas, 2000. "A Lagrangean relax-and-cut approach for the two-stage capacitated facility location problem," European Journal of Operational Research, Elsevier, vol. 126(2), pages 408-421, October.
    14. Kenneth Carling & Xiangli Meng, 2016. "On statistical bounds of heuristic solutions to location problems," Journal of Combinatorial Optimization, Springer, vol. 31(4), pages 1518-1549, May.
    15. H K Smith & G Laporte & P R Harper, 2009. "Locational analysis: highlights of growth to maturity," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 140-148, May.
    16. Büther, Marcel, 2008. "Beam search for the elastic generalized assignment problem," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 634, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    17. Zainuddin, Z.M. & Salhi, S., 2007. "A perturbation-based heuristic for the capacitated multisource Weber problem," European Journal of Operational Research, Elsevier, vol. 179(3), pages 1194-1207, June.
    18. Oded Berman & Rongbing Huang, 2007. "The Minisum Multipurpose Trip Location Problem on Networks," Transportation Science, INFORMS, vol. 41(4), pages 500-515, November.
    19. Holmberg, Kaj, 1999. "Exact solution methods for uncapacitated location problems with convex transportation costs," European Journal of Operational Research, Elsevier, vol. 114(1), pages 127-140, April.
    20. M Caserta & E Quiñonez Rico, 2009. "A cross entropy-based metaheuristic algorithm for large-scale capacitated facility location problems," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(10), pages 1439-1448, October.
    21. Minghe Sun & Zhen-Yu Chen & Zhi-Ping Fan, 2014. "A Multi-task Multi-kernel Transfer Learning Method for Customer Response Modeling in Social Media," Working Papers 0161mss, College of Business, University of Texas at San Antonio.
    22. 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.
    23. R. K. Ahuja & J. B. Orlin & S. Pallottino & M. P. Scaparra & M. G. Scutellà, 2004. "A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem," Management Science, INFORMS, vol. 50(6), pages 749-760, June.
    24. Drexl, Andreas & Klose, Andreas, 2001. "Facility location models for distribution system design," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 546, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    25. Sanjay Dominik Jena & Jean-François Cordeau & Bernard Gendron, 2017. "Lagrangian Heuristics for Large-Scale Dynamic Facility Location with Generalized Modular Capacities," INFORMS Journal on Computing, INFORMS, vol. 29(3), pages 388-404, August.
    26. Goldengorin, Boris & Sierksma, Gerard & Tijssen, Gert A., 1998. "The data-correcting algorithm for supermodular functions, with applications to quadratic cost partition and simple plant location problems," Research Report 98A08, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
    27. Zeinal Hamadani, Ali & Abouei Ardakan, Mostafa & Rezvan, Taghi & Honarmandian, Mohammad Mehran, 2013. "Location-allocation problem for intra-transportation system in a big company by using meta-heuristic algorithm," Socio-Economic Planning Sciences, Elsevier, vol. 47(4), pages 309-317.
    28. Olivier Briant & Denis Naddef, 2004. "The Optimal Diversity Management Problem," Operations Research, INFORMS, vol. 52(4), pages 515-526, August.
    29. 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.
    30. Letchford, Adam N. & Miller, Sebastian J., 2014. "An aggressive reduction scheme for the simple plant location problem," European Journal of Operational Research, Elsevier, vol. 234(3), pages 674-682.
    31. Grolimund, Stephan & Ganascia, Jean-Gabriel, 1997. "Driving Tabu Search with case-based reasoning," European Journal of Operational Research, Elsevier, vol. 103(2), pages 326-338, December.
    32. 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.
    33. Goldengorin, Boris, 2009. "Maximization of submodular functions: Theory and enumeration algorithms," European Journal of Operational Research, Elsevier, vol. 198(1), pages 102-112, October.
    34. Klaus Büdenbender & Tore Grünert & Hans-Jürgen Sebastian, 2000. "A Hybrid Tabu Search/Branch-and-Bound Algorithm for the Direct Flight Network Design Problem," Transportation Science, INFORMS, vol. 34(4), pages 364-380, November.
    35. Rajagopalan, Hari K. & Vergara, F. Elizabeth & Saydam, Cem & Xiao, Jing, 2007. "Developing effective meta-heuristics for a probabilistic location model via experimental design," European Journal of Operational Research, Elsevier, vol. 177(1), pages 83-101, February.
    36. Goldengorin, Boris & Ghosh, Diptesh, 2004. "A Multilevel Search Algorithm for the Maximization of Submodular Functions," Research Report 04A20, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
    37. 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.
    38. 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.
    39. Holmberg, Kaj & Ling, Jonas, 1997. "A Lagrangean heuristic for the facility location problem with staircase costs," European Journal of Operational Research, Elsevier, vol. 97(1), pages 63-74, February.
    40. Sheu, Jiuh Biing & Kundu, Tanmoy, 2018. "Forecasting time-varying logistics distribution flows in the One Belt-One Road strategic context," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 117(C), pages 5-22.
    41. Mladenovic, Nenad & Brimberg, Jack & Hansen, Pierre & Moreno-Perez, Jose A., 2007. "The p-median problem: A survey of metaheuristic approaches," European Journal of Operational Research, Elsevier, vol. 179(3), pages 927-939, June.
    42. J. Brimberg & S. Salhi, 2005. "A Continuous Location-Allocation Problem with Zone-Dependent Fixed Cost," Annals of Operations Research, Springer, vol. 136(1), pages 99-115, April.
    43. 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.
    44. H Küçükaydın & N Aras & İ K Altınel, 2011. "A discrete competitive facility location model with variable attractiveness," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(9), pages 1726-1741, September.
    45. Sakawa, Masatoshi & Nishizaki, Ichiro & Uemura, Yoshio, 2001. "Fuzzy programming and profit and cost allocation for a production and transportation problem," European Journal of Operational Research, Elsevier, vol. 131(1), pages 1-15, May.
    46. Saïd Hanafi & Raca Todosijević, 2017. "Mathematical programming based heuristics for the 0–1 MIP: a survey," Journal of Heuristics, Springer, vol. 23(4), pages 165-206, August.
    47. Goldengorin, Boris & Ghosh, Diptesh & Sierksma, Gerard, 2001. "Branch and peg algorithms for the simple plant location problem," Research Report 01A14, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
    48. Boris Goldengorin & Gerard Sierksma & Gert A. Tijssen & Michael Tso, 1999. "The Data-Correcting Algorithm for the Minimization of Supermodular Functions," Management Science, INFORMS, vol. 45(11), pages 1539-1551, November.
    49. 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.
    50. Goldengorin, Boris & Tijssen, Gert A. & Tso, Michael, 1999. "The maximization of submodular functions : old and new proofs for the correctness of the dichotomy algorithm," Research Report 99A17, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
    51. Cortinhal, Maria Joao & Captivo, Maria Eugenia, 2003. "Upper and lower bounds for the single source capacitated location problem," European Journal of Operational Research, Elsevier, vol. 151(2), pages 333-351, December.
    52. Klose, Andreas & Drexl, Andreas, 2005. "Facility location models for distribution system design," European Journal of Operational Research, Elsevier, vol. 162(1), pages 4-29, April.
    53. Colmenar, J. Manuel & Greistorfer, Peter & Martí, Rafael & Duarte, Abraham, 2016. "Advanced Greedy Randomized Adaptive Search Procedure for the Obnoxious p-Median problem," European Journal of Operational Research, Elsevier, vol. 252(2), pages 432-442.
    54. Wang, Shaojun & Sarker, Bhaba R. & Mann, Lawrence & Triantaphyllou, Evangelos, 2004. "Resource planning and a depot location model for electric power restoration," European Journal of Operational Research, Elsevier, vol. 155(1), pages 22-43, May.
    55. Torbjörn Larsson & Nils-Hassan Quttineh & Ida Åkerholm, 2024. "A Lagrangian bounding and heuristic principle for bi-objective discrete optimization," Operational Research, Springer, vol. 24(2), pages 1-34, June.
    56. Monabbati, Ehsan & Kakhki, Hossein Taghizadeh, 2015. "On a class of subadditive duals for the uncapacitated facility location problem," Applied Mathematics and Computation, Elsevier, vol. 251(C), pages 118-131.
    57. Marco Antonio Boschetti & Vittorio Maniezzo, 2022. "Matheuristics: using mathematics for heuristic design," 4OR, Springer, vol. 20(2), pages 173-208, June.
    58. 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.
    59. Ronnqvist, Mikael & Tragantalerngsak, Suda & Holt, John, 1999. "A repeated matching heuristic for the single-source capacitated facility location problem," European Journal of Operational Research, Elsevier, vol. 116(1), pages 51-68, July.
    60. Yang, Zhen & Chu, Feng & Chen, Haoxun, 2012. "A cut-and-solve based algorithm for the single-source capacitated facility location problem," European Journal of Operational Research, Elsevier, vol. 221(3), pages 521-532.
    61. van der Gaast, J.P. & Rietveld, C.A. & Gabor, A.F. & Zhang, Y., 2011. "A Local Search Algorithm for Clustering in Software as a Service Networks," ERIM Report Series Research in Management ERS-2011-004-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.
    62. Iván Contreras & Juan Díaz, 2008. "Scatter search for the single source capacitated facility location problem," Annals of Operations Research, Springer, vol. 157(1), pages 73-89, January.
    63. Goldengorin, Boris, 2001. "Solving the simple plant location problem using a data correcting approach," Research Report 01A53, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
    64. 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.
    65. 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.
    66. Kouhei Harada, 2021. "A Feasibility-Ensured Lagrangian Heuristic for General Decomposable Problems," SN Operations Research Forum, Springer, vol. 2(4), pages 1-26, December.
    67. Minghe Sun, 2008. "A Tabu Search Heuristic Procedure for the Capacitated Facility Location Problem," Working Papers 0050, College of Business, University of Texas at San Antonio.

  31. Beasley, J. E. & Jornsten, K., 1992. "Enhancing an algorithm for set covering problems," European Journal of Operational Research, Elsevier, vol. 58(2), pages 293-300, April.

    Cited by:

    1. Larry W. Jacobs & Michael J. Brusco, 1995. "Note: A local‐search heuristic for large set‐covering problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 42(7), pages 1129-1140, October.
    2. Ferdinando Pezzella & Enrico Faggioli, 1997. "Solving large set covering problems for crew scheduling," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 5(1), pages 41-59, June.
    3. Andreas M. Tillmann, 2019. "Computing the spark: mixed-integer programming for the (vector) matroid girth problem," Computational Optimization and Applications, Springer, vol. 74(2), pages 387-441, November.
    4. Gao, Chao & Yao, Xin & Weise, Thomas & Li, Jinlong, 2015. "An efficient local search heuristic with row weighting for the unicost set covering problem," European Journal of Operational Research, Elsevier, vol. 246(3), pages 750-761.
    5. Bautista, Joaquín & Pereira, Jordi, 2006. "Modeling the problem of locating collection areas for urban waste management. An application to the metropolitan area of Barcelona," Omega, Elsevier, vol. 34(6), pages 617-629, December.
    6. José Lemus-Romani & Marcelo Becerra-Rozas & Broderick Crawford & Ricardo Soto & Felipe Cisternas-Caneo & Emanuel Vega & Mauricio Castillo & Diego Tapia & Gino Astorga & Wenceslao Palma & Carlos Castro, 2021. "A Novel Learning-Based Binarization Scheme Selector for Swarm Algorithms Solving Combinatorial Problems," Mathematics, MDPI, vol. 9(22), pages 1-41, November.
    7. Beasley, J. E. & Chu, P. C., 1996. "A genetic algorithm for the set covering problem," European Journal of Operational Research, Elsevier, vol. 94(2), pages 392-404, October.
    8. 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.
    9. Patrizia Beraldi & Andrzej Ruszczyński, 2002. "The Probabilistic Set-Covering Problem," Operations Research, INFORMS, vol. 50(6), pages 956-967, December.
    10. Irnich, Stefan, 2000. "A multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles," European Journal of Operational Research, Elsevier, vol. 122(2), pages 310-328, April.
    11. Lawrence Bodin & Aristide Mingozzi & Roberto Baldacci & Michael Ball, 2000. "The Rollon–Rolloff Vehicle Routing Problem," Transportation Science, INFORMS, vol. 34(3), pages 271-288, August.
    12. Lan, Guanghui & DePuy, Gail W. & Whitehouse, Gary E., 2007. "An effective and simple heuristic for the set covering problem," European Journal of Operational Research, Elsevier, vol. 176(3), pages 1387-1403, February.
    13. Bergantiños, Gustavo & Gómez-Rúa, María & Llorca, Natividad & Pulido, Manuel & Sánchez-Soriano, Joaquin, 2019. "Allocating costs in set covering problems," MPRA Paper 92659, University Library of Munich, Germany.
    14. Nguyen, Tri-Dung, 2014. "A fast approximation algorithm for solving the complete set packing problem," European Journal of Operational Research, Elsevier, vol. 237(1), pages 62-70.
    15. Mehdi Firoozbakht & Hamidreza Vosoughifar & Alireza Ghari Ghoran, 2019. "Coverage intensity of optimal sensors for common, isolated, and integrated steel structures using novel approach of FEM-MAC-TTFD," International Journal of Distributed Sensor Networks, , vol. 15(8), pages 15501477198, August.
    16. S. Haddadi, 2017. "Benders decomposition for set covering problems," Journal of Combinatorial Optimization, Springer, vol. 33(1), pages 60-80, January.
    17. 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.
    18. Marcelo Becerra-Rozas & Felipe Cisternas-Caneo & Broderick Crawford & Ricardo Soto & José García & Gino Astorga & Wenceslao Palma, 2022. "Embedded Learning Approaches in the Whale Optimizer to Solve Coverage Combinatorial Problems," Mathematics, MDPI, vol. 10(23), pages 1-18, November.
    19. Wang, Yiyuan & Pan, Shiwei & Al-Shihabi, Sameh & Zhou, Junping & Yang, Nan & Yin, Minghao, 2021. "An improved configuration checking-based algorithm for the unicost set covering problem," European Journal of Operational Research, Elsevier, vol. 294(2), pages 476-491.
    20. 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.
    21. Marcelo Becerra-Rozas & José Lemus-Romani & Felipe Cisternas-Caneo & Broderick Crawford & Ricardo Soto & José García, 2022. "Swarm-Inspired Computing to Solve Binary Optimization Problems: A Backward Q-Learning Binarization Scheme Selector," Mathematics, MDPI, vol. 10(24), pages 1-30, December.
    22. Haddadi, Salim, 1997. "Simple Lagrangian heuristic for the set covering problem," European Journal of Operational Research, Elsevier, vol. 97(1), pages 200-204, February.

  32. Beasley, J. E., 1992. "A heuristic for Euclidean and rectilinear Steiner problems," European Journal of Operational Research, Elsevier, vol. 58(2), pages 284-292, April.

    Cited by:

    1. Renan Vicente Pinto & Nelson Maculan, 2023. "A new heuristic for the Euclidean Steiner Tree Problem in $${\mathbb {R}}^n$$ R n," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 31(2), pages 391-413, July.
    2. Zachariasen, Martin, 1999. "Local search for the Steiner tree problem in the Euclidean plane," European Journal of Operational Research, Elsevier, vol. 119(2), pages 282-300, December.
    3. Y.Y. Li & K.S. Leung & C.K. Wong, 2000. "Efficient Heuristics for Orientation Metric and Euclidean Steiner Tree Problems," Journal of Combinatorial Optimization, Springer, vol. 4(1), pages 79-98, March.
    4. Belarmino Adenso-Díaz & Manuel Laguna, 2006. "Fine-Tuning of Algorithms Using Fractional Experimental Designs and Local Search," Operations Research, INFORMS, vol. 54(1), pages 99-114, February.

  33. 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.

    Cited by:

    1. Kroon, L.G. & Fischetti, M., 2000. "Crew Scheduling for Netherlands Railways: "destination: customer"," ERIM Report Series Research in Management ERS-2000-56-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.
    2. Lu Yang & Leishan Zhou & Hanxiao Zhou & Chang Han & Wenqiang Zhao, 2023. "A Lagrangian Method for Calculation of Passing Capacity on a Railway Hub Station," Mathematics, MDPI, vol. 11(6), pages 1-20, March.
    3. Amadeu A. Coco & Andréa Cynthia Santos & Thiago F. Noronha, 2022. "Robust min-max regret covering problems," Computational Optimization and Applications, Springer, vol. 83(1), pages 111-141, September.
    4. Patrizia Beraldi & Andrzej Ruszczyński, 2002. "The Probabilistic Set-Covering Problem," Operations Research, INFORMS, vol. 50(6), pages 956-967, December.
    5. Olli Bräysy & Michel Gendreau, 2005. "Vehicle Routing Problem with Time Windows, Part II: Metaheuristics," Transportation Science, INFORMS, vol. 39(1), pages 119-139, February.
    6. M. Almiñana & J. Pastor, 1994. "Two new heuristics for the location set covering problem," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 2(2), pages 315-328, December.
    7. Sven de Vries & Rakesh Vohra, 2000. "Combinatorial Auctions: A Survey," Discussion Papers 1296, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    8. 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.
    9. Renata Mansini & Roberto Zanotti, 2020. "A Core-Based Exact Algorithm for the Multidimensional Multiple Choice Knapsack Problem," INFORMS Journal on Computing, INFORMS, vol. 32(4), pages 1061-1079, October.
    10. Olli Bräysy & Michel Gendreau, 2002. "Tabu Search heuristics for the Vehicle Routing Problem with Time Windows," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 10(2), pages 211-237, December.
    11. Vié, Marie-Sklaerder & Zufferey, Nicolas & Cordeau, Jean-François, 2019. "Solving the Wire-Harness Design Problem at a European car manufacturer," European Journal of Operational Research, Elsevier, vol. 272(2), pages 712-724.
    12. Wang, Yiyuan & Pan, Shiwei & Al-Shihabi, Sameh & Zhou, Junping & Yang, Nan & Yin, Minghao, 2021. "An improved configuration checking-based algorithm for the unicost set covering problem," European Journal of Operational Research, Elsevier, vol. 294(2), pages 476-491.
    13. 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.

  34. Beasley, J. E., 1990. "Comparing university departments," Omega, Elsevier, vol. 18(2), pages 171-183.

    Cited by:

    1. Toloo, Mehdi, 2009. "On classifying inputs and outputs in DEA: A revised model," European Journal of Operational Research, Elsevier, vol. 198(1), pages 358-360, October.
    2. Kristof de Witte & Laura López-Torres, 2015. "Efficiency in Education. A Review of Literature and a Way Forward," Working Papers 1501, Departament Empresa, Universitat Autònoma de Barcelona, revised Apr 2015.
    3. Francisco Pedraja & Javier Salinas & Peter Smith, 1994. "La restricción de las ponderaciones en el análisis envolvente de datos: una fórmula para mejorar la evaluación de la eficiencia," Investigaciones Economicas, Fundación SEPI, vol. 18(2), pages 365-380, May.
    4. Lehmann, Erik E. & Meoli, Michele & Paleari, Stefano & Stockinger, Sarah A. E., 2017. "Approaching effects of the economic crisis on university efficiency: A comparative study of Germany and Italy," UO Working Papers 08-17, University of Augsburg, Chair of Management and Organization.
    5. Pyoungsoo Lee & Yong Won Seo, 2017. "Directions for Social Enterprise from an Efficiency Perspective," Sustainability, MDPI, vol. 9(10), pages 1-16, October.
    6. Mad Ithnin Salleh & Nurul Fadly Habidin & Abdul Halim Masnan & Nordin Mamat, 2017. "Estimating Technical Efficiency and Bootstrapping Malmquist Indices: Analysis of Malaysian Preschool Sector," International Journal of Academic Research in Business and Social Sciences, Human Resource Management Academic Research Society, International Journal of Academic Research in Business and Social Sciences, vol. 7(3), pages 440-457, March.
    7. J. C. Glass & D. G. McKillop & G. O'Rourke, 2002. "Evaluating the productive performance of UK universities as cost-constrained revenue maximizers: an empirical analysis," Applied Economics, Taylor & Francis Journals, vol. 34(9), pages 1097-1108.
    8. Kuo, Jenn-Shyong & Ho, Yi-Cheng, 2008. "The cost efficiency impact of the university operation fund on public universities in Taiwan," Economics of Education Review, Elsevier, vol. 27(5), pages 603-612, October.
    9. Andrew Worthington, 2001. "An Empirical Survey of Frontier Efficiency Measurement Techniques in Education," Education Economics, Taylor & Francis Journals, vol. 9(3), pages 245-268.
    10. Samet Güner, 2018. "Incorporating value judgments into port efficiency measurement models: insights from Turkish ports," Maritime Economics & Logistics, Palgrave Macmillan;International Association of Maritime Economists (IAME), vol. 20(4), pages 569-586, December.
    11. Homburg, Carsten, 2001. "Using data envelopment analysis to benchmark activities," International Journal of Production Economics, Elsevier, vol. 73(1), pages 51-58, August.
    12. Mishra, Neelesh Kumar & Chakraborty, Abhishek & Singh, Sanjeet & Ranjan, Prabhat, 2023. "Efficiency analysis of engineering colleges in India: Decomposition into parallel sub-processes systems," Socio-Economic Planning Sciences, Elsevier, vol. 89(C).
    13. Johnes, Geraint & Johnes, Jill & Virmani, Swati, 2022. "Performance and efficiency in Indian universities," Socio-Economic Planning Sciences, Elsevier, vol. 81(C).
    14. Victor V. Podinovski & Wan Rohaida Wan Husain, 2017. "The hybrid returns-to-scale model and its extension by production trade-offs: an application to the efficiency assessment of public universities in Malaysia," Annals of Operations Research, Springer, vol. 250(1), pages 65-84, March.
    15. STEPHEN J. DeCANIO, 1997. "Economic Modeling And The False Tradeoff Between Environmental Protection And Economic Growth," Contemporary Economic Policy, Western Economic Association International, vol. 15(4), pages 10-27, October.
    16. Turgay Türker & Murat Etöz & Yasemin Altun Türker, 2016. "Determination of Effective Critical Factors in Successful Efficiency Measurement of University Departments by Using Fuzzy DEMATEL Method," Alphanumeric Journal, Bahadir Fatih Yildirim, vol. 4(1), pages 57-72, June.
    17. Berna Haktanirlar Ulutas, 2011. "Assessing the Relative Performance of University Departments: Teaching vs. Research," Istanbul University Econometrics and Statistics e-Journal, Department of Econometrics, Faculty of Economics, Istanbul University, vol. 13(1), pages 125-138, Special I.
    18. Mehdi Rhaiem, 2017. "Measurement and determinants of academic research efficiency: a systematic review of the evidence," Scientometrics, Springer;Akadémiai Kiadó, vol. 110(2), pages 581-615, February.
    19. Mohammad Izadikhah & Reza Farzipoor Saen & Kourosh Ahmadi, 2017. "How to Assess Sustainability of Suppliers in the Presence of Dual-Role Factor and Volume Discounts? A Data Envelopment Analysis Approach," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 34(03), pages 1-25, June.
    20. George E. Halkos & Nickolaos G. Tzeremes & Stavros A. Kourtzidis, 2010. "An application of statistical interference in DEA models: An analysis of public owned university departments' efficiency," EERI Research Paper Series EERI_RP_2010_17, Economics and Econometrics Research Institute (EERI), Brussels.
    21. Huguenin, Jean-Marc, 2015. "Adjusting for the environment in DEA: A comparison of alternative models based on empirical data," Socio-Economic Planning Sciences, Elsevier, vol. 52(C), pages 41-54.
    22. Avkiran, Necmi K., 2001. "Investigating technical and scale efficiencies of Australian Universities through data envelopment analysis," Socio-Economic Planning Sciences, Elsevier, vol. 35(1), pages 57-80, March.
    23. Lee, Ki-Hoon & Farzipoor Saen, Reza, 2012. "Measuring corporate sustainability management: A data envelopment analysis approach," International Journal of Production Economics, Elsevier, vol. 140(1), pages 219-226.
    24. Post, Thierry & Spronk, Jaap, 1999. "Performance benchmarking using interactive data envelopment analysis," European Journal of Operational Research, Elsevier, vol. 115(3), pages 472-487, June.
    25. Ramón, Nuria & Ruiz, José L. & Sirvent, Inmaculada, 2010. "A multiplier bound approach to assess relative efficiency in DEA without slacks," European Journal of Operational Research, Elsevier, vol. 203(1), pages 261-269, May.
    26. Sepideh Abolghasem & Mehdi Toloo & Santiago Amézquita, 2019. "Cross-efficiency evaluation in the presence of flexible measures with an application to healthcare systems," Health Care Management Science, Springer, vol. 22(3), pages 512-533, September.
    27. Navas, Lina P. & Montes, Felipe & Abolghasem, Sepideh & Salas, Ricardo J. & Toloo, Mehdi & Zarama, Roberto, 2020. "Colombian higher education institutions evaluation," Socio-Economic Planning Sciences, Elsevier, vol. 71(C).
    28. Johannes G. Hoogeveen & Mariacristina Rossi & Dario Sansone, 2014. "Drivers of performance in primary education in Togo," CeRP Working Papers 145, Center for Research on Pensions and Welfare Policies, Turin (Italy).
    29. Jaehun Park & Joonyoung Kim & Si-Il Sung, 2017. "Performance Evaluation of Research and Business Development: A Case Study of Korean Public Organizations," Sustainability, MDPI, vol. 9(12), pages 1-16, December.
    30. Gabriel Villa & Sebastián Lozano, 2016. "DEA with non-monotonic variables. Application to EU governments’ macroeconomic efficiency," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 67(12), pages 1510-1523, December.
    31. Casu, B. & Thanassoulis, E., 2006. "Evaluating cost efficiency in central administrative services in UK universities," Omega, Elsevier, vol. 34(5), pages 417-426, October.
    32. Mirhedayatian, Seyed Mostafa & Azadi, Majid & Farzipoor Saen, Reza, 2014. "A novel network data envelopment analysis model for evaluating green supply chain management," International Journal of Production Economics, Elsevier, vol. 147(PB), pages 544-554.
    33. Colin Glass, J. & McCallion, Gillian & McKillop, Donal G. & Rasaratnam, Syamarlah & Stringer, Karl S., 2006. "Implications of variant efficiency measures for policy evaluations in UK higher education," Socio-Economic Planning Sciences, Elsevier, vol. 40(2), pages 119-142, June.
    34. Henriques, C.O. & Marcenaro-Gutierrez, O.D., 2021. "Efficiency of secondary schools in Portugal: A novel DEA hybrid approach," Socio-Economic Planning Sciences, Elsevier, vol. 74(C).
    35. Nakaishi, Tomoaki & Chapman, Andrew & Kagawa, Shigemi, 2022. "Shedding Light on the energy-related social equity of nations toward a just transition," Socio-Economic Planning Sciences, Elsevier, vol. 83(C).
    36. Keirstead, James, 2013. "Benchmarking urban energy efficiency in the UK," Energy Policy, Elsevier, vol. 63(C), pages 575-587.
    37. Ying Chu Ng & Sung Ko Li, 2000. "Measuring the Research Performance of Chinese Higher Education Institutions: An Application of Data Envelopment Analysis," Education Economics, Taylor & Francis Journals, vol. 8(2), pages 139-156.
    38. Mustafa, A. & Goh, M., 1996. "Multi-criterion models for higher education administration," Omega, Elsevier, vol. 24(2), pages 167-178, April.
    39. Toloo, Mehdi & Ebrahimi, Bohlool & Amin, Gholam R., 2021. "New data envelopment analysis models for classifying flexible measures: The role of non-Archimedean epsilon," European Journal of Operational Research, Elsevier, vol. 292(3), pages 1037-1050.
    40. Carlo Salerno, 2006. "Using Data Envelopment Analysis to Improve Estimates of Higher Education Institution's Per-student Education Costs," Education Economics, Taylor & Francis Journals, vol. 14(3), pages 281-295.
    41. Shimshak, Daniel G. & Lenard, Melanie L. & Klimberg, Ronald K., 2009. "Incorporating quality into data envelopment analysis of nursing home performance: A case study," Omega, Elsevier, vol. 37(3), pages 672-685, June.
    42. Jiménez, Fernando & Zabala Iturriagagoitia, Jon Mikel & Zofío, José Luis, 2007. "Efficiency in Public Research Centers: Evaluating the Spanish Food Technology Program," Working Papers in Economic Theory 2007/04, Universidad Autónoma de Madrid (Spain), Department of Economic Analysis (Economic Theory and Economic History).
    43. Sanjeet Singh & Prabhat Ranjan, 2018. "Efficiency analysis of non-homogeneous parallel sub-unit systems for the performance measurement of higher education," Annals of Operations Research, Springer, vol. 269(1), pages 641-666, October.
    44. Anis Bouzouita & Valérie Vierstraete, 2011. "L'évaluation de l'efficience des institutions d'enseignement supérieur en Tunisie : le cas des Instituts Supérieurs des Études Technologiques (ISET)," Cahiers de recherche 11-14, Departement d'économique de l'École de gestion à l'Université de Sherbrooke.
    45. Johnes, Jill, 2015. "Operational Research in education," European Journal of Operational Research, Elsevier, vol. 243(3), pages 683-696.
    46. Tommaso Agasisti & Giuseppe Munda, 2017. "Efficiency of investment in compulsory education: An Overview of Methodological Approaches," JRC Research Reports JRC106681, Joint Research Centre.
    47. Mehdi Toloo & Mona Barat, 2015. "On considering dual-role factor in supplier selection problem," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 82(1), pages 107-122, August.
    48. Rita Shakouri & Maziar Salahi & Sohrab Kordrostami & Jie Wu, 2019. "Flexible measure in the presence of the partial input to output impacts process," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 29(3), pages 77-98.
    49. Abolghasem Naderi, 2022. "Efficiency measurement of higher education units using multilevel frontier analysis," Journal of Productivity Analysis, Springer, vol. 57(1), pages 79-92, February.
    50. Gimenez, Victor M. & Martinez, Jose Luis, 2006. "Cost efficiency in the university: A departmental evaluation model," Economics of Education Review, Elsevier, vol. 25(5), pages 543-553, October.
    51. Toloo, Mehdi & Keshavarz, Esmaeil & Hatami-Marbini, Adel, 2018. "Dual-role factors for imprecise data envelopment analysis," Omega, Elsevier, vol. 77(C), pages 15-31.
    52. Wen-Chih Chen, 2021. "On performance evaluation with a dual-role factor," Annals of Operations Research, Springer, vol. 304(1), pages 63-84, September.
    53. Gerhard Reichmann & Christian Schlögl, 2022. "On the possibilities of presenting the research performance of an institute over a long period of time: the case of the Institute of Information Science at the University of Graz in Austria," Scientometrics, Springer;Akadémiai Kiadó, vol. 127(6), pages 3193-3223, June.
    54. Mansour Zarrin, 2023. "A mixed-integer slacks-based measure data envelopment analysis for efficiency measuring of German university hospitals," Health Care Management Science, Springer, vol. 26(1), pages 138-160, March.
    55. Renato A. Villano & Carolyn‐Dung T. T. Tran, 2021. "Survey on technical efficiency in higher education: A meta‐fractional regression analysis," Pacific Economic Review, Wiley Blackwell, vol. 26(1), pages 110-135, February.
    56. Marcel Clermont & Alexander Dirksen & Harald Dyckhoff, 2015. "Returns to scale of Business Administration research in Germany," Scientometrics, Springer;Akadémiai Kiadó, vol. 103(2), pages 583-614, May.
    57. AT Flegg & DO Allen & K Field & TW Thurlow, 2003. "Measuring the Efficiency and Productivity of British Universities: An Application of DEA and the Malmquist Approach," Working Papers 0304, Department of Accounting, Economics and Finance, Bristol Business School, University of the West of England, Bristol.
    58. Sunil Kumar Jauhar & Millie Pant & Richa Dutt, 2018. "Performance measurement of an Indian higher education institute: a sustainable educational supply chain management perspective," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 9(1), pages 180-193, February.
    59. Mehmet Ceyhan & James Benneyan, 2014. "Handling estimated proportions in public sector data envelopment analysis," Annals of Operations Research, Springer, vol. 221(1), pages 107-132, October.
    60. Majid Azadi & Amir Shabani & Reza Farzipoor Saen, 2014. "A new Russell model for selecting suppliers," International Journal of Integrated Supply Management, Inderscience Enterprises Ltd, vol. 9(1/2), pages 23-48.
    61. Tavana, Madjid & Izadikhah, Mohammad & Toloo, Mehdi & Roostaee, Razieh, 2021. "A new non-radial directional distance model for data envelopment analysis problems with negative and flexible measures," Omega, Elsevier, vol. 102(C).
    62. R Farzipoor Saen, 2011. "Media selection in the presence of flexible factors and imprecise data," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(9), pages 1695-1703, September.
    63. Jiménez-Sáez, Fernando & Zabala-Iturriagagoitia, Jon Mikel & Zofío, José L. & Castro-Martínez, Elena, 2011. "Evaluating research efficiency within National R&D Programmes," Research Policy, Elsevier, vol. 40(2), pages 230-241, March.
    64. Calogero Guccio & Marco Ferdinando Martorana & Luisa Monaco, 2016. "Evaluating the impact of the Bologna Process on the efficiency convergence of Italian universities: a non-parametric frontier approach," Journal of Productivity Analysis, Springer, vol. 45(3), pages 275-298, June.
    65. Lars Herberholz & Berthold U. Wigger, 2020. "Efficiency of European Universities: A Comparison of Peers," CESifo Working Paper Series 8044, CESifo.
    66. Johnes, Jill & Yu, Li, 2008. "Measuring the research performance of Chinese higher education institutions using data envelopment analysis," China Economic Review, Elsevier, vol. 19(4), pages 679-696, December.
    67. Kao, Chiang & Lin, Pei-Huang, 2011. "Qualitative factors in data envelopment analysis: A fuzzy number approach," European Journal of Operational Research, Elsevier, vol. 211(3), pages 586-593, June.
    68. Forsund,F.R., 1999. "Efficiency and productivity of Norwegian colleges," Memorandum 11/1999, Oslo University, Department of Economics.
    69. Bohlool Ebrahimi & Madjid Tavana & Andreas Kleine & Andreas Dellnitz, 2021. "An epsilon-based data envelopment analysis approach for solving performance measurement problems with interval and ordinal dual-role factors," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 43(4), pages 1103-1124, December.
    70. Heinz Ahn & Marcel Clermont & Julia Langner, 2022. "The impact of selected input and output factors on measuring research efficiency of university research fields: insights from a purpose-, field-, and method-specific perspective," Journal of Business Economics, Springer, vol. 92(8), pages 1303-1335, October.
    71. Degl'Innocenti, Marta & Kourtzidis, Stavros A. & Sevic, Zeljko & Tzeremes, Nickolaos G., 2017. "Investigating bank efficiency in transition economies: A window-based weight assurance region approach," Economic Modelling, Elsevier, vol. 67(C), pages 23-33.
    72. Cook, Wade D. & Zhu, Joe, 2007. "Classifying inputs and outputs in data envelopment analysis," European Journal of Operational Research, Elsevier, vol. 180(2), pages 692-699, July.
    73. Mehdi Toloo & Esmaeil Keshavarz & Adel Hatami-Marbini, 2021. "An interval efficiency analysis with dual-role factors," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 43(1), pages 255-287, March.
    74. Samoilenko, Sergey & Osei-Bryson, Kweku-Muata, 2010. "Determining sources of relative inefficiency in heterogeneous samples: Methodology using Cluster Analysis, DEA and Neural Networks," European Journal of Operational Research, Elsevier, vol. 206(2), pages 479-487, October.
    75. Tommaso Agasisti & Ralph Hippe & Giuseppe Munda, 2017. "Efficiency of investment in compulsory education: empirical analyses in Europe," JRC Research Reports JRC106678, Joint Research Centre.
    76. Guccio, Calogero & Martorana, Marco & Monaco, Luisa, 2013. "Evaluating italian university teaching efficiency convergence: a non-parametric frontier approach," MPRA Paper 56673, University Library of Munich, Germany.
    77. Façanha, Luís Otávio & Resende, Marcelo & Marinho, Alexandre, 1997. "Brazilian Federal Universities: Relative Efficiency Evaluation and Data Envelopment Analysis," Revista Brasileira de Economia - RBE, EPGE Brazilian School of Economics and Finance - FGV EPGE (Brazil), vol. 51(4), October.
    78. Tzeremes, Nickolaos & Halkos, George, 2010. "A DEA approach for measuring university departments’ efficiency," MPRA Paper 24029, University Library of Munich, Germany.
    79. George E. Halkos & Nickolaos G. Tzeremes & Stavros A. Kourtzidis, 2012. "Measuring Public Owned University Departments' Efficiency: A Bootstrapped DEA Approach," Journal of Economics and Econometrics, Economics and Econometrics Society, vol. 55(2), pages 1-24.
    80. Tyagi, Preeti & Yadav, Shiv Prasad & Singh, S.P., 2009. "Relative performance of academic departments using DEA with sensitivity analysis," Evaluation and Program Planning, Elsevier, vol. 32(2), pages 168-177, May.
    81. G. Tohidi & F. Matroud, 2017. "A new non-oriented model for classifying flexible measures in DEA," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(9), pages 1019-1029, September.
    82. Calogero Guccio & Marco Ferdinando Martorana & Isidoro Mazza, 2016. "Efficiency assessment and convergence in teaching and research in Italian public universities," Scientometrics, Springer;Akadémiai Kiadó, vol. 107(3), pages 1063-1094, June.
    83. Geraint Johnes, 1995. "Scale and technical efficiency in the production of economic research," Applied Economics Letters, Taylor & Francis Journals, vol. 2(1), pages 7-11.

  35. Beasley, J. E., 1988. "An algorithm for solving large capacitated warehouse location problems," European Journal of Operational Research, Elsevier, vol. 33(3), pages 314-325, February.

    Cited by:

    1. Di Francesco, Massimo & Gaudioso, Manlio & Gorgone, Enrico & Murthy, Ishwar, 2021. "A new extended formulation with valid inequalities for the Capacitated Concentrator Location Problem," European Journal of Operational Research, Elsevier, vol. 289(3), pages 975-986.
    2. Klose, Andreas & Gortz, Simon, 2007. "A branch-and-price algorithm for the capacitated facility location problem," European Journal of Operational Research, Elsevier, vol. 179(3), pages 1109-1125, June.
    3. Chen, Violet Xinying & Hooker, J.N., 2022. "Combining leximax fairness and efficiency in a mathematical programming model," European Journal of Operational Research, Elsevier, vol. 299(1), pages 235-248.
    4. B Goldengorin & J Keane & V Kuzmenko & M K-S Tso, 2011. "Optimal supplier choice with discounting," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(4), pages 690-699, April.
    5. Vedat Verter & M. Cemal Dincer, 1995. "Facility location and capacity acquisition: An integrated approach," Naval Research Logistics (NRL), John Wiley & Sons, vol. 42(8), pages 1141-1160, December.
    6. Guazzelli, Cauê Sauter & Cunha, Claudio B., 2018. "Exploring K-best solutions to enrich network design decision-making," Omega, Elsevier, vol. 78(C), pages 139-164.
    7. Drexl, Andreas & Klose, Andreas, 2001. "Facility location models for distribution system design," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 546, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    8. Amini, M. Mehdi & Retzlaff-Roberts, Donna & Bienstock, Carol C., 2005. "Designing a reverse logistics operation for short cycle time repair services," International Journal of Production Economics, Elsevier, vol. 96(3), pages 367-380, June.
    9. 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.
    10. Klaus Büdenbender & Tore Grünert & Hans-Jürgen Sebastian, 2000. "A Hybrid Tabu Search/Branch-and-Bound Algorithm for the Direct Flight Network Design Problem," Transportation Science, INFORMS, vol. 34(4), pages 364-380, November.
    11. Ioannis Avgerinos & Ioannis Mourtos & Georgios Zois, 2022. "Multi-type facility location in printing and parcel delivery services," Annals of Operations Research, Springer, vol. 309(1), pages 365-393, February.
    12. 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.
    13. K Sörensen, 2008. "Investigation of practical, robust and flexible decisions for facility location problems using tabu search and simulation," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(5), pages 624-636, May.
    14. 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.
    15. Alexandra Ribeiro & António Pais Antunes, 2002. "A GIS-Based Decision-Support Tool for Public Facility Planning," Environment and Planning B, , vol. 29(4), pages 553-569, August.
    16. Klose, Andreas & Drexl, Andreas, 2001. "Combinatorial optimisation problems of the assignment type and a partitioning approach," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 545, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    17. Klose, Andreas & Drexl, Andreas, 2005. "Facility location models for distribution system design," European Journal of Operational Research, Elsevier, vol. 162(1), pages 4-29, April.
    18. 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.
    19. Grunert, Tore & Sebastian, Hans-Jurgen, 2000. "Planning models for long-haul operations of postal and express shipment companies," European Journal of Operational Research, Elsevier, vol. 122(2), pages 289-309, April.
    20. Harkness, Joseph & ReVelle, Charles, 2003. "Facility location with increasing production costs," European Journal of Operational Research, Elsevier, vol. 145(1), pages 1-13, February.

  36. Beasley, J. E., 1987. "An algorithm for set covering problem," European Journal of Operational Research, Elsevier, vol. 31(1), pages 85-93, July.

    Cited by:

    1. Grossman, Tal & Wool, Avishai, 1997. "Computational experience with approximation algorithms for the set covering problem," European Journal of Operational Research, Elsevier, vol. 101(1), pages 81-92, August.
    2. Galvao, Roberto D. & Gonzalo Acosta Espejo, Luis & Boffey, Brian, 2000. "A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem," European Journal of Operational Research, Elsevier, vol. 124(2), pages 377-389, July.
    3. Larry W. Jacobs & Michael J. Brusco, 1995. "Note: A local‐search heuristic for large set‐covering problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 42(7), pages 1129-1140, October.
    4. Ferdinando Pezzella & Enrico Faggioli, 1997. "Solving large set covering problems for crew scheduling," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 5(1), pages 41-59, June.
    5. Naji-Azimi, Zahra & Toth, Paolo & Galli, Laura, 2010. "An electromagnetism metaheuristic for the unicost set covering problem," European Journal of Operational Research, Elsevier, vol. 205(2), pages 290-300, September.
    6. Fabio Colombo & Roberto Cordone & Guglielmo Lulli, 2015. "A variable neighborhood search algorithm for the multimode set covering problem," Journal of Global Optimization, Springer, vol. 63(3), pages 461-480, November.
    7. 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.
    8. Gao, Chao & Yao, Xin & Weise, Thomas & Li, Jinlong, 2015. "An efficient local search heuristic with row weighting for the unicost set covering problem," European Journal of Operational Research, Elsevier, vol. 246(3), pages 750-761.
    9. Mauricio Castillo & Ricardo Soto & Broderick Crawford & Carlos Castro & Rodrigo Olivares, 2021. "A Knowledge-Based Hybrid Approach on Particle Swarm Optimization Using Hidden Markov Models," Mathematics, MDPI, vol. 9(12), pages 1-21, June.
    10. El-Darzi, Elia & Mitra, Gautam, 1995. "Graph theoretic relaxations of set covering and set partitioning problems," European Journal of Operational Research, Elsevier, vol. 87(1), pages 109-121, November.
    11. Helena R. Lourenço & José P. Paixão & Rita Portugal, 2001. "Multiobjective Metaheuristics for the Bus Driver Scheduling Problem," Transportation Science, INFORMS, vol. 35(3), pages 331-343, August.
    12. Patrizia Beraldi & Andrzej Ruszczyński, 2002. "The Probabilistic Set-Covering Problem," Operations Research, INFORMS, vol. 50(6), pages 956-967, December.
    13. José García & Gino Astorga & Víctor Yepes, 2021. "An Analysis of a KNN Perturbation Operator: An Application to the Binarization of Continuous Metaheuristics," Mathematics, MDPI, vol. 9(3), pages 1-20, January.
    14. Christian Prins & Caroline Prodhon & Roberto Calvo, 2006. "Two-phase method and Lagrangian relaxation to solve the Bi-Objective Set Covering Problem," Annals of Operations Research, Springer, vol. 147(1), pages 23-41, October.
    15. Wanders, Henrico L. T. & Gaalman, Gerard J. C. & Sierksma, Gerard, 2004. "The composition of semi-finished inventories at a solid board plant," European Journal of Operational Research, Elsevier, vol. 155(1), pages 96-111, May.
    16. Olivier Briant & Denis Naddef, 2004. "The Optimal Diversity Management Problem," Operations Research, INFORMS, vol. 52(4), pages 515-526, August.
    17. Balakrishnan, Anantaram. & Magnanti, Thomas L. & Mirchandani, Prakash., 1991. "A dual-based algorithm for multi-level network design," Working papers 3365-91., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    18. İbrahim Miraç Eligüzel & Eren Özceylan & Gerhard-Wilhelm Weber, 2023. "Location-allocation analysis of humanitarian distribution plans: a case of United Nations Humanitarian Response Depots," Annals of Operations Research, Springer, vol. 324(1), pages 825-854, May.
    19. Nonobe, Koji & Ibaraki, Toshihide, 1998. "A tabu search approach to the constraint satisfaction problem as a general problem solver," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 599-623, April.
    20. 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.
    21. Hanif D. Sherali & Seong‐In Kim & Edna L. Parrish, 1991. "Probabilistic partial set covering problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 38(1), pages 41-51, February.
    22. Stephen E. Bechtold & Larry W. Jacobs, 1996. "The equivalence of general set‐covering and implicit integer programming formulations for shift scheduling," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(2), pages 233-249, March.
    23. Lan, Guanghui & DePuy, Gail W. & Whitehouse, Gary E., 2007. "An effective and simple heuristic for the set covering problem," European Journal of Operational Research, Elsevier, vol. 176(3), pages 1387-1403, February.
    24. Nguyen, Tri-Dung, 2014. "A fast approximation algorithm for solving the complete set packing problem," European Journal of Operational Research, Elsevier, vol. 237(1), pages 62-70.
    25. Alejandro Lara-Caballero & Diego González-Moreno, 2023. "A Population-Based Local Search Algorithm for the Identifying Code Problem," Mathematics, MDPI, vol. 11(20), pages 1-17, October.
    26. Victor Reyes & Ignacio Araya, 2021. "A GRASP-based scheme for the set covering problem," Operational Research, Springer, vol. 21(4), pages 2391-2408, December.
    27. Helena Ramalhinho-Lourenço, 2001. "The crew-scheduling module in the GIST system," Economics Working Papers 547, Department of Economics and Business, Universitat Pompeu Fabra.
    28. Chunyan Liu & Hejiao Huang & Hongwei Du & Xiaohua Jia, 2017. "Optimal RSUs placement with delay bounded message dissemination in vehicular networks," Journal of Combinatorial Optimization, Springer, vol. 33(4), pages 1276-1299, May.
    29. Gianpiero Canessa & Julian A. Gallego & Lewis Ntaimo & Bernardo K. Pagnoncelli, 2019. "An algorithm for binary linear chance-constrained problems using IIS," Computational Optimization and Applications, Springer, vol. 72(3), pages 589-608, April.
    30. Wang, Yiyuan & Pan, Shiwei & Al-Shihabi, Sameh & Zhou, Junping & Yang, Nan & Yin, Minghao, 2021. "An improved configuration checking-based algorithm for the unicost set covering problem," European Journal of Operational Research, Elsevier, vol. 294(2), pages 476-491.
    31. Ohlsson, Mattias & Peterson, Carsten & Soderberg, Bo, 2001. "An efficient mean field approach to the set covering problem," European Journal of Operational Research, Elsevier, vol. 133(3), pages 583-595, September.
    32. 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.
    33. 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.
    34. Mete Suleyman & Cil Zeynel Abidin & Özceylan Eren, 2018. "Location and Coverage Analysis of Bike- Sharing Stations in University Campus," Business Systems Research, Sciendo, vol. 9(2), pages 80-95, July.

  37. J. E. Beasley, 1985. "An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure," Operations Research, INFORMS, vol. 33(1), pages 49-64, February.

    Cited by:

    1. Valerio de Carvalho, J. M., 2002. "LP models for bin packing and cutting stock problems," European Journal of Operational Research, Elsevier, vol. 141(2), pages 253-273, September.
    2. Hifi, Mhand & Paschos, Vangelis Th. & Zissimopoulos, Vassilis, 2004. "A simulated annealing approach for the circular cutting problem," European Journal of Operational Research, Elsevier, vol. 159(2), pages 430-448, December.
    3. G, Young-Gun & Kang, Maing-Kyu, 2001. "A fast algorithm for two-dimensional pallet loading problems of large size," European Journal of Operational Research, Elsevier, vol. 134(1), pages 193-202, October.
    4. Jean-François Côté & Manuel Iori, 2018. "The Meet-in-the-Middle Principle for Cutting and Packing Problems," INFORMS Journal on Computing, INFORMS, vol. 30(4), pages 646-661, November.
    5. Igor Kierkosz & Maciej Luczak, 2014. "A hybrid evolutionary algorithm for the two-dimensional packing problem," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 22(4), pages 729-753, December.
    6. Kelly Cristina Poldi & Silvio Alexandre Araujo, 2016. "Mathematical models and a heuristic method for the multiperiod one-dimensional cutting stock problem," Annals of Operations Research, Springer, vol. 238(1), pages 497-520, March.
    7. Çalık, Hatice & Juwet, Marc & Yaman, Hande & Vanden Berghe, Greet, 2023. "Cargo securing under multi-drop and axle weight constraints," European Journal of Operational Research, Elsevier, vol. 307(1), pages 157-176.
    8. Alvarez-Valdes, R. & Parreno, F. & Tamarit, J.M., 2007. "A tabu search algorithm for a two-dimensional non-guillotine cutting problem," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1167-1182, December.
    9. Shan, Wenxuan & Peng, Zixuan & Liu, Jiaming & Yao, Baozhen & Yu, Bin, 2020. "An exact algorithm for inland container transportation network design," Transportation Research Part B: Methodological, Elsevier, vol. 135(C), pages 41-82.
    10. Demiröz, Barış Evrim & Altınel, İ. Kuban & Akarun, Lale, 2019. "Rectangle blanket problem: Binary integer linear programming formulation and solution algorithms," European Journal of Operational Research, Elsevier, vol. 277(1), pages 62-83.
    11. Iori, Manuel & de Lima, Vinícius L. & Martello, Silvano & Miyazawa, Flávio K. & Monaci, Michele, 2021. "Exact solution techniques for two-dimensional cutting and packing," European Journal of Operational Research, Elsevier, vol. 289(2), pages 399-415.
    12. RuiYang Li & Ming He & HongYue He & QiaoYu Deng, 2022. "Heuristic column generation for designing an express circular packaging distribution network," Operational Research, Springer, vol. 22(2), pages 1103-1126, April.
    13. Silvano Martello & Daniele Vigo, 1998. "Exact Solution of the Two-Dimensional Finite Bin Packing Problem," Management Science, INFORMS, vol. 44(3), pages 388-399, March.
    14. Felix Prause & Kai Hoppmann-Baum & Boris Defourny & Thorsten Koch, 2021. "The maximum diversity assortment selection problem," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 93(3), pages 521-554, June.
    15. 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.
    16. Kurpel, Deidson Vitorio & Scarpin, Cassius Tadeu & Pécora Junior, José Eduardo & Schenekemberg, Cleder Marcos & Coelho, Leandro C., 2020. "The exact solutions of several types of container loading problems," European Journal of Operational Research, Elsevier, vol. 284(1), pages 87-107.
    17. Faina, Loris, 1999. "An application of simulated annealing to the cutting stock problem," European Journal of Operational Research, Elsevier, vol. 114(3), pages 542-556, May.
    18. Lodi, Andrea & Martello, Silvano & Monaci, Michele, 2002. "Two-dimensional packing problems: A survey," European Journal of Operational Research, Elsevier, vol. 141(2), pages 241-252, September.
    19. E. K. Burke & G. Kendall & G. Whitwell, 2004. "A New Placement Heuristic for the Orthogonal Stock-Cutting Problem," Operations Research, INFORMS, vol. 52(4), pages 655-671, August.
    20. Silva, Elsa & Oliveira, José Fernando & Silveira, Tiago & Mundim, Leandro & Carravilla, Maria Antónia, 2023. "The Floating-Cuts model: a general and flexible mixed-integer programming model for non-guillotine and guillotine rectangular cutting problems," Omega, Elsevier, vol. 114(C).
    21. Wascher, Gerhard & Hau[ss]ner, Heike & Schumann, Holger, 2007. "An improved typology of cutting and packing problems," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1109-1130, December.
    22. Stoyan, Yu. G. & Pankratov, A. V., 1999. "Regular packing of congruent polygons on the rectangular sheet," European Journal of Operational Research, Elsevier, vol. 113(3), pages 653-675, March.
    23. Gonçalves, José Fernando & Resende, Mauricio G.C., 2013. "A biased random key genetic algorithm for 2D and 3D bin packing problems," International Journal of Production Economics, Elsevier, vol. 145(2), pages 500-510.
    24. Toledo, Franklina M.B. & Carravilla, Maria Antónia & Ribeiro, Cristina & Oliveira, José F. & Gomes, A. Miguel, 2013. "The Dotted-Board Model: A new MIP model for nesting irregular shapes," International Journal of Production Economics, Elsevier, vol. 145(2), pages 478-487.
    25. Önder Aşık & Ender Özcan, 2009. "Bidirectional best-fit heuristic for orthogonal rectangular strip packing," Annals of Operations Research, Springer, vol. 172(1), pages 405-427, November.
    26. Thapatsuwan, Peeraya & Pongcharoen, Pupong & Hicks, Chris & Chainate, Warattapop, 2012. "Development of a stochastic optimisation tool for solving the multiple container packing problems," International Journal of Production Economics, Elsevier, vol. 140(2), pages 737-748.
    27. Beasley, J. E., 2004. "A population heuristic for constrained two-dimensional non-guillotine cutting," European Journal of Operational Research, Elsevier, vol. 156(3), pages 601-627, August.
    28. Lei Wang & Aihua Yin, 2016. "A quasi-human algorithm for the two dimensional rectangular strip packing problem: in memory of Prof. Wenqi Huang," Journal of Combinatorial Optimization, Springer, vol. 32(2), pages 416-444, August.
    29. José Fernando Gonçalves & Mauricio G. C. Resende, 2011. "A parallel multi-population genetic algorithm for a constrained two-dimensional orthogonal packing problem," Journal of Combinatorial Optimization, Springer, vol. 22(2), pages 180-201, August.
    30. Igor Kierkosz & Maciej Łuczak, 2019. "A one-pass heuristic for nesting problems," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 29(1), pages 37-60.
    31. Naiara P. V. Sebbe & Francisco J. G. Silva & Alcinda M. S. Barreiras & Isabel M. Pinto & Rita C. M. Sales-Contini & Luis P. Ferreira & Ana B. M. Machado, 2024. "Pallet Loading Problem: A Case Study in the Automotive Industry Applying a Simplified Mathematical Model," Mathematics, MDPI, vol. 12(7), pages 1-17, March.
    32. Leonardo Junqueira & Reinaldo Morabito & Denise Sato Yamashita, 2012. "MIP-based approaches for the container loading problem with multi-drop constraints," Annals of Operations Research, Springer, vol. 199(1), pages 51-75, October.
    33. Hadjiconstantinou, Eleni & Iori, Manuel, 2007. "A hybrid genetic algorithm for the two-dimensional single large object placement problem," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1150-1166, December.
    34. Song, X. & Chu, C.B. & Lewis, R. & Nie, Y.Y. & Thompson, J., 2010. "A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting," European Journal of Operational Research, Elsevier, vol. 202(2), pages 368-378, April.
    35. R Alvarez-Valdes & F Parreño & J M Tamarit, 2005. "A GRASP algorithm for constrained two-dimensional non-guillotine cutting problems," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(4), pages 414-425, April.
    36. Stoyan, Yu. G. & Novozhilova, M. V. & Kartashov, A. V., 1996. "Mathematical model and method of searching for a local extremum for the non-convex oriented polygons allocation problem," European Journal of Operational Research, Elsevier, vol. 92(1), pages 193-210, July.
    37. Letchford, Adam N. & Amaral, Andre, 2001. "Analysis of upper bounds for the Pallet Loading Problem," European Journal of Operational Research, Elsevier, vol. 132(3), pages 582-593, August.
    38. Wu, Yu-Liang & Huang, Wenqi & Lau, Siu-chung & Wong, C. K. & Young, Gilbert H., 2002. "An effective quasi-human based heuristic for solving the rectangle packing problem," European Journal of Operational Research, Elsevier, vol. 141(2), pages 341-358, September.
    39. McDonald, Conor M., 2016. "Integrating packaging and supply chain decisions: Selection of economic handling unit quantities," International Journal of Production Economics, Elsevier, vol. 180(C), pages 208-221.
    40. F. Parreño & R. Alvarez-Valdes & J. Oliveira & J. Tamarit, 2010. "A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing," Annals of Operations Research, Springer, vol. 179(1), pages 203-220, September.
    41. Bayliss, Christopher & Currie, Christine S.M. & Bennell, Julia A. & Martinez-Sykora, Antonio, 2021. "Queue-constrained packing: A vehicle ferry case study," European Journal of Operational Research, Elsevier, vol. 289(2), pages 727-741.
    42. Jéssica Gabriela Almeida Cunha & Vinícius Loti de Lima & Thiago Alves Queiroz, 2020. "Grids for cutting and packing problems: a study in the 2D knapsack problem," 4OR, Springer, vol. 18(3), pages 293-339, September.
    43. Lu, Hao-Chun & Huang, Yao-Huei, 2015. "An efficient genetic algorithm with a corner space algorithm for a cutting stock problem in the TFT-LCD industry," European Journal of Operational Research, Elsevier, vol. 246(1), pages 51-65.
    44. Ben Messaoud, Said & Chu, Chengbin & Espinouse, Marie-Laure, 2008. "Characterization and modelling of guillotine constraints," European Journal of Operational Research, Elsevier, vol. 191(1), pages 112-126, November.
    45. George, John A. & George, Jennifer M. & Lamar, Bruce W., 1995. "Packing different-sized circles into a rectangular container," European Journal of Operational Research, Elsevier, vol. 84(3), pages 693-712, August.
    46. Wei, Lijun & Hu, Qian & Lim, Andrew & Liu, Qiang, 2018. "A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem," European Journal of Operational Research, Elsevier, vol. 270(2), pages 448-474.
    47. Kelly Poldi & Silvio Araujo, 2016. "Mathematical models and a heuristic method for the multiperiod one-dimensional cutting stock problem," Annals of Operations Research, Springer, vol. 238(1), pages 497-520, March.
    48. L Lins & S Lins & R Morabito, 2003. "An L-approach for packing (ℓ, w)-rectangles into rectangular and L-shaped pieces," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(7), pages 777-789, July.
    49. Leung, Stephen C.H. & Zhang, Defu & Sim, Kwang Mong, 2011. "A two-stage intelligent search algorithm for the two-dimensional strip packing problem," European Journal of Operational Research, Elsevier, vol. 215(1), pages 57-69, November.
    50. Chen, C. S. & Lee, S. M. & Shen, Q. S., 1995. "An analytical model for the container loading problem," European Journal of Operational Research, Elsevier, vol. 80(1), pages 68-76, January.
    51. Wei, Lijun & Oon, Wee-Chong & Zhu, Wenbin & Lim, Andrew, 2011. "A skyline heuristic for the 2D rectangular packing and strip packing problems," European Journal of Operational Research, Elsevier, vol. 215(2), pages 337-346, December.
    52. Cintra, G.F. & Miyazawa, F.K. & Wakabayashi, Y. & Xavier, E.C., 2008. "Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation," European Journal of Operational Research, Elsevier, vol. 191(1), pages 61-85, November.
    53. Hifi, M. & Zissimopoulos, V., 1996. "A recursive exact algorithm for weighted two-dimensional cutting," European Journal of Operational Research, Elsevier, vol. 91(3), pages 553-564, June.
    54. Vera Neidlein & Andrèa C. G. Vianna & Marcos N. Arenales & Gerhard Wäscher, 2008. "The Two-Dimensional, Rectangular, Guillotineable-Layout Cutting Problem with a Single Defect," FEMM Working Papers 08035, Otto-von-Guericke University Magdeburg, Faculty of Economics and Management.
    55. Goncalves, Jose Fernando, 2007. "A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1212-1229, December.
    56. Baldacci, Roberto & Boschetti, Marco A., 2007. "A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1136-1149, December.
    57. Dowsland, Kathryn A. & Herbert, Edward A. & Kendall, Graham & Burke, Edmund, 2006. "Using tree search bounds to enhance a genetic algorithm approach to two rectangle packing problems," European Journal of Operational Research, Elsevier, vol. 168(2), pages 390-402, January.
    58. Marco Antonio Boschetti & Lorenza Montaletti, 2010. "An Exact Algorithm for the Two-Dimensional Strip-Packing Problem," Operations Research, INFORMS, vol. 58(6), pages 1774-1791, December.
    59. Silva, Allyson & Coelho, Leandro C. & Darvish, Maryam & Renaud, Jacques, 2022. "A cutting plane method and a parallel algorithm for packing rectangles in a circular container," European Journal of Operational Research, Elsevier, vol. 303(1), pages 114-128.
    60. Andrea Lodi & Silvano Martello & Daniele Vigo, 2004. "Models and Bounds for Two-Dimensional Level Packing Problems," Journal of Combinatorial Optimization, Springer, vol. 8(3), pages 363-379, September.
    61. Wang, Mengyao & Zhou, Chenhao & Wang, Aihu, 2022. "A cluster-based yard template design integrated with yard crane deployment using a placement heuristic," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 160(C).
    62. Defu Zhang & Yuxin Che & Furong Ye & Yain-Whar Si & Stephen C. H. Leung, 2016. "A hybrid algorithm based on variable neighbourhood for the strip packing problem," Journal of Combinatorial Optimization, Springer, vol. 32(2), pages 513-530, August.
    63. W. D. D. Madhavee & N. Saldin & U. C. Vaidyarathna & C. J. Jayawardene, 2018. "A Practical Application of the Generalized Cutting Stock Algorithm," Academic Journal of Applied Mathematical Sciences, Academic Research Publishing Group, vol. 4(3), pages 15-21, 03-2018.
    64. K A Dowsland & M Gilbert & G Kendall, 2007. "A local search approach to a circle cutting problem arising in the motor cycle industry," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(4), pages 429-438, April.
    65. Sándor P. Fekete & Jörg Schepers & Jan C. van der Veen, 2007. "An Exact Algorithm for Higher-Dimensional Orthogonal Packing," Operations Research, INFORMS, vol. 55(3), pages 569-587, June.
    66. Arenales, Marcos & Morabito, Reinaldo, 1995. "An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems," European Journal of Operational Research, Elsevier, vol. 84(3), pages 599-617, August.
    67. Lodi, Andrea & Martello, Silvano & Vigo, Daniele, 1999. "Approximation algorithms for the oriented two-dimensional bin packing problem," European Journal of Operational Research, Elsevier, vol. 112(1), pages 158-166, January.
    68. Kaizhi Chen & Jiahao Zhuang & Shangping Zhong & Song Zheng, 2020. "Optimization Method for Guillotine Packing of Rectangular Items within an Irregular and Defective Slate," Mathematics, MDPI, vol. 8(11), pages 1-16, November.
    69. Rosephine G. Rakotonirainy & Jan H. Vuuren, 2021. "The effect of benchmark data characteristics during empirical strip packing heuristic performance evaluation," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 43(2), pages 467-495, June.
    70. Leung, T. W. & Chan, Chi Kin & Troutt, Marvin D., 2003. "Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem," European Journal of Operational Research, Elsevier, vol. 145(3), pages 530-542, March.
    71. István Borgulya, 2019. "An EDA for the 2D knapsack problem with guillotine constraint," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 27(2), pages 329-356, June.
    72. I. Gimenez-Palacios & M. T. Alonso & R. Alvarez-Valdes & F. Parreño, 2021. "Logistic constraints in container loading problems: the impact of complete shipment conditions," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 29(1), pages 177-203, April.
    73. Gonçalves, José Fernando & Wäscher, Gerhard, 2020. "A MIP model and a biased random-key genetic algorithm based approach for a two-dimensional cutting problem with defects," European Journal of Operational Research, Elsevier, vol. 286(3), pages 867-882.
    74. 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.
    75. Michele Monaci & André Gustavo Santos, 2018. "Minimum tiling of a rectangle by squares," Annals of Operations Research, Springer, vol. 271(2), pages 831-851, December.
    76. Wei, Lijun & Lim, Andrew, 2015. "A bidirectional building approach for the 2D constrained guillotine knapsack packing problem," European Journal of Operational Research, Elsevier, vol. 242(1), pages 63-71.
    77. G M Ribeiro & L A N Lorena, 2008. "Optimizing the woodpulp stowage using Lagrangean relaxation with clusters," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(5), pages 600-606, May.
    78. Nestor M Cid-Garcia & Yasmin A Rios-Solis, 2020. "Positions and covering: A two-stage methodology to obtain optimal solutions for the 2d-bin packing problem," PLOS ONE, Public Library of Science, vol. 15(4), pages 1-22, April.
    79. Yanasse, Horacio Hideki & Pinto Lamosa, Maria Jose, 2007. "An integrated cutting stock and sequencing problem," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1353-1370, December.
    80. Fekete, Sandor P. & van der Veen, Jan C., 2007. "PackLib2: An integrated library of multi-dimensional packing problems," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1131-1135, December.

  38. Beasley, J. E., 1985. "A note on solving large p-median problems," European Journal of Operational Research, Elsevier, vol. 21(2), pages 270-273, August.

    Cited by:

    1. 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.
    2. S Salhi & A Al-Khedhairi, 2010. "Integrating heuristic information into exact methods: The case of the vertex p-centre problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(11), pages 1619-1631, November.
    3. Soheil Davari, 2019. "The incremental cooperative design of preventive healthcare networks," Annals of Operations Research, Springer, vol. 272(1), pages 445-492, January.
    4. Caruso, C. & Colorni, A. & Aloi, L., 2003. "Dominant, an algorithm for the p-center problem," European Journal of Operational Research, Elsevier, vol. 149(1), pages 53-64, August.
    5. Alberto Ceselli & Federico Liberatore & Giovanni Righini, 2009. "A computational evaluation of a general branch-and-price framework for capacitated network location problems," Annals of Operations Research, Springer, vol. 167(1), pages 209-251, March.
    6. Filipe Rodrigues & Agostinho Agra & Lars Magnus Hvattum & Cristina Requejo, 2021. "Weighted proximity search," Journal of Heuristics, Springer, vol. 27(3), pages 459-496, June.
    7. Daniel Martins & Gabriel M. Vianna & Isabel Rosseti & Simone L. Martins & Alexandre Plastino, 2018. "Making a state-of-the-art heuristic faster with data mining," Annals of Operations Research, Springer, vol. 263(1), pages 141-162, April.
    8. Olender, Paweł & Ogryczak, Włodzimierz, 2019. "A revised Variable Neighborhood Search for the Discrete Ordered Median Problem," European Journal of Operational Research, Elsevier, vol. 274(2), pages 445-465.
    9. Alcaraz, Javier & Landete, Mercedes & Monge, Juan F., 2012. "Design and analysis of hybrid metaheuristics for the Reliability p-Median Problem," European Journal of Operational Research, Elsevier, vol. 222(1), pages 54-64.
    10. Patricia Domínguez-Marín & Stefan Nickel & Pierre Hansen & Nenad Mladenović, 2005. "Heuristic Procedures for Solving the Discrete Ordered Median Problem," Annals of Operations Research, Springer, vol. 136(1), pages 145-173, April.
    11. 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.
    12. Mladenovic, Nenad & Brimberg, Jack & Hansen, Pierre & Moreno-Perez, Jose A., 2007. "The p-median problem: A survey of metaheuristic approaches," European Journal of Operational Research, Elsevier, vol. 179(3), pages 927-939, June.
    13. Dowsland, Kathryn A. & Soubeiga, Eric & Burke, Edmund, 2007. "A simulated annealing based hyperheuristic for determining shipper sizes for storage and transportation," European Journal of Operational Research, Elsevier, vol. 179(3), pages 759-774, June.
    14. Hansen, Pierre & Mladenovic, Nenad, 2001. "Variable neighborhood search: Principles and applications," European Journal of Operational Research, Elsevier, vol. 130(3), pages 449-467, May.
    15. Fathali, J. & Kakhki, H. Taghizadeh, 2006. "Solving the p-median problem with pos/neg weights by variable neighborhood search and some results for special cases," European Journal of Operational Research, Elsevier, vol. 170(2), pages 440-462, April.
    16. Mauricio Resende & Renato Werneck, 2007. "A fast swap-based local search procedure for location problems," Annals of Operations Research, Springer, vol. 150(1), pages 205-230, March.
    17. Blanco, Víctor & Gázquez, Ricardo & Ponce, Diego & Puerto, Justo, 2023. "A branch-and-price approach for the continuous multifacility monotone ordered median problem," European Journal of Operational Research, Elsevier, vol. 306(1), pages 105-126.
    18. Carrizosa, Emilio & Mladenović, Nenad & Todosijević, Raca, 2013. "Variable neighborhood search for minimum sum-of-squares clustering on networks," European Journal of Operational Research, Elsevier, vol. 230(2), pages 356-363.
    19. Caleb C. Fast & Illya V. Hicks, 2017. "A Branch Decomposition Algorithm for the p -Median Problem," INFORMS Journal on Computing, INFORMS, vol. 29(3), pages 474-488, August.
    20. Frans Schalekamp & Michael Yu & Anke Zuylen, 2013. "Clustering with or without the approximation," Journal of Combinatorial Optimization, Springer, vol. 25(3), pages 393-429, April.

  39. Beasley, J. E., 1985. "An algorithm for the two-dimensional assortment problem," European Journal of Operational Research, Elsevier, vol. 19(2), pages 253-261, February.

    Cited by:

    1. H-L Li & J-F Tsai & N-Z Hu, 2003. "A distributed global optimization method for packing problems," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(4), pages 419-425, April.
    2. Holthaus, Oliver, 2003. "On the best number of different standard lengths to stock for one-dimensional assortment problems," International Journal of Production Economics, Elsevier, vol. 83(3), pages 233-246, March.
    3. Li, Han-Lin & Chang, Ching-Ter, 1998. "An approximately global optimization method for assortment problems," European Journal of Operational Research, Elsevier, vol. 105(3), pages 604-612, March.
    4. Arbib, Claudio & Marinelli, Fabrizio, 2007. "An optimization model for trim loss minimization in an automotive glass plant," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1421-1432, December.
    5. François Vanderbeck, 2001. "A Nested Decomposition Approach to a Three-Stage, Two-Dimensional Cutting-Stock Problem," Management Science, INFORMS, vol. 47(6), pages 864-879, June.

  40. Tan, C.C.R. & Beasley, J.E., 1984. "A heuristic algorithm for the period vehicle routing problem," Omega, Elsevier, vol. 12(5), pages 497-504.

    Cited by:

    1. Claassen, G.D.H. & Hendriks, Th.H.B., 2007. "An application of Special Ordered Sets to a periodic milk collection problem," European Journal of Operational Research, Elsevier, vol. 180(2), pages 754-769, July.
    2. D Ronen & C A Goodhart, 2008. "Tactical store delivery planning," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(8), pages 1047-1054, August.
    3. Fabien Tricoire & Nathalie Bostel & Pierre Dejax & Pierre Guez, 2013. "Exact and hybrid methods for the multiperiod field service routing problem," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 21(2), pages 359-377, March.
    4. Lacomme, Philippe & Prins, Christian & Ramdane-Cherif, Wahiba, 2005. "Evolutionary algorithms for periodic arc routing problems," European Journal of Operational Research, Elsevier, vol. 165(2), pages 535-553, September.
    5. Chen, Yujie & Cowling, Peter & Polack, Fiona & Remde, Stephen & Mourdjis, Philip, 2017. "Dynamic optimisation of preventative and corrective maintenance schedules for a large scale urban drainage system," European Journal of Operational Research, Elsevier, vol. 257(2), pages 494-510.
    6. le Blanc, H.M. & Cruijssen, F. & Fleuren, H.A. & de Koster, M.B.M., 2006. "Factory gate pricing: An analysis of the Dutch retail distribution," European Journal of Operational Research, Elsevier, vol. 174(3), pages 1950-1967, November.
    7. S Coene & A Arnout & F C R Spieksma, 2010. "On a periodic vehicle routing problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(12), pages 1719-1728, December.
    8. Song, Ruidian & Zhao, Lei & Van Woensel, Tom & Fransoo, Jan C., 2019. "Coordinated delivery in urban retail," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 126(C), pages 122-148.
    9. Goos Kant & Michael Jacks & Corné Aantjes, 2008. "Coca-Cola Enterprises Optimizes Vehicle Routes for Efficient Product Delivery," Interfaces, INFORMS, vol. 38(1), pages 40-50, February.
    10. Baptista, Susana & Oliveira, Rui Carvalho & Zuquete, Eduardo, 2002. "A period vehicle routing case study," European Journal of Operational Research, Elsevier, vol. 139(2), pages 220-229, June.
    11. Norlund, Ellen Karoline & Gribkovskaia, Irina & Laporte, Gilbert, 2015. "Supply vessel planning under cost, environment and robustness considerations," Omega, Elsevier, vol. 57(PB), pages 271-281.
    12. Boudia, M. & Prins, C., 2009. "A memetic algorithm with dynamic population management for an integrated production-distribution problem," European Journal of Operational Research, Elsevier, vol. 195(3), pages 703-715, June.
    13. Roberto Baldacci & Enrico Bartolini & Aristide Mingozzi & Andrea Valletta, 2011. "An Exact Algorithm for the Period Routing Problem," Operations Research, INFORMS, vol. 59(1), pages 228-241, February.
    14. S Pamuk & M Köksalan & R Güllü, 2004. "Analysis and improvement of the product delivery system of a beer producer in Ankara," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(11), pages 1137-1144, November.
    15. 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.
    16. Moshe Dror & Michael Ball, 1987. "Inventory/routing: Reduction from an annual to a short‐period problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 34(6), pages 891-905, December.
    17. Halvorsen-Weare, Elin E. & Fagerholt, Kjetil & Nonås, Lars Magne & Asbjørnslett, Bjørn Egil, 2012. "Optimal fleet composition and periodic routing of offshore supply vessels," European Journal of Operational Research, Elsevier, vol. 223(2), pages 508-517.
    18. Webb, Ian R. & Larson, Richard C., 1995. "Period and phase of customer replenishment: A new approach to the Strategic Inventory/Routing problem," European Journal of Operational Research, Elsevier, vol. 85(1), pages 132-148, August.
    19. Aksen, Deniz & Kaya, Onur & Sibel Salman, F. & Tüncel, Özge, 2014. "An adaptive large neighborhood search algorithm for a selective and periodic inventory routing problem," European Journal of Operational Research, Elsevier, vol. 239(2), pages 413-426.
    20. Simon Emde & Michael Schneider, 2018. "Just-In-Time Vehicle Routing for In-House Part Feeding to Assembly Lines," Transportation Science, INFORMS, vol. 52(3), pages 657-672, June.
    21. Schyns, M., 2015. "An ant colony system for responsive dynamic vehicle routing," European Journal of Operational Research, Elsevier, vol. 245(3), pages 704-718.
    22. Rodríguez-Martín, Inmaculada & Salazar-González, Juan-José & Yaman, Hande, 2019. "The periodic vehicle routing problem with driver consistency," European Journal of Operational Research, Elsevier, vol. 273(2), pages 575-584.
    23. A. Mor & M. G. Speranza, 2020. "Vehicle routing problems over time: a survey," 4OR, Springer, vol. 18(2), pages 129-149, June.
    24. Angelelli, Enrico & Grazia Speranza, Maria, 2002. "The periodic vehicle routing problem with intermediate facilities," European Journal of Operational Research, Elsevier, vol. 137(2), pages 233-247, March.
    25. Chu, Feng & Labadi, Nacima & Prins, Christian, 2006. "A Scatter Search for the periodic capacitated arc routing problem," European Journal of Operational Research, Elsevier, vol. 169(2), pages 586-605, March.
    26. Peter Francis & Karen Smilowitz & Michal Tzur, 2007. "Flexibility and complexity in periodic distribution problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 54(2), pages 136-150, March.
    27. R. Montemanni & L. M. Gambardella & A. E. Rizzoli & A. V. Donati, 2005. "Ant Colony System for a Dynamic Vehicle Routing Problem," Journal of Combinatorial Optimization, Springer, vol. 10(4), pages 327-343, December.
    28. A. Mor & M. G. Speranza, 2022. "Vehicle routing problems over time: a survey," Annals of Operations Research, Springer, vol. 314(1), pages 255-275, July.
    29. Cruijssen, F., 2006. "Horizontal cooperation in transport and logistics," Other publications TiSEM ab6dbe68-aebc-4b03-8eea-d, Tilburg University, School of Economics and Management.
    30. Nasr Al-Hinai & Chefi Triki, 2020. "A two-level evolutionary algorithm for solving the petrol station replenishment problem with periodicity constraints and service choice," Annals of Operations Research, Springer, vol. 286(1), pages 325-350, March.
    31. Fred Blakeley & Burçin Argüello & Buyang Cao & Wolfgang Hall & Joseph Knolmajer, 2003. "Optimizing Periodic Maintenance Operations for Schindler Elevator Corporation," Interfaces, INFORMS, vol. 33(1), pages 67-79, February.
    32. Dong, Zhijie & Turnquist, Mark A., 2015. "Combining service frequency and vehicle routing for managing supplier shipments," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 79(C), pages 231-243.
    33. Rodríguez-Martín, Inmaculada & Yaman, Hande, 2022. "Periodic Vehicle Routing Problem with Driver Consistency and service time optimization," Transportation Research Part B: Methodological, Elsevier, vol. 166(C), pages 468-484.
    34. Ramos, Tânia Rodrigues Pereira & Gomes, Maria Isabel & Barbosa-Póvoa, Ana Paula, 2014. "Planning a sustainable reverse logistics system: Balancing costs with environmental and social concerns," Omega, Elsevier, vol. 48(C), pages 60-74.
    35. Zhou, Lin & Zhen, Lu & Baldacci, Roberto & Boschetti, Marco & Dai, Ying & Lim, Andrew, 2021. "A Heuristic Algorithm for solving a large-scale real-world territory design problem," Omega, Elsevier, vol. 103(C).
    36. Ann-Kathrin Rothenbächer, 2017. "Branch-and-Price-and-Cut for the Periodic Vehicle Routing Problem with Flexible Schedule Structures," Working Papers 1714, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    37. Theodore Athanasopoulos & Ioannis Minis, 2013. "Efficient techniques for the multi-period vehicle routing problem with time windows within a branch and price framework," Annals of Operations Research, Springer, vol. 206(1), pages 1-22, July.
    38. Avci, Mustafa & Yildiz, Seyda Topaloglu, 2019. "A matheuristic solution approach for the production routing problem with visit spacing policy," European Journal of Operational Research, Elsevier, vol. 279(2), pages 572-588.
    39. Cruz, Roberto & Bergsten Mendes, André & Bahiense, Laura & Wu, Yue, 2019. "Integrating berth allocation decisions in a fleet composition and periodic routing problem of platform supply vessels," European Journal of Operational Research, Elsevier, vol. 275(1), pages 334-346.
    40. Lei, Chao & Zhang, Qian & Ouyang, Yanfeng, 2017. "Planning of parking enforcement patrol considering drivers’ parking payment behavior," Transportation Research Part B: Methodological, Elsevier, vol. 106(C), pages 375-392.
    41. Campelo, Pedro & Neves-Moreira, Fábio & Amorim, Pedro & Almada-Lobo, Bernardo, 2019. "Consistent vehicle routing problem with service level agreements: A case study in the pharmaceutical distribution sector," European Journal of Operational Research, Elsevier, vol. 273(1), pages 131-145.
    42. Mourgaya, M. & Vanderbeck, F., 2007. "Column generation based heuristic for tactical planning in multi-period vehicle routing," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1028-1041, December.
    43. Vera C. Hemmelmayr & Karl F. Doerner & Richard F. Hartl & Daniele Vigo, 2014. "Models and Algorithms for the Integrated Planning of Bin Allocation and Vehicle Routing in Solid Waste Management," Transportation Science, INFORMS, vol. 48(1), pages 103-120, February.
    44. Aderemi Oluyinka Adewumi & Olawale Joshua Adeleke, 2018. "A survey of recent advances in vehicle routing problems," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 9(1), pages 155-172, February.
    45. Campbell, Ann Melissa & Hardin, Jill R., 2005. "Vehicle minimization for periodic deliveries," European Journal of Operational Research, Elsevier, vol. 165(3), pages 668-684, September.
    46. Ann-Kathrin Rothenbächer, 2019. "Branch-and-Price-and-Cut for the Periodic Vehicle Routing Problem with Flexible Schedule Structures," Transportation Science, INFORMS, vol. 53(3), pages 850-866, May.
    47. Nair, D.J. & Grzybowska, H. & Fu, Y. & Dixit, V.V., 2018. "Scheduling and routing models for food rescue and delivery operations," Socio-Economic Planning Sciences, Elsevier, vol. 63(C), pages 18-32.
    48. Huang, Shan-Huen & Lin, Pei-Chun, 2015. "Vehicle routing–scheduling for municipal waste collection system under the “Keep Trash off the Ground” policy," Omega, Elsevier, vol. 55(C), pages 24-37.
    49. Chefi Triki, 2017. "Solving the Periodic Edge Routing Problem in the Municipal Waste Collection," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 34(03), pages 1-13, June.
    50. Sinem Kınay Savaşer & Bahar Yetis Kara, 2022. "Mobile healthcare services in rural areas: an application with periodic location routing problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 44(3), pages 875-910, September.
    51. Ramos, Tânia Rodrigues Pereira & Gomes, Maria Isabel & Barbosa-Póvoa, Ana Paula, 2014. "Assessing and improving management practices when planning packaging waste collection systems," Resources, Conservation & Recycling, Elsevier, vol. 85(C), pages 116-129.
    52. Xiaodong Li & Yang Xu & Kin Keung Lai & Hao Ji & Yaning Xu & Jia Li, 2022. "A Multi-Period Vehicle Routing Problem for Emergency Perishable Materials under Uncertain Demand Based on an Improved Whale Optimization Algorithm," Mathematics, MDPI, vol. 10(17), pages 1-17, August.
    53. Leandro C. Coelho & Jean-François Cordeau & Gilbert Laporte, 2014. "Thirty Years of Inventory Routing," Transportation Science, INFORMS, vol. 48(1), pages 1-19, February.

  41. Wong, KF & Beasley, JE, 1984. "Vehicle routing using fixed delivery areas," Omega, Elsevier, vol. 12(6), pages 591-600.

    Cited by:

    1. Schneider, M., 2016. "The vehicle-routing problem with time windows and driver-specific times," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 65941, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    2. Michael Schneider & Andreas Stenger & Fabian Schwahn & Daniele Vigo, 2015. "Territory-Based Vehicle Routing in the Presence of Time-Window Constraints," Transportation Science, INFORMS, vol. 49(4), pages 732-751, November.
    3. Bender, Matthias & Kalcsics, Jörg & Meyer, Anne, 2020. "Districting for parcel delivery services – A two-Stage solution approach and a real-World case study," Omega, Elsevier, vol. 96(C).
    4. Vidal, Thibaut & Laporte, Gilbert & Matl, Piotr, 2020. "A concise guide to existing and emerging vehicle routing problem variants," European Journal of Operational Research, Elsevier, vol. 286(2), pages 401-416.
    5. Huang, Yixiao & Savelsbergh, Martin & Zhao, Lei, 2018. "Designing logistics systems for home delivery in densely populated urban areas," Transportation Research Part B: Methodological, Elsevier, vol. 115(C), pages 95-125.
    6. Li, Yifu & Zhou, Chenhao & Yuan, Peixue & Ngo, Thi Tu Anh, 2023. "Experience-based territory planning and driver assignment with predicted demand and driver present condition," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 171(C).
    7. Karen Smilowitz & Maciek Nowak & Tingting Jiang, 2013. "Workforce Management in Periodic Delivery Operations," Transportation Science, INFORMS, vol. 47(2), pages 214-230, May.
    8. Doppstadt, C. & Koberstein, A. & Vigo, D., 2016. "The Hybrid Electric Vehicle – Traveling Salesman Problem," European Journal of Operational Research, Elsevier, vol. 253(3), pages 825-842.
    9. Hongsheng Zhong & Randolph W. Hall & Maged Dessouky, 2007. "Territory Planning and Vehicle Dispatching with Driver Learning," Transportation Science, INFORMS, vol. 41(1), pages 74-89, February.

  42. Christofides, N. & Beasley, J. E., 1983. "Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem," European Journal of Operational Research, Elsevier, vol. 12(1), pages 19-28, January.

    Cited by:

    1. Klose, Andreas & Gortz, Simon, 2007. "A branch-and-price algorithm for the capacitated facility location problem," European Journal of Operational Research, Elsevier, vol. 179(3), pages 1109-1125, June.
    2. B Goldengorin & J Keane & V Kuzmenko & M K-S Tso, 2011. "Optimal supplier choice with discounting," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(4), pages 690-699, April.
    3. Klose, Andreas, 2000. "A Lagrangean relax-and-cut approach for the two-stage capacitated facility location problem," European Journal of Operational Research, Elsevier, vol. 126(2), pages 408-421, October.
    4. Abareshi, Maryam & Zaferanieh, Mehdi, 2019. "A bi-level capacitated P-median facility location problem with the most likely allocation solution," Transportation Research Part B: Methodological, Elsevier, vol. 123(C), pages 1-20.
    5. Hernandez, Adrian & Ng, Max & Durango-Cohen, Pablo L. & Mahmassani, Hani S., 2024. "Optimizing service networks to support freight rail decarbonization: Flow selection, facility location, and energy sourcing," European Journal of Operational Research, Elsevier, vol. 317(3), pages 906-920.
    6. Alberto Ceselli & Federico Liberatore & Giovanni Righini, 2009. "A computational evaluation of a general branch-and-price framework for capacitated network location problems," Annals of Operations Research, Springer, vol. 167(1), pages 209-251, March.
    7. Marta Sofia R. Monteiro & Dalila B. M. M. Fontes & Fernando A. C. C. Fontes, 2009. "Restructuring Facility Networks under Economy of Scales," FEP Working Papers 324, Universidade do Porto, Faculdade de Economia do Porto.
    8. Drexl, Andreas & Klose, Andreas, 2001. "Facility location models for distribution system design," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 546, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    9. Klaus Büdenbender & Tore Grünert & Hans-Jürgen Sebastian, 2000. "A Hybrid Tabu Search/Branch-and-Bound Algorithm for the Direct Flight Network Design Problem," Transportation Science, INFORMS, vol. 34(4), pages 364-380, November.
    10. 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.
    11. Holmberg, Kaj & Ling, Jonas, 1997. "A Lagrangean heuristic for the facility location problem with staircase costs," European Journal of Operational Research, Elsevier, vol. 97(1), pages 63-74, February.
    12. 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.
    13. Melkote, Sanjay & Daskin, Mark S., 2001. "Capacitated facility location/network design problems," European Journal of Operational Research, Elsevier, vol. 129(3), pages 481-495, March.
    14. Klose, Andreas & Drexl, Andreas, 2001. "Combinatorial optimisation problems of the assignment type and a partitioning approach," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 545, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    15. Ningxuan Kang & Hao Shen & Ye Xu, 2022. "JD.com Improves Delivery Networks by a Multiperiod Facility Location Model," Interfaces, INFORMS, vol. 52(2), pages 133-148, March.
    16. Calvete, Herminia I. & Galé, Carmen & Iranzo, José A., 2014. "Planning of a decentralized distribution network using bilevel optimization," Omega, Elsevier, vol. 49(C), pages 30-41.
    17. Klose, Andreas & Drexl, Andreas, 2005. "Facility location models for distribution system design," European Journal of Operational Research, Elsevier, vol. 162(1), pages 4-29, April.
    18. James F. Campbell, 1992. "Location‐allocation for distribution to a uniform demand with transshipments," Naval Research Logistics (NRL), John Wiley & Sons, vol. 39(5), pages 635-649, August.
    19. Harkness, Joseph & ReVelle, Charles, 2003. "Facility location with increasing production costs," European Journal of Operational Research, Elsevier, vol. 145(1), pages 1-13, February.

  43. Beasley, JE, 1983. "Route first--Cluster second methods for vehicle routing," Omega, Elsevier, vol. 11(4), pages 403-408.

    Cited by:

    1. Devapriya, Priyantha & Ferrell, William & Geismar, Neil, 2017. "Integrated production and distribution scheduling with a perishable product," European Journal of Operational Research, Elsevier, vol. 259(3), pages 906-916.
    2. Imran, Arif & Salhi, Said & Wassan, Niaz A., 2009. "A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 197(2), pages 509-518, September.
    3. Dang, Duc-Cuong & Guibadj, Rym Nesrine & Moukrim, Aziz, 2013. "An effective PSO-inspired algorithm for the team orienteering problem," European Journal of Operational Research, Elsevier, vol. 229(2), pages 332-344.
    4. Chebbi, Olfa & Chaouachi, Jouhaina, 2016. "Reducing the wasted transportation capacity of Personal Rapid Transit systems: An integrated model and multi-objective optimization approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 89(C), pages 236-258.
    5. Philippe Lacomme & Aziz Moukrim & Alain Quilliot & Marina Vinot, 2019. "Integration of routing into a resource-constrained project scheduling problem," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 7(4), pages 421-464, December.
    6. Escobar, John Willmer & Linfati, Rodrigo & Baldoquin, Maria G. & Toth, Paolo, 2014. "A Granular Variable Tabu Neighborhood Search for the capacitated location-routing problem," Transportation Research Part B: Methodological, Elsevier, vol. 67(C), pages 344-356.
    7. Leticia Vargas & Nicolas Jozefowiez & Sandra Ulrich Ngueveu, 2017. "A dynamic programming operator for tour location problems applied to the covering tour problem," Journal of Heuristics, Springer, vol. 23(1), pages 53-80, February.
    8. Zhang, Zizhen & Che, Oscar & Cheang, Brenda & Lim, Andrew & Qin, Hu, 2013. "A memetic algorithm for the multiperiod vehicle routing problem with profit," European Journal of Operational Research, Elsevier, vol. 229(3), pages 573-584.
    9. Niels Agatz & Paul Bouman & Marie Schmidt, 2018. "Optimization Approaches for the Traveling Salesman Problem with Drone," Transportation Science, INFORMS, vol. 52(4), pages 965-981, August.
    10. Joaquín Pacheco & Rafael Caballero & Manuel Laguna & Julián Molina, 2013. "Bi-Objective Bus Routing: An Application to School Buses in Rural Areas," Transportation Science, INFORMS, vol. 47(3), pages 397-411, August.
    11. Goodson, Justin C., 2015. "A priori policy evaluation and cyclic-order-based simulated annealing for the multi-compartment vehicle routing problem with stochastic demands," European Journal of Operational Research, Elsevier, vol. 241(2), pages 361-369.
    12. John E. Fontecha & Oscar O. Guaje & Daniel Duque & Raha Akhavan-Tabatabaei & Juan P. Rodríguez & Andrés L. Medaglia, 2020. "Combined maintenance and routing optimization for large-scale sewage cleaning," Annals of Operations Research, Springer, vol. 286(1), pages 441-474, March.
    13. Alexandra Anderluh & Vera C. Hemmelmayr & Pamela C. Nolz, 2017. "Synchronizing vans and cargo bikes in a city distribution network," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 25(2), pages 345-376, June.
    14. Caio César Freitas & Dario José Aloise & Fábio Francisco Costa Fontes & Andréa Cynthia Santos & Matheus Silva Menezes, 2023. "A biased random-key genetic algorithm for the two-level hub location routing problem with directed tours," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 45(3), pages 903-924, September.
    15. Qiuping Ni & Yuanxiang Tang, 2023. "A Bibliometric Visualized Analysis and Classification of Vehicle Routing Problem Research," Sustainability, MDPI, vol. 15(9), pages 1-37, April.
    16. Villegas, Juan G. & Prins, Christian & Prodhon, Caroline & Medaglia, Andrés L. & Velasco, Nubia, 2013. "A matheuristic for the truck and trailer routing problem," European Journal of Operational Research, Elsevier, vol. 230(2), pages 231-244.
    17. Agatz, N.A.H. & Bouman, P.C. & Schmidt, M.E., 2016. "Optimization Approaches for the Traveling Salesman Problem with Drone," ERIM Report Series Research in Management ERS-2015-011-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.
    18. Fung, Richard Y.K. & Liu, Ran & Jiang, Zhibin, 2013. "A memetic algorithm for the open capacitated arc routing problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 50(C), pages 53-67.
    19. Liu, Shuguang, 2013. "A hybrid population heuristic for the heterogeneous vehicle routing problems," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 54(C), pages 67-78.
    20. Divsalar, A. & Vansteenwegen, P. & Sörensen, K. & Cattrysse, D., 2014. "A memetic algorithm for the orienteering problem with hotel selection," European Journal of Operational Research, Elsevier, vol. 237(1), pages 29-49.
    21. Glize, Estèle & Roberti, Roberto & Jozefowiez, Nicolas & Ngueveu, Sandra Ulrich, 2020. "Exact methods for mono-objective and Bi-Objective Multi-Vehicle Covering Tour Problems," European Journal of Operational Research, Elsevier, vol. 283(3), pages 812-824.
    22. Asvin Goel & Thibaut Vidal, 2014. "Hours of Service Regulations in Road Freight Transport: An Optimization-Based International Assessment," Transportation Science, INFORMS, vol. 48(3), pages 391-412, August.
    23. Salhi, Said & Wassan, Niaz & Hajarat, Mutaz, 2013. "The Fleet Size and Mix Vehicle Routing Problem with Backhauls: Formulation and Set Partitioning-based Heuristics," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 56(C), pages 22-35.
    24. Thibaut Vidal & Nelson Maculan & Luiz Satoru Ochi & Puca Huachi Vaz Penna, 2016. "Large Neighborhoods with Implicit Customer Selection for Vehicle Routing Problems with Profits," Transportation Science, INFORMS, vol. 50(2), pages 720-734, May.
    25. Ke, Liangjun & Zhai, Laipeng & Li, Jing & Chan, Felix T.S., 2016. "Pareto mimic algorithm: An approach to the team orienteering problem," Omega, Elsevier, vol. 61(C), pages 155-166.
    26. Prodhon, Caroline & Prins, Christian, 2014. "A survey of recent research on location-routing problems," European Journal of Operational Research, Elsevier, vol. 238(1), pages 1-17.
    27. Vidal, Thibaut & Crainic, Teodor Gabriel & Gendreau, Michel & Prins, Christian, 2014. "Implicit depot assignments and rotations in vehicle routing heuristics," European Journal of Operational Research, Elsevier, vol. 237(1), pages 15-28.
    28. Liyang Xiao & Mahjoub Dridi & Amir Hajjam El Hassani & Hongying Fei & Wanlong Lin, 2018. "An Improved Cuckoo Search for a Patient Transportation Problem with Consideration of Reducing Transport Emissions," Sustainability, MDPI, vol. 10(3), pages 1-19, March.
    29. Vera C. Hemmelmayr & Karl F. Doerner & Richard F. Hartl & Daniele Vigo, 2014. "Models and Algorithms for the Integrated Planning of Bin Allocation and Vehicle Routing in Solid Waste Management," Transportation Science, INFORMS, vol. 48(1), pages 103-120, February.
    30. Zhang, Jianghua & Zhao, Yingxue & Xue, Weili & Li, Jin, 2015. "Vehicle routing problem with fuel consumption and carbon emission," International Journal of Production Economics, Elsevier, vol. 170(PA), pages 234-242.
    31. Hà, Minh Hoàng & Bostel, Nathalie & Langevin, André & Rousseau, Louis-Martin, 2013. "An exact algorithm and a metaheuristic for the multi-vehicle covering tour problem with a constraint on the number of vertices," European Journal of Operational Research, Elsevier, vol. 226(2), pages 211-220.
    32. Vidal, Thibaut & Crainic, Teodor Gabriel & Gendreau, Michel & Prins, Christian, 2013. "Heuristics for multi-attribute vehicle routing problems: A survey and synthesis," European Journal of Operational Research, Elsevier, vol. 231(1), pages 1-21.
    33. Bulhões, Teobaldo & Hà, Minh Hoàng & Martinelli, Rafael & Vidal, Thibaut, 2018. "The vehicle routing problem with service level constraints," European Journal of Operational Research, Elsevier, vol. 265(2), pages 544-558.
    34. U Derigs & B Li & U Vogel, 2010. "Local search-based metaheuristics for the split delivery vehicle routing problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(9), pages 1356-1364, September.

  44. Christofides, N. & Beasley, J. E., 1982. "A tree search algorithm for the p-median problem," European Journal of Operational Research, Elsevier, vol. 10(2), pages 196-204, June.

    Cited by:

    1. Michael Brusco & Hans-Friedrich Köhn, 2009. "Exemplar-Based Clustering via Simulated Annealing," Psychometrika, Springer;The Psychometric Society, vol. 74(3), pages 457-475, September.
    2. Alberto Ceselli & Federico Liberatore & Giovanni Righini, 2009. "A computational evaluation of a general branch-and-price framework for capacitated network location problems," Annals of Operations Research, Springer, vol. 167(1), pages 209-251, March.
    3. Kurt Jörnsten & Andreas Klose, 2016. "An improved Lagrangian relaxation and dual ascent approach to facility location problems," Computational Management Science, Springer, vol. 13(3), pages 317-348, July.
    4. Drexl, Andreas & Klose, Andreas, 2001. "Facility location models for distribution system design," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 546, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    5. 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.
    6. Gabriella Divéki & Csanád Imreh, 2011. "Online facility location with facility movements," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 19(2), pages 191-200, June.
    7. Klose, Andreas & Drexl, Andreas, 2005. "Facility location models for distribution system design," European Journal of Operational Research, Elsevier, vol. 162(1), pages 4-29, April.
    8. Hribar, Michelle & Daskin, Mark S., 1997. "A dynamic programming heuristic for the P-median problem," European Journal of Operational Research, Elsevier, vol. 101(3), pages 499-508, September.
    9. Zvi Drezner & Said Salhi, 2017. "Incorporating neighborhood reduction for the solution of the planar p-median problem," Annals of Operations Research, Springer, vol. 258(2), pages 639-654, November.
    10. Michael Brusco & Douglas Steinley, 2015. "Affinity Propagation and Uncapacitated Facility Location Problems," Journal of Classification, Springer;The Classification Society, vol. 32(3), pages 443-480, October.
    11. 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.

  45. Beasley, JE, 1981. "Adapting the savings algorithm for varying inter-customer travel times," Omega, Elsevier, vol. 9(6), pages 658-659.

    Cited by:

    1. Dengkai Hou & Houming Fan & Xiaoxue Ren & Panjun Tian & Yingchun Lv, 2021. "Time-Dependent Multi-Depot Heterogeneous Vehicle Routing Problem Considering Temporal–Spatial Distance," Sustainability, MDPI, vol. 13(9), pages 1-16, April.
    2. Hamza Ben Ticha & Nabil Absi & Dominique Feillet & Alain Quilliot & Tom Woensel, 2021. "The Time-Dependent Vehicle Routing Problem with Time Windows and Road-Network Information," SN Operations Research Forum, Springer, vol. 2(1), pages 1-25, March.
    3. A A Juan & J Faulin & J Jorba & D Riera & D Masip & B Barrios, 2011. "On the use of Monte Carlo simulation, cache and splitting techniques to improve the Clarke and Wright savings heuristics," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(6), pages 1085-1097, June.
    4. Bernhard Fleischmann & Martin Gietz & Stefan Gnutzmann, 2004. "Time-Varying Travel Times in Vehicle Routing," Transportation Science, INFORMS, vol. 38(2), pages 160-173, May.
    5. Jianbin Xin & Benyang Yu & Andrea D’Ariano & Heshan Wang & Meng Wang, 2022. "Time-dependent rural postman problem: time-space network formulation and genetic algorithm," Operational Research, Springer, vol. 22(3), pages 2943-2972, July.
    6. Furini, Fabio & Persiani, Carlo Alfredo & Toth, Paolo, 2016. "The Time Dependent Traveling Salesman Planning Problem in Controlled Airspace," Transportation Research Part B: Methodological, Elsevier, vol. 90(C), pages 38-55.
    7. M. Alinaghian & M. Ghazanfari & N. Norouzi & H. Nouralizadeh, 2017. "A Novel Model for the Time Dependent Competitive Vehicle Routing Problem: Modified Random Topology Particle Swarm Optimization," Networks and Spatial Economics, Springer, vol. 17(4), pages 1185-1211, December.

IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.