A transformation of hard (equality constrained) knapsack problems into constrained shortest path problems

  • Authors:

  • Michel Minoux;Celso Ribeiro

  • Affiliations:

  • Centre National d'Études des Télécommunications, CNET-PAA/TIM/MTI, Issy-les-Moulineaux, 92131, France;Department of Electrical Engineering, Catholic University of Rio de Janeiro, Caixa Postal 38063, Gávea, Rio de Janeiro, 22452, Brazil

  • Venue:
  • Operations Research Letters
  • Year:
  • 1984

Quantified Score

Hi-index 0.00

Visualization

Abstract

The purpose of this paper is to show how hard (equality constrained) knapsack problems may be converted into constrained shortest path problems. Several directions along which such a transformation might be exploited for algorithmic purposes are suggested.