default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEligius M. T. Hendrix
- > Home > Persons > Eligius M. T. Hendrix
Publications
- 2019
[j51]Eligius M. T. Hendrix
, Gloria Ortega López, René Haijema, Marjolein E. Buisman, Inmaculada García:
On computing optimal policies in perishable inventory control using value iteration. Comput. Math. Methods 1(4) (2019)- [j49]Gloria Ortega López, Eligius M. T. Hendrix, Inmaculada García:
A CUDA approach to compute perishable inventory control policies using value iteration. J. Supercomput. 75(3): 1580-1593 (2019) - [c21]Eligius M. T. Hendrix, Ana Maria A. C. Rocha, Inmaculada García:
On Trajectory Optimization of an Electric Vehicle. ICCSA (3) 2019: 249-260 - 2017
- [j45]Jose M. G. Salmerón, Guillermo Aparicio, Leocadio G. Casado, Inmaculada García, Eligius M. T. Hendrix, Boglárka G.-Tóth:
Generating a smallest binary tree by proper selection of the longest edges to bisect in a unit simplex refinement. J. Comb. Optim. 33(2): 389-402 (2017) - [j43]Alejandro G. Alcoba, Gloria Ortega López, Eligius M. T. Hendrix, Inmaculada García:
Accelerating an algorithm for perishable inventory control on heterogeneous platforms. J. Parallel Distributed Comput. 104: 12-18 (2017) - [c19]Leocadio G. Casado, Eligius M. T. Hendrix, Jose M. G. Salmerón, Boglárka G.-Tóth, Inmaculada García:
On Grid Aware Refinement of the Unit Hypercube and Simplex: Focus on the Complete Tree Size. ICCSA (3) 2017: 165-180 - 2016
- [j36]Boglárka G.-Tóth, Eligius M. T. Hendrix, Leocadio G. Casado, Inmaculada García:
On refinement of the unit simplex using regular simplices. J. Glob. Optim. 64(2): 305-323 (2016) - 2015
- [j33]Guillermo Aparicio, Leocadio G. Casado, Eligius M. T. Hendrix, Boglárka G.-Tóth, Inmaculada García:
On the Minimum Number of Simplex Shapes in Longest Edge Bisection Refinement of a Regular n-Simplex. Informatica 26(1): 17-32 (2015) - [c15]Alejandro G. Alcoba, Eligius M. T. Hendrix, Inmaculada García, Gloria Ortega López, Karin G. J. Pauls-Worm, René Haijema:
On Computing Order Quantities for Perishable Inventory Control with Non-stationary Demand. ICCSA (2) 2015: 429-444 - [c14]Juan F. R. Herrera, Leocadio G. Casado, Eligius M. T. Hendrix, Inmaculada García:
Heuristics for Longest Edge Selection in Simplicial Branch and Bound. ICCSA (2) 2015: 445-456 - 2014
- [c11]Juan F. R. Herrera, Leocadio G. Casado, Eligius M. T. Hendrix, Inmaculada García:
On Simplicial Longest Edge Bisection in Lipschitz Global Optimization. ICCSA (2) 2014: 104-114 - [c10]Guillermo Aparicio, Leocadio G. Casado, Boglárka G.-Tóth, Eligius M. T. Hendrix, Inmaculada García:
Heuristics to Reduce the Number of Simplices in Longest Edge Bisection Refinement of a Regular n-Simplex. ICCSA (2) 2014: 115-125 - 2013
- [j28]José L. Berenguel, Leocadio G. Casado, Inmaculada García, Eligius M. T. Hendrix:
On estimating workload in interval branch-and-bound global optimization algorithms. J. Glob. Optim. 56(3): 821-844 (2013) - [j27]Eligius M. T. Hendrix, Inmaculada García, Javier Plaza, Antonio Plaza:
On the minimum volume simplex enclosure problem for estimating a linear mixing model. J. Glob. Optim. 56(3): 957-970 (2013) - [j26]José L. Berenguel, Leocadio G. Casado, Inmaculada García, Eligius M. T. Hendrix, Frédéric Messine:
On interval branch-and-bound for additively separable functions with common variables. J. Glob. Optim. 56(3): 1101-1121 (2013) - [j25]Juan F. R. Herrera, Leocadio G. Casado, Eligius M. T. Hendrix, Inmaculada García:
A threaded approach of the quadratic bi-blending algorithm. J. Supercomput. 64(1): 38-48 (2013) - [c8]Guillermo Aparicio, Leocadio G. Casado, Eligius M. T. Hendrix, Inmaculada García, Boglárka Tóth:
On Computational Aspects of a Regular n-Simplex Bisection. 3PGCIC 2013: 513-518 - 2012
- [j24]Javier Plaza, Eligius M. T. Hendrix, Inmaculada García, Gabriel Martín, Antonio Plaza:
On Endmember Identification in Hyperspectral Images Without Pure Pixels: A Comparison of Algorithms. J. Math. Imaging Vis. 42(2-3): 163-175 (2012) - [j23]Eligius M. T. Hendrix, Inmaculada García, Javier Plaza, Gabriel Martín, Antonio Plaza:
A New Minimum-Volume Enclosing Algorithm for Endmember Identification and Abundance Estimation in Hyperspectral Data. IEEE Trans. Geosci. Remote. Sens. 50(7): 2744-2757 (2012) - [c5]Juan Francisco Sanjuan-Estrada, Leocadio G. Casado, Inmaculada García, Eligius M. T. Hendrix:
Performance Driven Cooperation between Kernel and Auto-tuning Multi-threaded Interval B&B Applications. ICCSA (1) 2012: 57-70 - [c4]José L. Berenguel, Leocadio G. Casado, Inmaculada García, Eligius M. T. Hendrix, Frédéric Messine:
On Lower Bounds Using Additively Separable Terms in Interval B&B. ICCSA (3) 2012: 119-132 - 2011
- [j19]Leocadio G. Casado, Inmaculada García, Boglárka G.-Tóth, Eligius M. T. Hendrix:
On determining the cover of a simplex by spheres centered at its vertices. J. Glob. Optim. 50(4): 645-655 (2011) - 2010
- [c1]Eligius M. T. Hendrix, Inmaculada García, Javier Plaza, Antonio J. Plaza:
Minimum volume simplicial enclosure for spectral unmixing of remotely sensed hyperspectral data. IGARSS 2010: 193-196 - 2008
- [j16]Eligius M. T. Hendrix, Leocadio G. Casado, Inmaculada García:
The semi-continuous quadratic mixture design problem: Description and branch-and-bound approach. Eur. J. Oper. Res. 191(3): 803-815 (2008) - [j15]Leocadio G. Casado, J. A. Martínez, Inmaculada García, Eligius M. T. Hendrix:
Branch-and-Bound interval global optimization on shared memory multiprocessors. Optim. Methods Softw. 23(5): 689-701 (2008) - 2007
- [j13]Inmaculada García, Eligius M. T. Hendrix:
Preface: Special issue Go05. J. Glob. Optim. 38(2): 161-162 (2007) - [j12]Leocadio G. Casado, Eligius M. T. Hendrix, Inmaculada García:
Infeasibility spheres for finding robust solutions of blending problems with quadratic constraints. J. Glob. Optim. 39(4): 577-593 (2007) - 2001
- [j6]Eligius M. T. Hendrix, Pilar Martínez Ortigosa, Inmaculada García:
On success rates for controlled random search. J. Glob. Optim. 21(3): 239-263 (2001)
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-10 02:05 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
