Labb M.

M. Labb

Information about the author M. Labb will soon be added to the site.
Found 7 papers in total
A branch-and-cut algorithm for the plant-cycle location problem
A branch-and-cut algorithm for the plant-cycle location problem
2004
The Plant-Cycle Location Problem (PCLP) is defined on a graph G = (I∪J, E) , where...
Polyhedral results for two-connected networks with bounded rings
Polyhedral results for two-connected networks with bounded rings
2002
We study the polyhedron associated with a network design problem which consists in...
The multi-level uncapacitated facility location problem is not submodular
The multi-level uncapacitated facility location problem is not submodular
1994
Unlike the Uncapacitated Facility Location Problem submodularity does not hold for the...
The multi-lefvel Uncapacitated Facility Location Problem is not submodular
The multi-lefvel Uncapacitated Facility Location Problem is not submodular
1993
Unlike the Uncapacitated Facility Location Problem submodularity does not hold for the...
Errata and comments on ‘Approximation algorithms for the capacitated plant allocation problem’
Errata and comments on ‘Approximation algorithms for the capacitated plant allocation problem’
1996
Dr. Mikhale Y. Kovalyov of the Belarus Academy of Sciences has pointed out two errors...
A general model for the uncapacitated facility and depot location problem
A general model for the uncapacitated facility and depot location problem
1994
This paper considers the problem of locating pairs of facilities and depots in order...
A note on a stochastic location problem
A note on a stochastic location problem
1993
In this note the authors give a short and easy proof of the equivalence of...
Papers per page: