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

A bicriteria knapsack program for planning remediation of contaminated lightstation sites

Author

Listed:
  • Jenkins, Larry

Abstract

No abstract is available for this item.

Suggested Citation

  • Jenkins, Larry, 2002. "A bicriteria knapsack program for planning remediation of contaminated lightstation sites," European Journal of Operational Research, Elsevier, vol. 140(2), pages 427-433, July.
    • Handle: RePEc:eee:ejores:v:140:y:2002:i:2:p:427-433
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(02)00080-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. Moshe Eben-Chaime, 1996. "Parametric Solution for Linear Bicriteria Knapsack Models," Management Science, INFORMS, vol. 42(11), pages 1565-1575, 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. Rong, Aiying & Figueira, José Rui, 2013. "A reduction dynamic programming algorithm for the bi-objective integer knapsack problem," European Journal of Operational Research, Elsevier, vol. 231(2), pages 299-313.
    2. Rong, Aiying & Figueira, José Rui, 2014. "Dynamic programming algorithms for the bi-objective integer knapsack problem," European Journal of Operational Research, Elsevier, vol. 236(1), pages 85-99.
    3. Gomes da Silva, Carlos & Figueira, Jose & Climaco, Joao, 2007. "Integrating partial optimization with scatter search for solving bi-criteria {0, 1}-knapsack problems," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1656-1677, March.
    4. José Figueira & Luís Paquete & Marco Simões & Daniel Vanderpooten, 2013. "Algorithmic improvements on dynamic programming for the bi-objective {0,1} knapsack problem," Computational Optimization and Applications, Springer, vol. 56(1), pages 97-111, September.

    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. Yang, Ming-Hsien, 2001. "An efficient algorithm to allocate shelf space," European Journal of Operational Research, Elsevier, vol. 131(1), pages 107-118, May.
    2. Nir Halman & Mikhail Y. Kovalyov & Alain Quilliot, 2023. "Max–max, max–min, min–max and min–min knapsack problems with a parametric constraint," 4OR, Springer, vol. 21(2), pages 235-246, June.
    3. George Kozanidis, 2009. "Solving the linear multiple choice knapsack problem with two objectives: profit and equity," Computational Optimization and Applications, Springer, vol. 43(2), pages 261-294, June.
    4. Altannar Chinchuluun & Panos Pardalos, 2007. "A survey of recent developments in multiobjective optimization," Annals of Operations Research, Springer, vol. 154(1), pages 29-50, October.
    5. Stephan Helfrich & Arne Herzel & Stefan Ruzika & Clemens Thielen, 2022. "An approximation algorithm for a general class of multi-parametric optimization problems," Journal of Combinatorial Optimization, Springer, vol. 44(3), pages 1459-1494, October.

    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:140:y:2002:i:2:p:427-433. 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.