An exact algorithm for the 0-1 linear knapsack problem with a single continuous variable

DOI10.1007/s10898-010-9642-5zbMath1229.90167OpenAlexW2041673501WikidataQ57931977 ScholiaQ57931977MaRDI QIDQ645559

Geng Lin, M. Montaz Ali, Wen-Xing Zhu

Publication date: 8 November 2011

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-010-9642-5

zbMATH Keywords

branch and boundknapsack problemmixed integer programming

Mathematics Subject Classification ID

Mixed integer programming (90C11) Combinatorial optimization (90C27)

Related Items (2)

Approximation algorithms on 0--1 linear knapsack problem with a single continuous variable ⋮ Least-Cost Influence Maximization on Social Networks

Uses Software

• MINTO
• Knapsack
• Quicksort

Cites Work

• Unnamed Item
• Unnamed Item
• The 0-1 knapsack problem with a single continuous variable
• An expanding-core algorithm for the exact \(0-1\) knapsack problem
• On the facets of the mixed-integer knapsack polyhedron
• New trends in exact algorithms for the \(0-1\) knapsack problem
• Strengthening Chvátal-Gomory cuts and Gomory fractional cuts
• A lift-and-project cutting plane algorithm for mixed 0-1 programs
• Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
• Aggregation and Mixed Integer Rounding to Solve MIPs
• On the complexity of integer programming
• Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
• Quicksort

This page was built for publication: An exact algorithm for the 0-1 linear knapsack problem with a single continuous variable