IDEAS home Printed from https://ideas.repec.org/r/inm/oropre/v5y1957i2p266-288.html
   My bibliography  Save this item

Discrete-Variable Extremum Problems

Citations

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


Cited by:

  1. Teresa Estañ & Natividad Llorca & Ricardo Martínez & Joaquín Sánchez-Soriano, 2021. "On the Difficulty of Budget Allocation in Claims Problems with Indivisible Items and Prices," Group Decision and Negotiation, Springer, vol. 30(5), pages 1133-1159, October.
  2. Abdelkader Sbihi, 2007. "A best first search exact algorithm for the Multiple-choice Multidimensional Knapsack Problem," Journal of Combinatorial Optimization, Springer, vol. 13(4), pages 337-351, May.
  3. Evgeny Gurevsky & Dmitry Kopelevich & Sergey Kovalev & Mikhail Y. Kovalyov, 2023. "Integer knapsack problems with profit functions of the same value range," 4OR, Springer, vol. 21(3), pages 405-419, September.
  4. Thomas L. Magnanti, 2021. "Optimization: From Its Inception," Management Science, INFORMS, vol. 67(9), pages 5349-5363, September.
  5. Bian, Zheyong & Bai, Yun & Douglas, W. Scott & Maher, Ali & Liu, Xiang, 2022. "Multi-year planning for optimal navigation channel dredging and dredged material management," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 159(C).
  6. Alper Döyen & Necati Aras, 2019. "An Integrated Disaster Preparedness Model for Retrofitting and Relief Item Transportation," Networks and Spatial Economics, Springer, vol. 19(4), pages 1031-1068, December.
  7. Silvano Martello & Paolo Toth, 2003. "An Exact Algorithm for the Two-Constraint 0--1 Knapsack Problem," Operations Research, INFORMS, vol. 51(5), pages 826-835, October.
  8. Pisinger, David, 1995. "A minimal algorithm for the multiple-choice knapsack problem," European Journal of Operational Research, Elsevier, vol. 83(2), pages 394-410, June.
  9. 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.
  10. Shabtay, Dvir, 2022. "Single-machine scheduling with machine unavailability periods and resource dependent processing times," European Journal of Operational Research, Elsevier, vol. 296(2), pages 423-439.
  11. Shabtay, Dvir & Mosheiov, Gur & Oron, Daniel, 2022. "Single machine scheduling with common assignable due date/due window to minimize total weighted early and late work," European Journal of Operational Research, Elsevier, vol. 303(1), pages 66-77.
  12. Martello, Silvano & Pisinger, David & Toth, Paolo, 2000. "New trends in exact algorithms for the 0-1 knapsack problem," European Journal of Operational Research, Elsevier, vol. 123(2), pages 325-332, June.
  13. Mavrotas, George & Florios, Kostas & Figueira, José Rui, 2015. "An improved version of a core based algorithm for the multi-objective multi-dimensional knapsack problem: A computational study and comparison with meta-heuristics," Applied Mathematics and Computation, Elsevier, vol. 270(C), pages 25-43.
  14. Mhand Hifi & Hedi Mhalla & Slim Sadfi, 2005. "Sensitivity of the Optimum to Perturbations of the Profit or Weight of an Item in the Binary Knapsack Problem," Journal of Combinatorial Optimization, Springer, vol. 10(3), pages 239-260, November.
  15. Mayer, Stefan & Steinhardt, Claudius, 2016. "Optimal product line pricing in the presence of budget-constrained consumers," European Journal of Operational Research, Elsevier, vol. 248(1), pages 219-233.
  16. Jooken, Jorik & Leyman, Pieter & De Causmaecker, Patrick, 2023. "Features for the 0-1 knapsack problem based on inclusionwise maximal solutions," European Journal of Operational Research, Elsevier, vol. 311(1), pages 36-55.
  17. Christos A. Kontovas & Krishna Sooprayen, 2020. "Maritime Cargo Prioritisation during a Prolonged Pandemic Lockdown Using an Integrated TOPSIS-Knapsack Technique: A Case Study on Small Island Developing States—The Rodrigues Island," Sustainability, MDPI, vol. 12(19), pages 1-20, September.
  18. Wishon, Christopher & Villalobos, J. Rene, 2016. "Robust efficiency measures for linear knapsack problem variants," European Journal of Operational Research, Elsevier, vol. 254(2), pages 398-409.
  19. Iida, Hiroshi, 2011. "How to solve the collapsing subset-sum problem revisited," ビジネス創造センターディスカッション・ペーパー (Discussion papers of the Center for Business Creation) 10252/4432, Otaru University of Commerce.
  20. Vairaktarakis, George L., 2000. "Robust multi-item newsboy models with a budget constraint," International Journal of Production Economics, Elsevier, vol. 66(3), pages 213-226, July.
  21. Glover, Fred, 2013. "Advanced greedy algorithms and surrogate constraint methods for linear and quadratic knapsack and covering problems," European Journal of Operational Research, Elsevier, vol. 230(2), pages 212-225.
  22. Denoyel, Victoire & Alfandari, Laurent & Thiele, Aurélie, 2017. "Optimizing healthcare network design under reference pricing and parameter uncertainty," European Journal of Operational Research, Elsevier, vol. 263(3), pages 996-1006.
  23. Nasiri, G. Reza & Deymeh, Hadi & Karimi, Behrooz & Miandoabchi, Elnaz, 2021. "Incorporating sales and marketing considerations into a competitive multi-echelon distribution network design problem with pricing strategy in a stochastic environment," Journal of Retailing and Consumer Services, Elsevier, vol. 62(C).
  24. Yu, Qinxiao & Fang, Kan & Zhu, Ning & Ma, Shoufeng, 2019. "A matheuristic approach to the orienteering problem with service time dependent profits," European Journal of Operational Research, Elsevier, vol. 273(2), pages 488-503.
  25. Chu, Chi-Leung & Leon, V. Jorge, 2008. "Single-vendor multi-buyer inventory coordination under private information," European Journal of Operational Research, Elsevier, vol. 191(2), pages 485-503, December.
  26. Zhenghua Long & Nahum Shimkin & Hailun Zhang & Jiheng Zhang, 2020. "Dynamic Scheduling of Multiclass Many-Server Queues with Abandonment: The Generalized cμ / h Rule," Operations Research, INFORMS, vol. 68(4), pages 1128-1230, July.
  27. Daniel Espinoza & Eduardo Moreno, 2014. "A primal-dual aggregation algorithm for minimizing conditional value-at-risk in linear programs," Computational Optimization and Applications, Springer, vol. 59(3), pages 617-638, December.
  28. Sanjay Jain & Jónas Oddur Jónasson & Jean Pauphilet & Kamalini Ramdas, 2023. "Robust combination testing: methods and application to COVID-19 detection," Economics Series Working Papers 1009, University of Oxford, Department of Economics.
  29. Sbihi, Abdelkader, 2010. "A cooperative local search-based algorithm for the Multiple-Scenario Max-Min Knapsack Problem," European Journal of Operational Research, Elsevier, vol. 202(2), pages 339-346, April.
  30. Tang, Jiafu & Zhiqiao, Wu & Kwong, C.K. & Luo, Xinggang, 2013. "Integrated production strategy and reuse scenario: A CoFAQ model and case study of mail server system development," Omega, Elsevier, vol. 41(3), pages 536-552.
  31. Marc Goerigk, 2014. "A note on upper bounds to the robust knapsack problem with discrete scenarios," Annals of Operations Research, Springer, vol. 223(1), pages 461-469, December.
  32. 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.
  33. Wim Linden & Ellen Boekkooi-Timminga, 1989. "A maximin model for IRT-based test design with practical constraints," Psychometrika, Springer;The Psychometric Society, vol. 54(2), pages 237-247, June.
  34. Christoph Buchheim & Dorothee Henke & Jannik Irmai, 2022. "The Stochastic Bilevel Continuous Knapsack Problem with Uncertain Follower’s Objective," Journal of Optimization Theory and Applications, Springer, vol. 194(2), pages 521-542, August.
  35. Vijay Mohan & Peyman Khezr, 2024. "Blockchains, MEV and the knapsack problem: a primer," Papers 2403.19077, arXiv.org.
  36. Curtin, Kevin M. & Biba, Steve, 2011. "The Transit Route Arc-Node Service Maximization problem," European Journal of Operational Research, Elsevier, vol. 208(1), pages 46-56, January.
  37. Michel, S. & Perrot, N. & Vanderbeck, F., 2009. "Knapsack problems with setups," European Journal of Operational Research, Elsevier, vol. 196(3), pages 909-918, August.
  38. Patrick Gemander & Wei-Kun Chen & Dieter Weninger & Leona Gottwald & Ambros Gleixner & Alexander Martin, 2020. "Two-row and two-column mixed-integer presolve using hashing-based pairing methods," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 8(3), pages 205-240, October.
  39. Peter Jacko, 2016. "Resource capacity allocation to stochastic dynamic competitors: knapsack problem for perishable items and index-knapsack heuristic," Annals of Operations Research, Springer, vol. 241(1), pages 83-107, June.
  40. Paola Cappanera & Marco Trubian, 2005. "A Local-Search-Based Heuristic for the Demand-Constrained Multidimensional Knapsack Problem," INFORMS Journal on Computing, INFORMS, vol. 17(1), pages 82-98, February.
  41. Toth, Paolo, 2000. "Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems," European Journal of Operational Research, Elsevier, vol. 125(2), pages 222-238, September.
  42. Isma Dahmani & Mhand Hifi, 2021. "A modified descent method-based heuristic for binary quadratic knapsack problems with conflict graphs," Annals of Operations Research, Springer, vol. 298(1), pages 125-147, March.
  43. Haijian Si & Stylianos Kavadias & Christoph Loch, 2022. "Managing innovation portfolios: From project selection to portfolio design," Production and Operations Management, Production and Operations Management Society, vol. 31(12), pages 4572-4588, December.
  44. Hugh Ward & Peter John, 2008. "A Spatial Model of Competitive Bidding for Government Grants: Why Efficiency Gains Are Limited," Journal of Theoretical Politics, , vol. 20(1), pages 47-66, January.
  45. 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.
  46. Darina Graczová & Peter Jacko, 2014. "Generalized Restless Bandits and the Knapsack Problem for Perishable Inventories," Operations Research, INFORMS, vol. 62(3), pages 696-711, June.
  47. Tsesmetzis, Dimitrios & Roussaki, Ioanna & Sykas, Efstathios, 2008. "QoS-aware service evaluation and selection," European Journal of Operational Research, Elsevier, vol. 191(3), pages 1101-1112, December.
  48. Christopher Hojny & Tristan Gally & Oliver Habeck & Hendrik Lüthen & Frederic Matter & Marc E. Pfetsch & Andreas Schmitt, 2020. "Knapsack polytopes: a survey," Annals of Operations Research, Springer, vol. 292(1), pages 469-517, September.
  49. Gerdus Benadè & Swaprava Nath & Ariel D. Procaccia & Nisarg Shah, 2021. "Preference Elicitation for Participatory Budgeting," Management Science, INFORMS, vol. 67(5), pages 2813-2827, May.
  50. Christiane B. Haubitz & Cedric A. Lehmann & Andreas Fügener & Ulrich W. Thonemann, 2021. "The Risk of Algorithm Transparency: How Algorithm Complexity Drives the Effects on Use of Advice," ECONtribute Discussion Papers Series 078, University of Bonn and University of Cologne, Germany.
  51. Vogel, Sebastian & Meyr, Herbert, 2015. "Decentral allocation planning in multi-stage customer hierarchies," European Journal of Operational Research, Elsevier, vol. 246(2), pages 462-470.
  52. Cedric A. Lehmann & Christiane B. Haubitz & Andreas Fügener & Ulrich W. Thonemann, 2022. "The risk of algorithm transparency: How algorithm complexity drives the effects on the use of advice," Production and Operations Management, Production and Operations Management Society, vol. 31(9), pages 3419-3434, September.
  53. Higgins Michael J. & Rivest Ronald L. & Stark Philip B., 2011. "Sharper p-Values for Stratified Election Audits," Statistics, Politics and Policy, De Gruyter, vol. 2(1), pages 1-37, October.
  54. Mohammad Akbarpour & Scott Duke Kominers & Kevin Michael Li & Shengwu Li & Paul Milgrom, 2023. "Algorithmic Mechanism Design With Investment," Econometrica, Econometric Society, vol. 91(6), pages 1969-2003, November.
  55. Vitor Nazário Coelho & Rodolfo Pereira Araújo & Haroldo Gambini Santos & Wang Yong Qiang & Igor Machado Coelho, 2020. "A MILP Model for a Byzantine Fault Tolerant Blockchain Consensus," Future Internet, MDPI, vol. 12(11), pages 1-18, October.
  56. Viet Anh Nguyen & Fan Zhang & Shanshan Wang & Jose Blanchet & Erick Delage & Yinyu Ye, 2021. "Robustifying Conditional Portfolio Decisions via Optimal Transport," Papers 2103.16451, arXiv.org, revised Apr 2024.
  57. Jooken, Jorik & Leyman, Pieter & De Causmaecker, Patrick, 2022. "A new class of hard problem instances for the 0–1 knapsack problem," European Journal of Operational Research, Elsevier, vol. 301(3), pages 841-854.
  58. Kevin Curtin & Karen Hayslett-McCall & Fang Qiu, 2010. "Determining Optimal Police Patrol Areas with Maximal Covering and Backup Covering Location Models," Networks and Spatial Economics, Springer, vol. 10(1), pages 125-145, March.
  59. Sanches, C.A.A. & Soma, N.Y. & Yanasse, H.H., 2007. "An optimal and scalable parallelization of the two-list algorithm for the subset-sum problem," European Journal of Operational Research, Elsevier, vol. 176(2), pages 870-879, January.
  60. Yanhong Feng & Xu Yu & Gai-Ge Wang, 2019. "A Novel Monarch Butterfly Optimization with Global Position Updating Operator for Large-Scale 0-1 Knapsack Problems," Mathematics, MDPI, vol. 7(11), pages 1-31, November.
  61. Peter G. Lindberg, 2009. "Optimal partial hedging in a discrete-time market as a knapsack problem," Papers 0910.5101, arXiv.org.
  62. Lin, Yen-Hung & Batta, Rajan & Rogerson, Peter A. & Blatt, Alan & Flanigan, Marie, 2012. "Location of temporary depots to facilitate relief operations after an earthquake," Socio-Economic Planning Sciences, Elsevier, vol. 46(2), pages 112-123.
  63. M Hifi & M Michrafy & A Sbihi, 2004. "Heuristic algorithms for the multiple-choice multidimensional knapsack problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(12), pages 1323-1332, December.
  64. Shah, Ruchit & Reed, Patrick, 2011. "Comparative analysis of multiobjective evolutionary algorithms for random and correlated instances of multiobjective d-dimensional knapsack problems," European Journal of Operational Research, Elsevier, vol. 211(3), pages 466-479, June.
  65. Thekra Al-douri & Mhand Hifi & Vassilis Zissimopoulos, 2021. "An iterative algorithm for the Max-Min knapsack problem with multiple scenarios," Operational Research, Springer, vol. 21(2), pages 1355-1392, June.
  66. Herweg, Fabian & Müller, Daniel, 2008. "The Optimality of Simple Contracts: Moral Hazard and Loss Aversion," Bonn Econ Discussion Papers 17/2008, University of Bonn, Bonn Graduate School of Economics (BGSE).
  67. Taylan İlhan & Seyed M. R. Iravani & Mark S. Daskin, 2011. "TECHNICAL NOTE---The Adaptive Knapsack Problem with Stochastic Rewards," Operations Research, INFORMS, vol. 59(1), pages 242-248, February.
  68. Pisinger, David, 1999. "An exact algorithm for large multiple knapsack problems," European Journal of Operational Research, Elsevier, vol. 114(3), pages 528-541, May.
  69. Franklin Djeumou Fomeni & Adam N. Letchford, 2014. "A Dynamic Programming Heuristic for the Quadratic Knapsack Problem," INFORMS Journal on Computing, INFORMS, vol. 26(1), pages 173-182, February.
  70. Peyman Khezr & Vijay Mohan & Lionel Page, 2024. "Strategic Bidding in Knapsack Auctions," Papers 2403.07928, arXiv.org.
  71. Alberto Caprara & Margarida Carvalho & Andrea Lodi & Gerhard J. Woeginger, 2016. "Bilevel Knapsack with Interdiction Constraints," INFORMS Journal on Computing, INFORMS, vol. 28(2), pages 319-333, May.
  72. Frank Plastria & Mohamed Elosmani, 2008. "On the convergence of the Weiszfeld algorithm for continuous single facility location–allocation problems," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 16(2), pages 388-406, December.
  73. M. Eric Johnson & Margaret L. Brandeau, 1999. "Design of an Automated Shop Floor Material Handling System with Inventory Considerations," Operations Research, INFORMS, vol. 47(1), pages 65-80, February.
  74. Aadityan Ganesh & Jason Hartline, 2023. "Combinatorial Pen Testing (or Consumer Surplus of Deferred-Acceptance Auctions)," Papers 2301.12462, arXiv.org, revised Jul 2023.
  75. Naoum-Sawaya, Joe & Ghaddar, Bissan & Arandia, Ernesto & Eck, Bradley, 2015. "Simulation-optimization approaches for water pump scheduling and pipe replacement problems," European Journal of Operational Research, Elsevier, vol. 246(1), pages 293-306.
  76. Tobias Achterberg & Robert E. Bixby & Zonghao Gu & Edward Rothberg & Dieter Weninger, 2020. "Presolve Reductions in Mixed Integer Programming," INFORMS Journal on Computing, INFORMS, vol. 32(2), pages 473-506, April.
  77. Christoph Buchheim & Dorothee Henke, 2022. "The robust bilevel continuous knapsack problem with uncertain coefficients in the follower’s objective," Journal of Global Optimization, Springer, vol. 83(4), pages 803-824, August.
  78. Endre Boros & Noam Goldberg & Paul Kantor & Jonathan Word, 2011. "Optimal sequential inspection policies," Annals of Operations Research, Springer, vol. 187(1), pages 89-119, July.
  79. Sagnol, Guillaume & Barner, Christoph & Borndörfer, Ralf & Grima, Mickaël & Seeling, Matthes & Spies, Claudia & Wernecke, Klaus, 2018. "Robust allocation of operating rooms: A cutting plane approach to handle lognormal case durations," European Journal of Operational Research, Elsevier, vol. 271(2), pages 420-435.
  80. Mhand Hifi & Slim Sadfi & Abdelkader Sbihi, 2004. "An Exact Algorithm for the Multiple-choice Multidimensional Knapsack Problem," Post-Print halshs-03322716, HAL.
  81. B. Golany & N. Goldberg & U. Rothblum, 2015. "Allocating multiple defensive resources in a zero-sum game setting," Annals of Operations Research, Springer, vol. 225(1), pages 91-109, February.
  82. Peter Lindberg, 2010. "Optimal partial hedging in a discrete-time market as a knapsack problem," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 72(3), pages 433-451, December.
  83. Cao, Xiaokang & Jouglet, Antoine & Nace, Dritan, 2012. "A Multi-Period Renewal equipment problem," European Journal of Operational Research, Elsevier, vol. 218(3), pages 838-846.
  84. Teresa Estañ & Natividad Llorca & Ricardo Martínez & Joaquín Sánchez-Soriano, 2020. "On the difficulty of budget allocation in claims problems with indivisible items of different prices," ThE Papers 20/09, Department of Economic Theory and Economic History of the University of Granada..
  85. Altay, Nezih & Robinson Jr., Powell E. & Bretthauer, Kurt M., 2008. "Exact and heuristic solution approaches for the mixed integer setup knapsack problem," European Journal of Operational Research, Elsevier, vol. 190(3), pages 598-609, November.
  86. Richard W. Cottle, 2005. "George B. Dantzig: Operations Research Icon," Operations Research, INFORMS, vol. 53(6), pages 892-898, December.
  87. Pisinger, David, 1995. "An expanding-core algorithm for the exact 0-1 knapsack problem," European Journal of Operational Research, Elsevier, vol. 87(1), pages 175-187, November.
  88. Westerink-Duijzer, L.E. & van Jaarsveld, W.L. & Wallinga, J. & Dekker, R., 2016. "The most efficient critical vaccination coverage and its equivalence with maximizing the herd effect," Econometric Institute Research Papers EI2016-06, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
  89. Joonyup Eun & Chang Sup Sung & Eun-Seok Kim, 2017. "Maximizing total job value on a single machine with job selection," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(9), pages 998-1005, September.
  90. Ulmer, Marlin W. & Thomas, Barrett W., 2020. "Meso-parametric value function approximation for dynamic customer acceptances in delivery routing," European Journal of Operational Research, Elsevier, vol. 285(1), pages 183-195.
  91. 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.
  92. Zhang, Cai Wen & Ong, Hoon Liong, 2004. "Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic," European Journal of Operational Research, Elsevier, vol. 159(3), pages 545-557, December.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.