The quadratic 0-1 knapsack problem with series-parallel support

Operations Research Letters

Volumn 30, Issue 3, 2002, Pages 159-166

  Rader Jr , David J ^a   Woeginger, Gerhard J ^b  

^a ROSE HULMAN INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITY OF TWENTE   (Netherlands)

Author keywords

Approximability; Approximation scheme; Computational complexity; Dynamic programming; Knapsack problem

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; DYNAMIC PROGRAMMING; GRAPH THEORY; POLYNOMIALS; PROBLEM SOLVING;

KNAPSACK PROBLEMS;

OPERATIONS RESEARCH;

EID: 0036600875     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6377(02)00122-0     Document Type: Article

References (19)

1. Linear programming for the 0-1 quadratic knapsack problem
2. A new upper-bound for the 0-1 quadratic knapsack problem
3. Exact solution of the quadratic knapsack problem
4. Best network flow bounds for the quadratic Knapsack problem
5. Topology of series-parallel networks
6. Quadratic knapsack problems
7. On the supermodular knapsack problem
8. Efficient methods for solving quadratic 0-1 knapsack problems
9. Quadratic knapsack relaxations using cutting planes and semidefinite programming
10. Fast approximation algorithms for the knapsack and sum of subset problems
11. Min-cut clustering
12. Fast approximation schemes for knapsack problems
13. Lagrangean methods for the 0-1 quadratic knapsack problem
14. Valid inequalities and facets of the quadratic 0-1 knapsack polytope
15. Linear-time computability of combinatorial problems on series-parallel graphs
16. The recognition of series-parallel digraphs
17. Mathematical methods of site selection for electronic message systems (EMS)