Article thumbnail

Lifting valid inequalities for the precedence constrained knapsack problem.

By R.L.M.J. van de Leensel, C.P.M. van Hoesel and J.J. van de Klundert
OAI identifier:

Suggested articles

Citations

  1. (1994). A branch-and-bound procedure for the tree knapsack problem. Research memorandum 94-11,
  2. (1987). A constrained capital budgeting problem with applications to repair kit selection.
  3. (1995). Combinatorial optimization models for production scheduling in automated manufacturing systems. In:
  4. (1979). Computers and intractability: a guide to the Theory of NPCompleteness. Freeman and Company,
  5. D.X.(1994): Reformulation and column generation for several telecommunication network design problems.
  6. (1983). Data structures and Network Algorithms.
  7. (1989). Easily computable facets of the knapsack polytope.
  8. (1978). Facets of the knapsack polytope from minimal covers.
  9. (1975). Facets of the knapsack polytope.
  10. (1988). Integer and Combinatorial Optimization.
  11. K.A.(1983): On knapsacks, partitions and a new dynamic programming technique for trees.
  12. (1997). Lifting cover inequalities for the precedence-constrained knapsack problem.
  13. (1995). Limited column generation for local access telecommunication network design – formulations, algorithms, and implementation.
  14. (1989). Modeling and solving an FMS part selection problem.
  15. (1992). ofliftedinequalities fortheknapsackproblem.
  16. (1995). Optimizing constrained subtrees of trees.
  17. (1993). Polyhedral results for the precedence constrained knapsack problem.
  18. Research Memorandum 94-15,
  19. (1983). Solving large-scale zero-one linear programming problems.
  20. (1928). Zum Hilbertschen Aufbau der Reellen Zahlen.

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.