Carregant...
Carregant...

Vés al contingut (premeu Retorn)

A branch and bound approach for the capacitated plant location problem using cuts from the partial convex hull

Autor
Barcelo, J.
Tipus d'activitat
Document cientificotècnic
Data
1984
Codi
RR 84/06
Repositori
http://hdl.handle.net/2117/111090 Obrir en finestra nova
Resum
The efficient solution of capacitated plant location problems usually requires the development of specific software mainly when the problems are pure integer ones, standard mathematical programming codes being highly inefficient. The normal formulation of these problems includes different kinds of constraints which are of knapsack type. This fact can be used in connection with the procedures developped by Balas, Padberg and others, of computing facets of the knapsack polytopes. Procedures which ...
Citació
Barcelo, J. "A branch and bound approach for the capacitated plant location problem using cuts from the partial convex hull". 1984.
Grup de recerca
IMP - Information Modeling and Processing

Participants

  • Barcelo Bugeda, Jaime  (autor)

Arxius