IDEAS home Printed from https://ideas.repec.org/p/nwu/cmsems/106.html
   My bibliography  Save this paper

Brand-and-Bound Strategies for Dynamic Programming

Author

Listed:
  • Thomas L. Morin
  • Roy E. Marsten

Abstract

No abstract is available for this item.

Suggested Citation

  • Thomas L. Morin & Roy E. Marsten, 1974. "Brand-and-Bound Strategies for Dynamic Programming," Discussion Papers 106, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    • Handle: RePEc:nwu:cmsems:106
    as

    Download full text from publisher

    File URL: http://www.kellogg.northwestern.edu/research/math/papers/106.pdf
    File Function: main text
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. R. E. Bellman & L. A. Zadeh, 1970. "Decision-Making in a Fuzzy Environment," Management Science, INFORMS, vol. 17(4), pages 141-164, December.
    2. Bennett Fox, 1966. "Discrete Optimization Via Marginal Analysis," Management Science, INFORMS, vol. 13(3), pages 210-216, November.
    3. E. L. Lawler & D. E. Wood, 1966. "Branch-and-Bound Methods: A Survey," Operations Research, INFORMS, vol. 14(4), pages 699-719, August.
    4. William Karush, 1962. "A General Algorithm for the Optimal Distribution of Effort," Management Science, INFORMS, vol. 9(1), pages 50-72, October.
    5. M. Bellmore & G. L. Nemhauser, 1968. "The Traveling Salesman Problem: A Survey," Operations Research, INFORMS, vol. 16(3), pages 538-558, June.
    6. Michael Held & Richard M. Karp, 1970. "The Traveling-Salesman Problem and Minimum Spanning Trees," Operations Research, INFORMS, vol. 18(6), pages 1138-1162, December.
    7. G. Graves & A. Whinston, 1968. "A New Approach to Discrete Mathematical Programming," Management Science, INFORMS, vol. 15(3), pages 177-190, November.
    8. A. M. Geoffrion & R. E. Marsten, 1972. "Integer Programming Algorithms: A Framework and State-of-the-Art Survey," Management Science, INFORMS, vol. 18(9), pages 465-491, May.
    9. L. G. Mitten, 1970. "Branch-and-Bound Methods: General Formulation and Properties," Operations Research, INFORMS, vol. 18(1), pages 24-34, February.
    Full references (including those not matched with items on IDEAS)

    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. Jouglet, Antoine & Carlier, Jacques, 2011. "Dominance rules in combinatorial optimization problems," European Journal of Operational Research, Elsevier, vol. 212(3), pages 433-444, August.
    2. Jiancheng Long & Wai Yuen Szeto, 2019. "Link-Based System Optimum Dynamic Traffic Assignment Problems in General Networks," Operations Research, INFORMS, vol. 67(1), pages 167-182, January.
    3. Throsby, C.D., 1973. "New Methodologies in Agricultural Production Economics: a Review," 1973 Conference, August 19-30, 1973, São Paulo, Brazil 181385, International Association of Agricultural Economists.
    4. Lenstra, J. K. & Rinnooy Kan, A. H. G., 1980. "A Recursive Approach To The Implementation Of Enumerative Methods," Econometric Institute Archives 272202, Erasmus University Rotterdam.
    5. Stanisław Gawiejnowicz, 2020. "A review of four decades of time-dependent scheduling: main results, new topics, and open problems," Journal of Scheduling, Springer, vol. 23(1), pages 3-47, February.
    6. Rafael Blanquero & Emilio Carrizosa, 2013. "Solving the median problem with continuous demand on a network," Computational Optimization and Applications, Springer, vol. 56(3), pages 723-734, December.
    7. Vuciterna, Rina & Thomsen, Michael & Popp, Jennie & Musliu, Arben, 2017. "Efficiency and Competitiveness of Kosovo Raspberry Producers," 2017 Annual Meeting, February 4-7, 2017, Mobile, Alabama 252770, Southern Agricultural Economics Association.
    8. Gourav Gupta & Shivani & Deepika Rani, 2024. "Neutrosophic goal programming approach for multi-objective fixed-charge transportation problem with neutrosophic parameters," OPSEARCH, Springer;Operational Research Society of India, vol. 61(3), pages 1274-1300, September.
    9. Berna Tektas Sivrikaya & Ferhan Cebi & Hasan Hüseyin Turan & Nihat Kasap & Dursun Delen, 2017. "A fuzzy long-term investment planning model for a GenCo in a hybrid electricity market considering climate change impacts," Information Systems Frontiers, Springer, vol. 19(5), pages 975-991, October.
    10. Collan, Mikael, 2008. "New Method for Real Option Valuation Using Fuzzy Numbers," Working Papers 466, IAMSR, Åbo Akademi.
    11. Kim, Jong Soon & Whang, Kyu-Seung, 1998. "A tolerance approach to the fuzzy goal programming problems with unbalanced triangular membership function," European Journal of Operational Research, Elsevier, vol. 107(3), pages 614-624, June.
    12. Berna Tektaş & Hasan Hüseyin Turan & Nihat Kasap & Ferhan Çebi & Dursun Delen, 2022. "A Fuzzy Prescriptive Analytics Approach to Power Generation Capacity Planning," Energies, MDPI, vol. 15(9), pages 1-26, April.
    13. Chen, Lisa Y. & Wang, Tien-Chin, 2009. "Optimizing partners' choice in IS/IT outsourcing projects: The strategic decision of fuzzy VIKOR," International Journal of Production Economics, Elsevier, vol. 120(1), pages 233-242, July.
    14. Víctor G. Alfaro-García & Anna M. Gil-Lafuente & Gerardo G. Alfaro Calderón, 2017. "A fuzzy approach to a municipality grouping model towards creation of synergies," Computational and Mathematical Organization Theory, Springer, vol. 23(3), pages 391-408, September.
    15. Aghayi, Nazila & Maleki, Bentolhoda, 2016. "Efficiency measurement of DMUs with undesirable outputs under uncertainty based on the directional distance function: Application on bank industry," Energy, Elsevier, vol. 112(C), pages 376-387.
    16. Wenyao Niu & Yuan Rong & Liying Yu & Lu Huang, 2022. "A Novel Hybrid Group Decision Making Approach Based on EDAS and Regret Theory under a Fermatean Cubic Fuzzy Environment," Mathematics, MDPI, vol. 10(17), pages 1-30, August.
    17. de Andres-Sanchez, Jorge, 2007. "Claim reserving with fuzzy regression and Taylor's geometric separation method," Insurance: Mathematics and Economics, Elsevier, vol. 40(1), pages 145-163, January.
    18. Coşar Gözükırmızı & Metin Demiralp, 2019. "Solving ODEs by Obtaining Purely Second Degree Multinomials via Branch and Bound with Admissible Heuristic," Mathematics, MDPI, vol. 7(4), pages 1-23, April.
    19. Gábor Braun & Samuel Fiorini & Sebastian Pokutta & David Steurer, 2015. "Approximation Limits of Linear Programs (Beyond Hierarchies)," Mathematics of Operations Research, INFORMS, vol. 40(3), pages 756-772, March.
    20. Mikhailov, L., 2004. "A fuzzy approach to deriving priorities from interval pairwise comparison judgements," European Journal of Operational Research, Elsevier, vol. 159(3), pages 687-704, December.

    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:nwu:cmsems:106. 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: Fran Walker (email available below). General contact details of provider: https://edirc.repec.org/data/cmnwuus.html .

    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.