Loading...
Loading...

Go to the content (press return)

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

Author
Barcelo, J.
Type of activity
Report
Date
1984
Code
RR 84/06
Repository
http://hdl.handle.net/2117/111090 Open in new window
Abstract
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 ...
Citation
Barcelo, J. "A branch and bound approach for the capacitated plant location problem using cuts from the partial convex hull". 1984.
Group of research
IMP - Information Modelling and Processing
inLab FIB

Participants

Attachments