Eligius M. T. Hendrix

Orcid: 0000-0003-1572-1436

Affiliations:
  • Wageningen University, Netherlands


According to our database1, Eligius M. T. Hendrix authored at least 93 papers between 1991 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On Dealing with Minima at the Border of a Simplicial Feasible Area in Simplicial Branch and Bound.
J. Optim. Theory Appl., November, 2024

On Optimizing Ensemble Models using Column Generation.
J. Optim. Theory Appl., November, 2024

On conceptualisation and an overview of learning path recommender systems in e-learning.
CoRR, 2024

On Polytopal Branch and Bound with Monotonicity.
Proceedings of the Computational Science and Its Applications - ICCSA 2024 Workshops, 2024

2023
Experiments with Active-Set LP Algorithms Allowing Basis Deficiency.
Comput., January, 2023

On Order Policies for a Perishable Product in Retail.
Informatica, 2023

2022
Separable Attention Network in Single- and Mixed-Precision Floating Point for Land-Cover Classification of Remote Sensing Images.
IEEE Geosci. Remote. Sens. Lett., 2022

On monotonicity and search strategies in face-based copositivity detection algorithms.
Central Eur. J. Oper. Res., 2022

On Active-Set LP Algorithms Allowing Basis Deficiency.
Proceedings of the Computational Science and Its Applications - ICCSA 2022 Workshops, 2022

On Computational Procedures for Optimising an Omni-Channel Inventory Control Model.
Proceedings of the Computational Science and Its Applications - ICCSA 2022 Workshops, 2022

On Monotonicity Detection in Simplicial Branch and Bound over a Simplex.
Proceedings of the Computational Science and Its Applications - ICCSA 2022 Workshops, 2022

2021
On derivative based bounding for simplicial branch and bound.
RAIRO Oper. Res., 2021

On new methods to construct lower bounds in simplicial branch and bound based on interval arithmetic.
J. Glob. Optim., 2021

A New Max-Min Convolutional Network for Hyperspectral Image Classification.
Proceedings of the 11th Workshop on Hyperspectral Imaging and Signal Processing: Evolution in Remote Sensing, 2021

Adapting Kernels for Hyperspectral Image Classification.
Proceedings of the IEEE International Geoscience and Remote Sensing Symposium, 2021

On Local Convergence of Stochastic Global Optimization Algorithms.
Proceedings of the Computational Science and Its Applications - ICCSA 2021, 2021

2020
Retailer replenishment policies with one-way consumer-based substitution to increase profit and reduce food waste.
Logist. Res., 2020

The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming.
J. Glob. Optim., 2020

Preface: Special issue Europt 2018.
J. Glob. Optim., 2020

Rotation Equivariant Convolutional Neural Networks for Hyperspectral Image Classification.
IEEE Access, 2020

A Resource Constraint Approach for One Global Constraint MINLP.
Proceedings of the Computational Science and Its Applications - ICCSA 2020, 2020

2019
A CUDA approach to compute perishable inventory control policies using value iteration.
J. Supercomput., 2019

On offshore wind farm maintenance scheduling for decision support on vessel fleet composition.
Eur. J. Oper. Res., 2019

On computing optimal policies in perishable inventory control using value iteration.
Comput. Math. Methods, 2019

On Trajectory Optimization of an Electric Vehicle.
Proceedings of the Computational Science and Its Applications - ICCSA 2019, 2019

2018
Parallel algorithms for computing the smallest binary tree size in unit simplex refinement.
J. Parallel Distributed Comput., 2018

Decomposition-based Inner- and Outer-Refinement Algorithms for Global Optimization.
J. Glob. Optim., 2018

2017
Accelerating an algorithm for perishable inventory control on heterogeneous platforms.
J. Parallel Distributed Comput., 2017

On parallel Branch and Bound frameworks for Global Optimization.
J. Glob. Optim., 2017

Generating a smallest binary tree by proper selection of the longest edges to bisect in a unit simplex refinement.
J. Comb. Optim., 2017

A simple heuristic for perishable item inventory control under non-stationary stochastic demand.
Int. J. Prod. Res., 2017

On Grid Aware Refinement of the Unit Hypercube and Simplex: Focus on the Complete Tree Size.
Proceedings of the Computational Science and Its Applications - ICCSA 2017, 2017

A model for optimal fleet composition of vessels for offshore wind farm maintenance.
Proceedings of the International Conference on Computational Science, 2017

2016
Pooling Problems with Polynomial-Time Algorithms.
J. Optim. Theory Appl., 2016

On refinement of the unit simplex using regular simplices.
J. Glob. Optim., 2016

Preface: special issue MAGO 2014.
J. Glob. Optim., 2016

On Bisecting the Unit Simplex Using Various Distance Norms.
Informatica, 2016

Pipe Replacement in a Water Supply Network: Coordinated Versus Uncoordinated Replacement and Budget Effects.
Informatica, 2016

On production planning and scheduling in food processing industry: Modelling non-triangular setups andproduct decay.
Comput. Oper. Res., 2016

Application of stochastic programming to reduce uncertainty in quality-based supply planning of slaughterhouses.
Ann. Oper. Res., 2016

On competition in a Stackelberg location-design model with deterministic supplier choice.
Ann. Oper. Res., 2016

2015
Bi-criterion procedures to support logistics decision making: cost and uncertainty.
J. Oper. Res. Soc., 2015

On Benchmarking Stochastic Global Optimization Algorithms.
Informatica, 2015

On the Minimum Number of Simplex Shapes in Longest Edge Bisection Refinement of a Regular n-Simplex.
Informatica, 2015

On heuristic bi-criterion methods for semi-obnoxious facility location.
Comput. Optim. Appl., 2015

SDP in Inventory Control: Non-stationary Demand and Service Level Constraints.
Proceedings of the Computational Science and Its Applications - ICCSA 2015, 2015

Heuristics for Longest Edge Selection in Simplicial Branch and Bound.
Proceedings of the Computational Science and Its Applications - ICCSA 2015, 2015

On Computing Order Quantities for Perishable Inventory Control with Non-stationary Demand.
Proceedings of the Computational Science and Its Applications - ICCSA 2015, 2015

A Sample-Based Method for Perishable Good Inventory Control with a Service Level Constraint.
Proceedings of the Computational Logistics - 6th International Conference, 2015

On a Pooling Problem with Fixed Network Size.
Proceedings of the Computational Logistics - 6th International Conference, 2015

2014
Traffic Responsive Control of Intersections with Predicted Arrival Times: A Markovian Approach.
Comput. Aided Civ. Infrastructure Eng., 2014

On Simplicial Longest Edge Bisection in Lipschitz Global Optimization.
Proceedings of the Computational Science and Its Applications - ICCSA 2014 - 14th International Conference, Guimarães, Portugal, June 30, 2014

On Modelling Approaches for Planning and Scheduling in Food Processing Industry.
Proceedings of the Computational Science and Its Applications - ICCSA 2014 - 14th International Conference, Guimarães, Portugal, June 30, 2014

Heuristics to Reduce the Number of Simplices in Longest Edge Bisection Refinement of a Regular n-Simplex.
Proceedings of the Computational Science and Its Applications - ICCSA 2014 - 14th International Conference, Guimarães, Portugal, June 30, 2014

Data Parallelism in Traffic Control Tables with Arrival Information.
Proceedings of the Euro-Par 2014: Parallel Processing Workshops, 2014

2013
A threaded approach of the quadratic bi-blending algorithm.
J. Supercomput., 2013

On the minimum volume simplex enclosure problem for estimating a linear mixing model.
J. Glob. Optim., 2013

On interval branch-and-bound for additively separable functions with common variables.
J. Glob. Optim., 2013

On estimating workload in interval branch-and-bound global optimization algorithms.
J. Glob. Optim., 2013

Recent insights in Huff-like competitive facility location and design.
Eur. J. Oper. Res., 2013

On a Hybrid MPI-Pthread Approach for Simplicial Branch-and-Bound.
Proceedings of the 2013 IEEE International Symposium on Parallel & Distributed Processing, 2013

Dynamic and Hierarchical Load-Balancing Techniques Applied to Parallel Branch-and-Bound Methods.
Proceedings of the Eighth International Conference on P2P, 2013

On Computational Aspects of a Regular n-Simplex Bisection.
Proceedings of the Eighth International Conference on P2P, 2013

2012
A New Minimum-Volume Enclosing Algorithm for Endmember Identification and Abundance Estimation in Hyperspectral Data.
IEEE Trans. Geosci. Remote. Sens., 2012

On Endmember Identification in Hyperspectral Images Without Pure Pixels: A Comparison of Algorithms.
J. Math. Imaging Vis., 2012

Simulation to discover structure in optimal dynamic control policies.
Proceedings of the Winter Simulation Conference, 2012

Performance Driven Cooperation between Kernel and Auto-tuning Multi-threaded Interval B&B Applications.
Proceedings of the Computational Science and Its Applications - ICCSA 2012, 2012

On Solving a Stochastic Programming Model for Perishable Inventory Control.
Proceedings of the Computational Science and Its Applications - ICCSA 2012, 2012

Global Optimization Simplex Bisection Revisited Based on Considerations by Reiner Horst.
Proceedings of the Computational Science and Its Applications - ICCSA 2012, 2012

On Lower Bounds Using Additively Separable Terms in Interval B&B.
Proceedings of the Computational Science and Its Applications - ICCSA 2012, 2012

2011
On determining the cover of a simplex by spheres centered at its vertices.
J. Glob. Optim., 2011

Preface: Special issue SAGO08.
J. Glob. Optim., 2011

On Nash equilibria of a competitive location-design problem.
Eur. J. Oper. Res., 2011

Locating a competitive facility in the plane with a robustness criterion.
Eur. J. Oper. Res., 2011

2010
Minimum volume simplicial enclosure for spectral unmixing of remotely sensed hyperspectral data.
Proceedings of the IEEE International Geoscience & Remote Sensing Symposium, 2010

2009
On a branch-and-bound approach for a Huff-like Stackelberg location problem.
OR Spectr., 2009

2008
The smoothed Monte Carlo method in robustness optimization.
Optim. Methods Softw., 2008

Branch-and-Bound interval global optimization on shared memory multiprocessors.
Optim. Methods Softw., 2008

The semi-continuous quadratic mixture design problem: Description and branch-and-bound approach.
Eur. J. Oper. Res., 2008

Methods for computing Nash equilibria of a location-quantity game.
Comput. Oper. Res., 2008

2007
Preface: Special issue Go05.
J. Glob. Optim., 2007

Infeasibility spheres for finding robust solutions of blending problems with quadratic constraints.
J. Glob. Optim., 2007

2006
Stability likelihood of coalitions in a two-stage cartel game: An estimation method.
Eur. J. Oper. Res., 2006

2005
On the Investigation of Stochastic Global Optimization Algorithms.
J. Glob. Optim., 2005

Matching Stochastic Algorithms to Objective Function Landscapes.
J. Glob. Optim., 2005

2002
On optimisation of agri chains by dynamic programming.
Eur. J. Oper. Res., 2002

2001
On success rates for controlled random search.
J. Glob. Optim., 2001

Generation and presentation of nearly optimal solutions for mixed-integer linear programming, applied to a case in farming system design.
Eur. J. Oper. Res., 2001

2000
On Uniform Covering, Adaptive Random Search and Raspberries.
J. Glob. Optim., 2000

Global Optimization Problems in Optimal Design of Experiments in Regression Models.
J. Glob. Optim., 2000

1999
Analysing production and environmental risks in arable farming systems: A mathematical approach.
Eur. J. Oper. Res., 1999

1996
Global optimization with a limited solution time.
J. Glob. Optim., 1996

1991
An application of Lipschitzian global optimization to product design.
J. Glob. Optim., 1991


  Loading...