| Publication | Date of Publication | Type |
|---|
| A new approach to the multiple obnoxious facility location problem based on combinatorial and continuous tools | 2024-04-25 | Paper |
| Tool switching problems with tool order constraints | 2024-02-27 | Paper |
| A new technique to derive tight convex underestimators (sometimes envelopes) | 2024-02-16 | Paper |
| Is time-optimal speed planning under jerk constraints a convex problem? | 2023-10-11 | Paper |
| Solution Algorithms for the Bounded Acceleration Shortest Path Problem | 2023-09-28 | Paper |
| Tool switching problems in the context of overlay printing with multiple colours | 2023-08-03 | Paper |
| (Global) optimization: historical notes and recent developments | 2023-07-12 | Paper |
| KKT-based primal-dual exactness conditions for the Shor relaxation | 2023-06-28 | Paper |
| Sharp and Fast Bounds for the Celis-Dennis-Tapia Problem | 2023-06-27 | Paper |
| Fix and Bound: An efficient approach for solving large-scale quadratic programming problems with box constraints | 2022-11-16 | Paper |
| Shortest path with acceleration constraints: complexity and approximation algorithms | 2022-10-04 | Paper |
| A computational study on QP problems with general linear constraints | 2022-06-10 | Paper |
| Exact and approximate results for convex envelopes of special structured functions over simplices | 2022-05-25 | Paper |
| A Graph-Based Algorithm for Optimal Control of Switched Systems:An Application to Car Parking | 2022-02-24 | Paper |
| Computing mixed strategies equilibria in presence of switching costs by the solution of nonconvex QP problems | 2021-08-09 | Paper |
| A sequential approach for speed planning under jerk constraints | 2021-05-31 | Paper |
| A solution of the minimum-time speed planning problem based on lattice theory | 2020-09-15 | Paper |
| Efficient local search procedures for quadratic fractional programming problems | 2020-04-07 | Paper |
| Convex envelope of bivariate cubic functions over rectangular regions | 2020-02-28 | Paper |
| Convergence analysis of spatial-sampling-based algorithms for time-optimal smooth velocity planning | 2020-02-26 | Paper |
| Graph-based algorithms for the efficient solution of optimization problems involving monotone functions | 2019-06-13 | Paper |
| A new branch-and-bound algorithm for standard quadratic programming problems | 2019-01-14 | Paper |
| Convex envelopes of bivariate functions through the solution of KKT systems | 2018-12-21 | Paper |
| Convex envelopes of separable functions over regions defined by separable functions of the same type | 2018-12-18 | Paper |
| Some results for quadratic problems with one or two quadratic constraints | 2018-10-01 | Paper |
| On the Complexity of Optimal Power Allocation in a Multi-Tone Multiuser Communication System | 2018-06-27 | Paper |
| Time-optimal velocity planning by a bound-tightening technique | 2018-05-25 | Paper |
| Corrigendum to: ``An optimal complexity algorithm for minimum-time velocity planning | 2017-11-17 | Paper |
| An optimal complexity algorithm for minimum-time velocity planning | 2017-09-29 | Paper |
| On the complexity of quadratic programming with two quadratic constraints | 2017-07-21 | Paper |
| Global Optimization Approaches for Optimal Trajectory Planning | 2017-06-29 | Paper |
| Polyhedral subdivisions and functional forms for the convex envelopes of bilinear, fractional and other bivariate functions over general polytopes | 2017-04-27 | Paper |
| Convex Envelopes of Some Quadratic Functions over the n-Dimensional Unit Simplex | 2017-01-13 | Paper |
| Computational investigation of simple memetic approaches for continuous global optimization | 2016-11-17 | Paper |
| Differential evolution methods based on local searches | 2016-11-10 | Paper |
| Exactness conditions for an SDP relaxation of the extended trust region problem | 2016-09-21 | Paper |
| Non polyhedral convex envelopes for 1-convex functions | 2016-09-15 | Paper |
| Global optimization based on local searches | 2016-07-22 | Paper |
| Theoretical and computational results about optimality-based domain reductions | 2016-05-25 | Paper |
| Alternative branching rules for some nonconvex problems | 2015-09-04 | Paper |
| Improving upper bounds for the clique number by non-valid inequalities | 2015-04-16 | Paper |
| (Non) convergence results for the differential evolution method | 2015-03-25 | Paper |
| A technique to derive the analytical form of convex envelopes for some bivariate functions | 2014-07-04 | Paper |
| On convex envelopes for bivariate functions over polytopes | 2014-06-02 | Paper |
| Computing the value of the convex envelope of quadratic forms over polytopes through a semidefinite program | 2014-05-14 | Paper |
| Global optimization based on local searches | 2014-03-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2864120 | 2013-12-05 | Paper |
| Global Optimization for Atomic Cluster Distance Geometry Problems | 2013-07-29 | Paper |
| Optimization and homotopy methods for the Gibbs free energy of simple magmatic mixtures | 2013-06-26 | Paper |
| Branch and cut algorithms for detecting critical nodes in undirected graphs | 2013-02-18 | Paper |
| Approximation algorithm for a class of global optimization problems | 2013-02-01 | Paper |
| Local search based heuristics for global optimization: atomic clusters and beyond | 2012-12-29 | Paper |
| Separable standard quadratic optimization problems | 2012-11-07 | Paper |
| Disk Packing in a Square: A New Global Optimization Approach | 2012-07-28 | Paper |
| Machine learning for global optimization | 2012-07-10 | Paper |
| On the relation between concavity cuts and the surrogate dual for convex maximization problems | 2012-06-13 | Paper |
| Global Optimization of Morse Clusters by Potential Energy Transformations | 2012-06-08 | Paper |
| Complexity of the critical node problem over trees | 2011-06-30 | Paper |
| Approximation of linear fractional-multiplicative problems | 2011-06-17 | Paper |
| A global optimization method for the design of space trajectories | 2011-05-25 | Paper |
| A heuristic approach for packing identical rectangles in convex regions | 2011-03-25 | Paper |
| Gap, cosum and product properties of the θ′ bound on the clique number | 2011-01-20 | Paper |
| Global optimization problems and domain reduction strategies | 2010-10-13 | Paper |
| Copositivity cuts for improving SDP bounds on the clique number | 2010-09-16 | Paper |
| Solving the problem of packing equal and unequal circles in a circular container | 2010-05-07 | Paper |
| Dissimilarity measures for population-based global optimization algorithms | 2010-03-19 | Paper |
| A FPTAS for a class of linear multiplicative problems | 2010-02-24 | Paper |
| Solving molecular distance geometry problems by global optimization algorithms | 2009-09-25 | Paper |
| Global optimization of binary Lennard–Jones clusters | 2009-09-18 | Paper |
| A hybrid multiagent approach for global trajectory optimization | 2009-08-31 | Paper |
| Complexity results for some global optimization problems | 2009-06-16 | Paper |
| Finding maximin Latin hypercube designs by iterated local search heuristics | 2009-04-30 | Paper |
| A heuristic approach for the max-min diversity problem based on max-clique | 2009-04-03 | Paper |
| Simple ingredients leading to very efficient heuristics for the maximum clique problem | 2009-03-31 | Paper |
| New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability | 2008-06-30 | Paper |
| Efficiently packing unequal disks in a circle | 2008-05-29 | Paper |
| A ``maximum node clustering problem | 2008-04-04 | Paper |
| An experimental analysis of a population based approach for global optimization | 2008-03-12 | Paper |
| A new class of test functions for global optimization | 2007-11-14 | Paper |
| Bidimensional Packing by Bilinear Programming | 2007-08-30 | Paper |
| A population-based approach for hard global optimization problems based on dissimilarity measures | 2007-05-10 | Paper |
| Objective function features providing barriers to rapid global optimization | 2006-02-08 | Paper |
| Local optima smoothing for global optimization | 2006-01-10 | Paper |
| On the multilevel structure of global optimization problems | 2005-04-25 | Paper |
| The combinatorics of pivoting for the maximum weight clique. | 2005-01-11 | Paper |
| Undominated d.c. decompositions of quadratic functions and applications to branch-and-bound approaches | 2004-08-20 | Paper |
| Minimal interatomic distance in Morse clusters | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4452976 | 2004-03-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4450800 | 2004-02-16 | Paper |
| Efficient algorithms for large scale global optimization: Lennard-Jones clusters | 2003-12-04 | Paper |
| A note on the Griewank test function | 2003-10-27 | Paper |
| Convergence and first hitting time of simulated annealing algorithms for continuous global optimization | 2003-07-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4788634 | 2003-01-22 | Paper |
| Packing equal circles in a square: A deterministic global optimization approach | 2002-08-29 | Paper |
| Fast global optimization of difficult Lennard-Jones clusters | 2002-04-15 | Paper |
| Finite exact branch-and-bound algorithms for concave minimization over polytopes | 2001-05-13 | Paper |
| On convergence of the simplicial branch-and-bound algorithm based on \(\omega\)-subdivisions | 2001-02-19 | Paper |
| Finiteness result for the simplicial branch-and-bound algorithm based on \(\omega\)-subdivisions | 2001-02-19 | Paper |
| Simulated annealing algorithms for continuous global optimization: Convergence conditions | 2000-12-14 | Paper |
| Finiteness of conical algorithms with \(\omega\)-subdivisions | 2000-11-12 | Paper |
| Random linkage: A family of acceptance/rejection algorithms for global sation | 2000-06-04 | Paper |
| Convergence of a simulated annealing algorithm for continuous global optimization. | 2000-01-01 | Paper |
| Necessary and sufficient global optimality conditions for convex maximization revisited | 1999-04-13 | Paper |
| Relaxing the assumptions of the multilevel single linkage algorithm | 1998-09-27 | Paper |
| Convergence properties of simulated annealing for continuous global optimization | 1998-01-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4239645 | 1998-01-01 | Paper |
| Bayesian algorithms for one-dimensional global optimization | 1997-10-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4356872 | 1997-10-05 | Paper |
| Simple linkage: Analysis of a threshold-accepting global optimization method | 1997-04-21 | Paper |
| An adaptive stochastic global optimization algorithm for one-dimensional functions | 1996-07-24 | Paper |
| Local Optimization of MAPF solutions on Directed Graphs | 0001-01-03 | Paper |
| Identification of Cyclists' Route Choice Criteria | 0001-01-03 | Paper |
