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

A pegging approach to the precedence-constrained knapsack problem

Author

Listed:
  • You, Byungjun
  • Yamada, Takeo

Abstract

No abstract is available for this item.

Suggested Citation

  • You, Byungjun & Yamada, Takeo, 2007. "A pegging approach to the precedence-constrained knapsack problem," European Journal of Operational Research, Elsevier, vol. 183(2), pages 618-632, December.
    • Handle: RePEc:eee:ejores:v:183:y:2007:i:2:p:618-632
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(06)01064-2
    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. D. S. Johnson & K. A. Niemi, 1983. "On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees," Mathematics of Operations Research, INFORMS, vol. 8(1), pages 1-14, February.
    2. Dorit S. Hochbaum, 2004. "50th Anniversary Article: Selection, Provisioning, Shared Fixed Costs, Maximum Closure, and Implications on Algorithmic Methods Today," Management Science, INFORMS, vol. 50(6), pages 709-723, June.
    3. Giorgio P. Ingargiola & James F. Korsh, 1973. "Reduction Algorithm for Zero-One Single Knapsack Problems," Management Science, INFORMS, vol. 20(4-Part-I), pages 460-463, December.
    4. Geon Cho & Dong X. Shaw, 1997. "A Depth-First Dynamic Programming Algorithm for the Tree Knapsack Problem," INFORMS Journal on Computing, INFORMS, vol. 9(4), pages 431-438, November.
    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. Aslan, Ayse & Ursavas, Evrim & Romeijnders, Ward, 2023. "A Precedence Constrained Knapsack Problem with Uncertain Item Weights for Personalized Learning Systems," Omega, Elsevier, vol. 115(C).
    2. Yokoya, Daisuke & Duin, Cees W. & Yamada, Takeo, 2011. "A reduction approach to the repeated assignment problem," European Journal of Operational Research, Elsevier, vol. 210(2), pages 185-193, April.
    3. Lamghari, Amina & Dimitrakopoulos, Roussos, 2012. "A diversified Tabu search approach for the open-pit mine production scheduling problem with metal uncertainty," European Journal of Operational Research, Elsevier, vol. 222(3), pages 642-652.
    4. Pinker, Edieal & Szmerekovsky, Joseph & Tilson, Vera, 2014. "On the complexity of project scheduling to minimize exposed time," European Journal of Operational Research, Elsevier, vol. 237(2), pages 448-453.
    5. Mauricio Diéguez & Jaime Bustos & Carlos Cares, 0. "Mapping the variations for implementing information security controls to their operational research solutions," Information Systems and e-Business Management, Springer, vol. 0, pages 1-30.
    6. Mauricio Diéguez & Jaime Bustos & Carlos Cares, 2020. "Mapping the variations for implementing information security controls to their operational research solutions," Information Systems and e-Business Management, Springer, vol. 18(2), pages 157-186, June.
    7. Noriyoshi Sukegawa & Yoshitsugu Yamamoto & Liyuan Zhang, 2013. "Lagrangian relaxation and pegging test for the clique partitioning problem," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 7(4), pages 363-391, December.

    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. N. Samphaiboon & Y. Yamada, 2000. "Heuristic and Exact Algorithms for the Precedence-Constrained Knapsack Problem," Journal of Optimization Theory and Applications, Springer, vol. 105(3), pages 659-676, June.
    2. van der Merwe, D.J. & Hattingh, J.M., 2006. "Tree knapsack approaches for local access network design," European Journal of Operational Research, Elsevier, vol. 174(3), pages 1968-1978, November.
    3. Laurent Gourvès & Jérôme Monnot & Lydia Tlilane, 2018. "Subset sum problems with digraph constraints," Journal of Combinatorial Optimization, Springer, vol. 36(3), pages 937-964, October.
    4. Sofie Coene & Frits C. R. Spieksma & Gerhard J. Woeginger, 2011. "Charlemagne's Challenge: The Periodic Latency Problem," Operations Research, INFORMS, vol. 59(3), pages 674-683, June.
    5. 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.
    6. van de Leensel, R.L.J.M. & Flippo, O.E. & Koster, Arie M.C.A. & Kolen, A.W.J., 1996. "A dynamic programming algorithm for the local access network expansion problem," Research Memorandum 027, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    7. Ibrahim Kamel & Beizhong Chen, 2009. "A novel memory management scheme for residential gateways," Information Systems Frontiers, Springer, vol. 11(5), pages 491-500, November.
    8. W. Lambert & A. Newman, 2014. "Tailored Lagrangian Relaxation for the open pit block sequencing problem," Annals of Operations Research, Springer, vol. 222(1), pages 419-438, November.
    9. Kameshwaran, S. & Narahari, Y. & Rosa, Charles H. & Kulkarni, Devadatta M. & Tew, Jeffrey D., 2007. "Multiattribute electronic procurement using goal programming," European Journal of Operational Research, Elsevier, vol. 179(2), pages 518-536, June.
    10. Frank Gurski & Dominique Komander & Carolin Rehs, 2020. "Solutions for subset sum problems with special digraph constraints," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 92(2), pages 401-433, October.
    11. Kameshwaran, S. & Narahari, Y., 2009. "Nonconvex piecewise linear knapsack problems," European Journal of Operational Research, Elsevier, vol. 192(1), pages 56-68, January.
    12. Wang, Yu & Tang, Jiafu & Fung, Richard Y.K., 2014. "A column-generation-based heuristic algorithm for solving operating theater planning problem under stochastic demand and surgery cancellation risk," International Journal of Production Economics, Elsevier, vol. 158(C), pages 28-36.
    13. Steffen Goebbels & Frank Gurski & Dominique Komander, 2022. "The knapsack problem with special neighbor constraints," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 95(1), pages 1-34, February.
    14. Heungsoon Felix Lee & Daniel R. Dooly, 1996. "Algorithms for the constrained maximum‐weight connected graph problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(7), pages 985-1008, October.
    15. Peeters, Marc & Degraeve, Zeger, 2006. "An linear programming based lower bound for the simple assembly line balancing problem," European Journal of Operational Research, Elsevier, vol. 168(3), pages 716-731, February.
    16. David Pisinger, 1999. "Core Problems in Knapsack Algorithms," Operations Research, INFORMS, vol. 47(4), pages 570-575, August.
    17. Egor Ianovski, 2022. "Electing a committee with dominance constraints," Annals of Operations Research, Springer, vol. 318(2), pages 985-1000, November.
    18. Santiago Valdés Ravelo, 2022. "Approximation algorithms for simple assembly line balancing problems," Journal of Combinatorial Optimization, Springer, vol. 43(2), pages 432-443, March.
    19. Daniel Espinoza & Marcos Goycoolea & Eduardo Moreno & Alexandra Newman, 2013. "MineLib: a library of open pit mining problems," Annals of Operations Research, Springer, vol. 206(1), pages 93-114, July.
    20. Colombi, Marco & Mansini, Renata & Savelsbergh, Martin, 2017. "The generalized independent set problem: Polyhedral analysis and solution approaches," European Journal of Operational Research, Elsevier, vol. 260(1), pages 41-55.

    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:183:y:2007:i:2:p:618-632. 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.