Remarks on 0-1 Optimization Problems with Superincreasing and Superdecreasing Objective Functions

DOI10.1007/978-3-642-04802-9_9zbMath1189.90100OpenAlexW1831243518MaRDI QIDQ3557805

Marian Chudy

Publication date: 23 April 2010

Published in: IFIP Advances in Information and Communication Technology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-04802-9_9

zbMATH Keywords

complexitiesupper and lower boundpolynomial procedure

Mathematics Subject Classification ID

Boolean programming (90C09)

Cites Work

• Unnamed Item
• Knapsack problems for NL
• The iterated mod problem
• On variations of the subset sum problem
• A best first search exact algorithm for the multiple-choice multidimensional knapsack problem
• An Exact Algorithm for the Two-Constraint 0–1 Knapsack Problem

This page was built for publication: Remarks on 0-1 Optimization Problems with Superincreasing and Superdecreasing Objective Functions