Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints

From MaRDI portal
Revision as of 04:28, 1 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1651695

DOI10.1016/J.EJOR.2018.04.013zbMath1403.90514OpenAlexW2796556323WikidataQ130037988 ScholiaQ130037988MaRDI QIDQ1651695

Nir Halman, Vitaly A. Strusevich, Hans Kellerer

Publication date: 12 July 2018

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2018.04.013




Related Items (4)




Cites Work




This page was built for publication: Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints