| On Local Convergence of Stochastic Global Optimization Algorithms | 0 | 0.34 | 2021 |
| On New Methods To Construct Lower Bounds In Simplicial Branch And Bound Based On Interval Arithmetic | 0 | 0.34 | 2021 |
| The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming | 0 | 0.34 | 2020 |
| Preface: Special issue Europt 2018 | 0 | 0.34 | 2020 |
| On offshore wind farm maintenance scheduling for decision support on vessel fleet composition | 0 | 0.34 | 2019 |
| A CUDA approach to compute perishable inventory control policies using value iteration. | 0 | 0.34 | 2019 |
| On Trajectory Optimization Of An Electric Vehicle | 0 | 0.34 | 2019 |
| Parallel algorithms for computing the smallest binary tree size in unit simplex refinement. | 1 | 0.40 | 2018 |
| Decomposition-based Inner- and Outer-Refinement Algorithms for Global Optimization. | 0 | 0.34 | 2018 |
| A Simple Heuristic For Perishable Item Inventory Control Under Non-Stationary Stochastic Demand | 5 | 0.44 | 2017 |
| Accelerating an algorithm for perishable inventory control on heterogeneous platforms. | 1 | 0.43 | 2017 |
| Generating a smallest binary tree by proper selection of the longest edges to bisect in a unit simplex refinement. | 1 | 0.36 | 2017 |
| On parallel Branch and Bound frameworks for Global Optimization. | 1 | 0.35 | 2017 |
| On Benchmarking Stochastic Global Optimization Algorithms | 0 | 0.34 | 2016 |
| On Bisecting The Unit Simplex Using Various Distance Norms | 0 | 0.34 | 2016 |
| On refinement of the unit simplex using regular simplices | 1 | 0.37 | 2016 |
| Application of stochastic programming to reduce uncertainty in quality-based supply planning of slaughterhouses. | 0 | 0.34 | 2016 |
| On competition in a Stackelberg location-design model with deterministic supplier choice | 0 | 0.34 | 2016 |
| Preface: special issue MAGO 2014. | 0 | 0.34 | 2016 |
| Pipe Replacement In A Water Supply Network: Coordinated Versus Uncoordinated Replacement And Budget Effects | 0 | 0.34 | 2016 |
| Pooling Problems with Polynomial-Time Algorithms. | 1 | 0.35 | 2016 |
| On production planning and scheduling in food processing industry: Modelling non-triangular setups andproduct decay. | 0 | 0.34 | 2016 |
| Bi-criterion procedures to support logistics decision making: cost and uncertainty | 0 | 0.34 | 2015 |
| On Computing Order Quantities For Perishable Inventory Control With Non-Stationary Demand | 2 | 0.39 | 2015 |
| Sdp In Inventory Control: Non-Stationary Demand And Service Level Constraints | 0 | 0.34 | 2015 |
| Heuristics For Longest Edge Selection In Simplicial Branch And Bound | 1 | 0.36 | 2015 |
| On The Minimum Number Of Simplex Shapes In Longest Edge Bisection Refinement Of A Regular N-Simplex | 3 | 0.45 | 2015 |
| Traffic Responsive Control of Intersections with Predicted Arrival Times: A Markovian Approach. | 6 | 0.59 | 2014 |
| Data Parallelism in Traffic Control Tables with Arrival Information. | 1 | 0.41 | 2014 |
| Dynamic and Hierarchical Load-Balancing Techniques Applied to Parallel Branch-and-Bound Methods | 3 | 0.51 | 2013 |
| Recent insights in Huff-like competitive facility location and design. | 8 | 0.56 | 2013 |
| On interval branch-and-bound for additively separable functions with common variables. | 1 | 0.36 | 2013 |
| On Computational Aspects of a Regular n-Simplex Bisection | 2 | 0.44 | 2013 |
| On a Hybrid MPI-Pthread Approach for Simplicial Branch-and-Bound | 3 | 0.41 | 2013 |
| On the minimum volume simplex enclosure problem for estimating a linear mixing model. | 3 | 0.39 | 2013 |
| On estimating workload in interval branch-and-bound global optimization algorithms. | 5 | 0.61 | 2013 |
| Simulation to discover structure in optimal dynamic control policies | 0 | 0.34 | 2012 |
| Global optimization simplex bisection revisited based on considerations by reiner horst | 5 | 0.51 | 2012 |
| Performance driven cooperation between kernel and auto-tuning multi-threaded interval b&b applications | 2 | 0.41 | 2012 |
| A New Minimum-Volume Enclosing Algorithm for Endmember Identification and Abundance Estimation in Hyperspectral Data | 1 | 0.35 | 2012 |
| On lower bounds using additively separable terms in interval b&b | 0 | 0.34 | 2012 |
| On solving a stochastic programming model for perishable inventory control | 3 | 0.49 | 2012 |
| Locating a competitive facility in the plane with a robustness criterion. | 6 | 0.46 | 2011 |
| On Nash equilibria of a competitive location-design problem | 15 | 0.72 | 2011 |
| Preface: Special issue SAGO08 | 0 | 0.34 | 2011 |
| Minimum volume simplicial enclosure for spectral unmixing of remotely sensed hyperspectral data | 0 | 0.34 | 2010 |
| On a branch-and-bound approach for a Huff-like Stackelberg location problem | 13 | 0.85 | 2009 |
| The smoothed Monte Carlo method in robustness optimization | 0 | 0.34 | 2008 |
| The semi-continuous quadratic mixture design problem: Description and branch-and-bound approach | 7 | 0.70 | 2008 |
| Methods for computing Nash equilibria of a location-quantity game | 3 | 0.49 | 2008 |
