On the nucleolus of the basic vehicle routing game

This publication has 11 references indexed in Scilit:

• A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
  Operations Research, 1992
• The selective travelling salesman problem
  Discrete Applied Mathematics, 1990
• Cost allocation: the traveling salesman, binpacking, and the knapsack
  Applied Mathematics and Computation, 1990
• The prize collecting traveling salesman problem
  Networks, 1989
• Geometric Properties of the Kernel, Nucleolus, and Related Solution Concepts
  Mathematics of Operations Research, 1979
• An upper bound for the zero-one knapsack problem and a branch and bound algorithm
  European Journal of Operational Research, 1977
• The Nucleolus of a Characteristic Function Game
  SIAM Journal on Applied Mathematics, 1969
• An Algorithm for the Vehicle-dispatching Problem
  Journal of the Operational Research Society, 1969
• On an Integer Program for a Delivery Problem
  Operations Research, 1964
• A Linear Programming Approach to the Cutting-Stock Problem
  Operations Research, 1961