//-->
A heuristic algorithm for a pseudo-cyclic delivery problem under window constraints
Palleta, Giuseppe, (1987)
Solving 0-1 integer programming problems arising from large scale planning models
Johnson, Ellis L., (1985)
A new Lagrangian relaxation approach to the generalized assignment problem
Jörnsten, Kurt, (1986)
Advanced greedy algorithms and surrogate constraint methods for linear and quadratic knapsack and covering problems
Glover, Fred, (2013)
Convexity cuts and cut search
Glover, Fred, (1973)
Further reduction zero-one polynominal programming problems to zero-one linear programming problems