On a discrete nonlinear and nonseparable knapsack problem

On a discrete nonlinear and nonseparable knapsack problem

In this paper, a discrete knapsack problem with a convex but nonseparable objective function is considered. Relaxing the discrete requirements (and assuming nonnegativity), we show how the resulting problem can be solved by an efficient algorithm which solves a series of quadratic knapsack problems...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Operations research letters 1990, Vol.9 (4), p.233-237
1. Verfasser: Klastorin, T.D.
Format: Artikel
Sprache:eng
Schlagworte:
Applied sciences
Exact sciences and technology
knapsack problem
Mathematical programming
nonlinear programming
Operational research and scientific management
Operational research. Management science
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 237
container_issue 4
container_start_page 233
container_title Operations research letters
container_volume 9
creator Klastorin, T.D.
description In this paper, a discrete knapsack problem with a convex but nonseparable objective function is considered. Relaxing the discrete requirements (and assuming nonnegativity), we show how the resulting problem can be solved by an efficient algorithm which solves a series of quadratic knapsack problems in O( n) time. This algorithm forms the basis for a branch-and-bound algorithm, which is subsequently used to test the efficacy of a proposed heuristic. Computational results are presented.
doi_str_mv 10.1016/0167-6377(90)90067-F
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_25759053</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>016763779090067F</els_id><sourcerecordid>25759053</sourcerecordid><originalsourceid>FETCH-LOGICAL-c365t-44efdf36d5be78b4cd2a3f07938ee5663171f338cb29134a770979324cf36a533</originalsourceid><addsrcrecordid>eNp9kE9LwzAYxoMoOKffwEMvih6qSZM0zUWQ4VQY7KLn8DZ9C3FdOpNO8NubbkNvHkJ4eH_P--ch5JLRO0ZZeZ-eykuu1I2mt5rSpOZHZMIqVeRKlNUxmfwip-Qsxg9KqapYNSF66TPIGhdtwAEz3_vOeYSQgW9GFXEDAeoOs5WHTQS7yjahT3p9Tk5a6CJeHP4peZ8_vc1e8sXy-XX2uMgtL-WQC4Ft0_KykTWqqha2KYC3VGleIcqy5EyxlvPK1oVmXIBSVKdiIWwygeR8Sq73fdPczy3GwazTtth14LHfRlNIJTXdgWIP2tDHGLA1m-DWEL4No2bMyYwhmDEEo6nZ5WTmyXZ16A_RQtcG8NbFP6-uJONSJO5hz2E69sthMNE69BYbF9AOpund_4N-AAvoewY</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>25759053</pqid></control><display><type>article</type><title>On a discrete nonlinear and nonseparable knapsack problem</title><source>Elsevier ScienceDirect Journals</source><creator>Klastorin, T.D.</creator><creatorcontrib>Klastorin, T.D.</creatorcontrib><description>In this paper, a discrete knapsack problem with a convex but nonseparable objective function is considered. Relaxing the discrete requirements (and assuming nonnegativity), we show how the resulting problem can be solved by an efficient algorithm which solves a series of quadratic knapsack problems in O( n) time. This algorithm forms the basis for a branch-and-bound algorithm, which is subsequently used to test the efficacy of a proposed heuristic. Computational results are presented.</description><identifier>ISSN: 0167-6377</identifier><identifier>EISSN: 1872-7468</identifier><identifier>DOI: 10.1016/0167-6377(90)90067-F</identifier><identifier>CODEN: ORLED5</identifier><language>eng</language><publisher>Amsterdam: Elsevier B.V</publisher><subject>Applied sciences ; Exact sciences and technology ; knapsack problem ; Mathematical programming ; nonlinear programming ; Operational research and scientific management ; Operational research. Management science</subject><ispartof>Operations research letters, 1990, Vol.9 (4), p.233-237</ispartof><rights>1990</rights><rights>1991 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c365t-44efdf36d5be78b4cd2a3f07938ee5663171f338cb29134a770979324cf36a533</citedby><cites>FETCH-LOGICAL-c365t-44efdf36d5be78b4cd2a3f07938ee5663171f338cb29134a770979324cf36a533</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.sciencedirect.com/science/article/pii/016763779090067F$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,776,780,3537,4010,27900,27901,27902,65306</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&amp;idt=19851354$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Klastorin, T.D.</creatorcontrib><title>On a discrete nonlinear and nonseparable knapsack problem</title><title>Operations research letters</title><description>In this paper, a discrete knapsack problem with a convex but nonseparable objective function is considered. Relaxing the discrete requirements (and assuming nonnegativity), we show how the resulting problem can be solved by an efficient algorithm which solves a series of quadratic knapsack problems in O( n) time. This algorithm forms the basis for a branch-and-bound algorithm, which is subsequently used to test the efficacy of a proposed heuristic. Computational results are presented.</description><subject>Applied sciences</subject><subject>Exact sciences and technology</subject><subject>knapsack problem</subject><subject>Mathematical programming</subject><subject>nonlinear programming</subject><subject>Operational research and scientific management</subject><subject>Operational research. Management science</subject><issn>0167-6377</issn><issn>1872-7468</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1990</creationdate><recordtype>article</recordtype><recordid>eNp9kE9LwzAYxoMoOKffwEMvih6qSZM0zUWQ4VQY7KLn8DZ9C3FdOpNO8NubbkNvHkJ4eH_P--ch5JLRO0ZZeZ-eykuu1I2mt5rSpOZHZMIqVeRKlNUxmfwip-Qsxg9KqapYNSF66TPIGhdtwAEz3_vOeYSQgW9GFXEDAeoOs5WHTQS7yjahT3p9Tk5a6CJeHP4peZ8_vc1e8sXy-XX2uMgtL-WQC4Ft0_KykTWqqha2KYC3VGleIcqy5EyxlvPK1oVmXIBSVKdiIWwygeR8Sq73fdPczy3GwazTtth14LHfRlNIJTXdgWIP2tDHGLA1m-DWEL4No2bMyYwhmDEEo6nZ5WTmyXZ16A_RQtcG8NbFP6-uJONSJO5hz2E69sthMNE69BYbF9AOpund_4N-AAvoewY</recordid><startdate>1990</startdate><enddate>1990</enddate><creator>Klastorin, T.D.</creator><general>Elsevier B.V</general><general>Elsevier</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>1990</creationdate><title>On a discrete nonlinear and nonseparable knapsack problem</title><author>Klastorin, T.D.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c365t-44efdf36d5be78b4cd2a3f07938ee5663171f338cb29134a770979324cf36a533</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1990</creationdate><topic>Applied sciences</topic><topic>Exact sciences and technology</topic><topic>knapsack problem</topic><topic>Mathematical programming</topic><topic>nonlinear programming</topic><topic>Operational research and scientific management</topic><topic>Operational research. Management science</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Klastorin, T.D.</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Operations research letters</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Klastorin, T.D.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>On a discrete nonlinear and nonseparable knapsack problem</atitle><jtitle>Operations research letters</jtitle><date>1990</date><risdate>1990</risdate><volume>9</volume><issue>4</issue><spage>233</spage><epage>237</epage><pages>233-237</pages><issn>0167-6377</issn><eissn>1872-7468</eissn><coden>ORLED5</coden><abstract>In this paper, a discrete knapsack problem with a convex but nonseparable objective function is considered. Relaxing the discrete requirements (and assuming nonnegativity), we show how the resulting problem can be solved by an efficient algorithm which solves a series of quadratic knapsack problems in O( n) time. This algorithm forms the basis for a branch-and-bound algorithm, which is subsequently used to test the efficacy of a proposed heuristic. Computational results are presented.</abstract><cop>Amsterdam</cop><pub>Elsevier B.V</pub><doi>10.1016/0167-6377(90)90067-F</doi><tpages>5</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0167-6377
ispartof Operations research letters, 1990, Vol.9 (4), p.233-237
issn 0167-6377
1872-7468
language eng
recordid cdi_proquest_miscellaneous_25759053
source Elsevier ScienceDirect Journals
subjects Applied sciences
Exact sciences and technology
knapsack problem
Mathematical programming
nonlinear programming
Operational research and scientific management
Operational research. Management science
title On a discrete nonlinear and nonseparable knapsack problem
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-30T07%3A12%3A35IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=On%20a%20discrete%20nonlinear%20and%20nonseparable%20knapsack%20problem&rft.jtitle=Operations%20research%20letters&rft.au=Klastorin,%20T.D.&rft.date=1990&rft.volume=9&rft.issue=4&rft.spage=233&rft.epage=237&rft.pages=233-237&rft.issn=0167-6377&rft.eissn=1872-7468&rft.coden=ORLED5&rft_id=info:doi/10.1016/0167-6377(90)90067-F&rft_dat=%3Cproquest_cross%3E25759053%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=25759053&rft_id=info:pmid/&rft_els_id=016763779090067F&rfr_iscdi=true