IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v95y1996i1p231-236.html
   My bibliography  Save this article

Ranking in quadratic integer programming problems

Author

Listed:
  • Gupta, Renu
  • Bandopadhyaya, Lakshmisree
  • Puri, M. C.

Abstract

No abstract is available for this item.

Suggested Citation

  • Gupta, Renu & Bandopadhyaya, Lakshmisree & Puri, M. C., 1996. "Ranking in quadratic integer programming problems," European Journal of Operational Research, Elsevier, vol. 95(1), pages 231-236, November.
    • Handle: RePEc:eee:ejores:v:95:y:1996:i:1:p:231-236
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0377-2217(95)00245-6
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. R. D. McBride & J. S. Yormark, 1980. "An Implicit Enumeration Algorithm for Quadratic Integer Programming," Management Science, INFORMS, vol. 26(3), pages 282-296, March.
    2. Fred Glover, 1975. "Improved Linear Integer Programming Formulations of Nonlinear Integer Problems," Management Science, INFORMS, vol. 22(4), pages 455-460, December.
    3. D. E. Peterson & D. J. Laughhunn, 1971. "Capital Expenditure Programming and Some Alternative Approaches to Risk," Management Science, INFORMS, vol. 17(5), pages 320-336, January.
    4. Bernhard, Richard H., 1969. "Mathematical Programming Models for Capital Budgeting—A Survey, Generalization, and Critique*," Journal of Financial and Quantitative Analysis, Cambridge University Press, vol. 4(2), pages 111-158, June.
    5. H. Martin Weingartner, 1966. "Capital Budgeting of Interrelated Projects: Survey and Synthesis," Management Science, INFORMS, vol. 12(7), pages 485-516, March.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Chunli Liu & Jianjun Gao, 2015. "A polynomial case of convex integer quadratic programming problems with box integer constraints," Journal of Global Optimization, Springer, vol. 62(4), pages 661-674, August.
    2. X. J. Zheng & X. L. Sun & D. Li, 2010. "Separable Relaxation for Nonconvex Quadratic Integer Programming: Integer Diagonalization Approach," Journal of Optimization Theory and Applications, Springer, vol. 146(2), pages 463-489, August.
    3. Z. Wu & G. Li & J. Quan, 2011. "Global optimality conditions and optimization methods for quadratic integer programming problems," Journal of Global Optimization, Springer, vol. 51(3), pages 549-568, November.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Richard J. Forrester & Lucas A. Waddell, 2022. "Strengthening a linear reformulation of the 0-1 cubic knapsack problem via variable reordering," Journal of Combinatorial Optimization, Springer, vol. 44(1), pages 498-517, August.
    2. Tobin, Roger L., 2002. "Relief period optimization under budget constraints," European Journal of Operational Research, Elsevier, vol. 139(1), pages 42-61, May.
    3. Bahman Kalantari & Ansuman Bagchi, 1990. "An algorithm for quadratic zero‐one programs," Naval Research Logistics (NRL), John Wiley & Sons, vol. 37(4), pages 527-538, August.
    4. Gerald G. Brown & Robert F. Dell & Alexandra M. Newman, 2004. "Optimizing Military Capital Planning," Interfaces, INFORMS, vol. 34(6), pages 415-425, December.
    5. Kyparisis, George J. & Gupta, Sushil K. & Ip, Chi-Ming, 1996. "Project selection with discounted returns and multiple constraints," European Journal of Operational Research, Elsevier, vol. 94(1), pages 87-96, October.
    6. Yokoyama, Ryohei & Kitano, Hiroyuki & Wakui, Tetsuya, 2017. "Optimal operation of heat supply systems with piping network," Energy, Elsevier, vol. 137(C), pages 888-897.
    7. Christodoulos Floudas & Xiaoxia Lin, 2005. "Mixed Integer Linear Programming in Process Scheduling: Modeling, Algorithms, and Applications," Annals of Operations Research, Springer, vol. 139(1), pages 131-162, October.
    8. Osman, Hany & Demirli, Kudret, 2010. "A bilinear goal programming model and a modified Benders decomposition algorithm for supply chain reconfiguration and supplier selection," International Journal of Production Economics, Elsevier, vol. 124(1), pages 97-105, March.
    9. Verbiest, Floor & Cornelissens, Trijntje & Springael, Johan, 2019. "A matheuristic approach for the design of multiproduct batch plants with parallel production lines," European Journal of Operational Research, Elsevier, vol. 273(3), pages 933-947.
    10. Chateau, Jean-Pierre D., 1974. "La programmation déterministe du budget de capital : un modèle financier," L'Actualité Economique, Société Canadienne de Science Economique, vol. 50(3), pages 415-449, juillet.
    11. Christian Meier & Dennis Kundisch & Jochen Willeke, 2017. "Is it Worth the Effort?," Business & Information Systems Engineering: The International Journal of WIRTSCHAFTSINFORMATIK, Springer;Gesellschaft für Informatik e.V. (GI), vol. 59(2), pages 81-95, April.
    12. Biswas, Debajyoti & Alfandari, Laurent, 2022. "Designing an optimal sequence of non‐pharmaceutical interventions for controlling COVID-19," European Journal of Operational Research, Elsevier, vol. 303(3), pages 1372-1391.
    13. Ricardo M. Lima & Ignacio E. Grossmann, 2017. "On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study," Computational Optimization and Applications, Springer, vol. 66(1), pages 1-37, January.
    14. Jih-Jeng Huang, 2016. "Resource decision making for vertical and horizontal integration problems in an enterprise," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 67(11), pages 1363-1372, November.
    15. Andrés Gómez & Oleg A. Prokopyev, 2021. "A Mixed-Integer Fractional Optimization Approach to Best Subset Selection," INFORMS Journal on Computing, INFORMS, vol. 33(2), pages 551-565, May.
    16. Dimitris Bertsimas & Ryan Cory-Wright, 2022. "A Scalable Algorithm for Sparse Portfolio Selection," INFORMS Journal on Computing, INFORMS, vol. 34(3), pages 1489-1511, May.
    17. Wakui, Tetsuya & Akai, Kazuki & Yokoyama, Ryohei, 2022. "Shrinking and receding horizon approaches for long-term operational planning of energy storage and supply systems," Energy, Elsevier, vol. 239(PD).
    18. Alkhamis, Talal M. & Hasan, Merza & Ahmed, Mohamed A., 1998. "Simulated annealing for the unconstrained quadratic pseudo-Boolean function," European Journal of Operational Research, Elsevier, vol. 108(3), pages 641-652, August.
    19. Bagloee, Saeed Asadi & Asadi, Mohsen, 2015. "Prioritizing road extension projects with interdependent benefits under time constraint," Transportation Research Part A: Policy and Practice, Elsevier, vol. 75(C), pages 196-216.
    20. Parreño, Francisco & Álvarez-Valdés, Ramón & Martí, Rafael, 2021. "Measuring diversity. A review and an empirical analysis," European Journal of Operational Research, Elsevier, vol. 289(2), pages 515-532.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:95:y:1996:i:1:p:231-236. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

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