Approximate And Exact Solution Methods For The Hyperbolic 0-1 Knapsack Problem

DOI10.1080/03155986.2002.11732644MaRDI QIDQ5888241zbMATH OpenOpenAlexFDO

Authors Alain Billionnet

Publication date 24 April 2023

Published in INFOR: Information Systems and Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/03155986.2002.11732644

zbMATH Keywords

approximate solutionscomputational experimentsexact solutionsfractional 0-1 programminghyperbolic 0-1 knapsack problemmixed integer programming

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Recommendations

• An exact algorithm for 0-1 polynomial Knapsack problems
• 0-1 knapsack problems
• Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
• scientific article; zbMATH DE number 1501879
• Exact and approximate algorithms for discounted \(\{0\text{-}1\}\) knapsack problem

Cited in

(4)

• Mixed integer programming for the 0--1 maximum probability model.
• Fractional 0-1 programming: applications and algorithms
• Hybrid rounding techniques for knapsack problems
• scientific article; zbMATH DE number 7122316 (Why is no real title available?)

This page was built for publication: Approximate And Exact Solution Methods For The Hyperbolic 0-1 Knapsack Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5888241)