The SCEAS System
| |||||||

## Search the dblp DataBase
Alfredo Marín:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Alfredo Marín
**Formulating and solving splittable capacitated multiple allocation hub location problems.**[Citation Graph (0, 0)][DBLP] Computers & OR, 2005, v:32, n:, pp:3093-3109 [Journal] - Alfredo Marín, Blas Pelegrín
**A branch-and-bound algorithm for the transportation problem with location of**[Citation Graph (0, 0)][DBLP]*p*transshipment points. Computers & OR, 1997, v:24, n:7, pp:659-678 [Journal] - Lázaro Cánovas, Mercedes Landete, Alfredo Marín
**On the facets of the simple plant location packing polytope.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2002, v:124, n:1-3, pp:27-53 [Journal] - Lázaro Cánovas, Mercedes Landete, Alfredo Marín
**New facets for the set packing polytope.**[Citation Graph (0, 0)][DBLP] Oper. Res. Lett., 2000, v:27, n:4, pp:153-161 [Journal] - Lázaro Cánovas, Sergio García, Martine Labbé, Alfredo Marín
**A strengthened formulation for the simple plant location problem with order.**[Citation Graph (0, 0)][DBLP] Oper. Res. Lett., 2007, v:35, n:2, pp:141-150 [Journal] - Lázaro Cánovas, Mercedes Landete, Alfredo Marín
**Facet Obtaining Procedures for Set Packing Problems.**[Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 2002, v:16, n:1, pp:127-155 [Journal] - Alfredo Marín, Lázaro Cánovas, Mercedes Landete
**New formulations for the uncapacitated multiple allocation hub location problem.**[Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2006, v:172, n:1, pp:274-292 [Journal] - Lázaro Cánovas, Sergio García, Alfredo Marín
**Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique.**[Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2007, v:179, n:3, pp:990-1007 [Journal] - Alfredo Marín
**Lower bounds for the two-stage uncapacitated facility location problem.**[Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2007, v:179, n:3, pp:1126-1142 [Journal] **A Flexible Model and Efficient Solution Strategies for Discrete Location Problems.**[Citation Graph (, )][DBLP]**New trends in locational analysis.**[Citation Graph (, )][DBLP]**A comparison of formulations and solution methods for the minimum-envy location problem.**[Citation Graph (, )][DBLP]**Tight bounds from a path based formulation for the tree of hub location problem.**[Citation Graph (, )][DBLP]**A flexible model and efficient solution strategies for discrete location problems.**[Citation Graph (, )][DBLP]**A branch-and-cut algorithm for the Winner Determination Problem.**[Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.003secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |