Blas Pelegrín

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Alfredo Marín 0001

> Home > Persons > Blas Pelegrín

Publications

2008
[j15]
- view
  authority control:
- export record
  dblp key:
  - journals/cor/ArifusalemBBCCDEGHHKKKLMMMNNP08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cor/ArifusalemBBCCDEGHHKKKLMMMNNP08
S. Arifusalem, Stefano Benati, Brian Boffey, Teresa Cáceres, Dietmar Cieslik, Zvi Drezner, Horst A. Eiselt, Ioannis Giannikos, Horst W. Hamacher, John M. Hodgson, Jörg Kalcsics, Kathrin Klamroth, Olivier Klopfenstein, Mercedes Landete, Maria Cruz López de los Mozos Martin, Alfredo Marín, Juan A. Mesa, Malick M. Ndiaye, Stefan Nickel, Blas Pelegrín:
New trends in locational analysis. Comput. Oper. Res. 35(3): 649-650 (2008)
1999
[j4]
- view
  authority control:
- export record
  dblp key:
  - journals/anor/MarinP99
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/anor/MarinP99
Alfredo Marín, Blas Pelegrín:
Applying Lagrangian relaxation to the resolution of two-stage location problems. Ann. Oper. Res. 86: 179-198 (1999)
1997
[j1]
- view
  authority control:
- export record
  dblp key:
  - journals/cor/MarinP97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cor/MarinP97
Alfredo Marín, Blas Pelegrín:
A branch-and-bound algorithm for the transportation problem with location of p transshipment points. Comput. Oper. Res. 24(7): 659-678 (1997)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.