| Publication | Date of Publication | Type |
|---|
| Technical note -- Masking Anstreicher's Linx bound for improved entropy bounds | 2024-07-25 | Paper |
| D-Optimal Data Fusion: Exact and Approximation Algorithms | 2024-03-26 | Paper |
| On Computing with Some Convex Relaxations for the Maximum-Entropy Sampling Problem | 2024-02-28 | Paper |
| An outer-approximation algorithm for maximum-entropy sampling | 2024-02-27 | Paper |
| On computing sparse generalized inverses | 2023-09-19 | Paper |
| Computing D-Optimal solutions for huge-scale linear and quadratic response-surface models | 2023-09-07 | Paper |
| Branch-and-bound for integer D-Optimality with fast local search and variable-bound tightening | 2023-08-31 | Paper |
| An outer-approximation algorithm for maximum-entropy sampling | 2023-08-03 | Paper |
| Branch-and-bound for D-Optimality with fast local search and variable-bound tightening | 2023-02-14 | Paper |
| Generalized Scaling for the Constrained Maximum-Entropy Sampling Problem | 2023-02-09 | Paper |
| Two linear approximation algorithms for convex mixed integer nonlinear programming | 2022-09-26 | Paper |
| Trading off \(1\)-norm and sparsity against rank for linear models using mathematical optimization: \(1\)-norm minimizing partially reflexive ah-symmetric generalized inverses | 2022-08-20 | Paper |
| Arc-flow approach for single batch-processing machine scheduling | 2022-03-09 | Paper |
| Insight into the computation of Steiner minimal trees in Euclidean space of general dimension | 2022-01-05 | Paper |
| Experimental analysis of local searches for sparse reflexive generalized inverses | 2021-11-26 | Paper |
| Mixing convex-optimization bounds for maximum-entropy sampling | 2021-08-11 | Paper |
| Convexification of bilinear forms through non-symmetric lifting | 2021-08-11 | Paper |
| Approximate 1-norm minimization and minimum-rank structured sparsity for various generalized inverses via local search | 2021-07-20 | Paper |
| Lower bounds for cubic optimization over the sphere | 2021-06-15 | Paper |
| Masking Anstreicher's linx bound for improved entropy bounds | 2021-06-05 | Paper |
| Arc-flow approach for single batch-processing machine scheduling | 2020-10-22 | Paper |
| An overview of MINLP algorithms and their implementation in Muriqui optimizer | 2020-05-11 | Paper |
| On a nonconvex MINLP formulation of the Euclidean Steiner tree problem in \(n\)-space: missing proofs | 2020-04-27 | Paper |
| On sparse reflexive generalized inverse | 2020-02-10 | Paper |
| Parametric convex quadratic relaxation of the quadratic knapsack problem | 2019-10-17 | Paper |
| Continuous relaxations for Constrained Maximum-Entropy Sampling | 2019-01-11 | Paper |
| Extensions on ellipsoid bounds for quadratic integer programming | 2018-07-18 | Paper |
| Integrality gap minimization heuristics for binary mixed integer nonlinear programming | 2018-07-18 | Paper |
| On global optimization with indefinite quadratics | 2018-03-28 | Paper |
| Efficient treatment of bilinear forms in global optimization | 2018-03-20 | Paper |
| Linear programing relaxations for a strategic pricing problem in electricity markets | 2017-03-16 | Paper |
| An overview of exact algorithms for the Euclidean Steiner tree problem in \(n\)-space | 2016-10-21 | Paper |
| A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in \(n\)-space | 2016-09-26 | Paper |
| Column generation approaches for the software clustering problem | 2016-07-01 | Paper |
| Sparse pseudoinverses via LP and SDP relaxations of Moore-Penrose | 2016-06-22 | Paper |
| An application of genetic algorithm to a bidding problem in electricity markets | 2015-04-22 | Paper |
| Integrating nonlinear branch-and-bound and outer approximation for convex mixed integer nonlinear programming | 2015-01-15 | Paper |
| Mixed-integer linear programming formulations for the software clustering problem | 2013-07-19 | Paper |
| A stochastic local search algorithm for constrained continuous global optimization | 2013-06-13 | Paper |
| Semidefinite relaxation for linear programs with equilibrium constraints | 2013-05-23 | Paper |
| Planejamento de Anéis Unidirecionais em Telecomunicações: uma Aplicação do Método GRASP | 2011-04-04 | Paper |
| An improved algorithm for computing Steiner minimal trees in Euclidean \(d\)-space | 2008-10-29 | Paper |
| Bilevel optimization applied to strategic pricing in competitive electricity markets | 2008-04-03 | Paper |
| An Efficient Heuristic for the Ring Star Problem | 2007-09-14 | Paper |
| Optimal grid representations | 2005-02-23 | Paper |
| Using a conic formulation for finding Steiner minimal trees | 2004-08-10 | Paper |
| Bid-based dispatch of hydrothermal systems in competitive markets | 2003-06-09 | Paper |
| Market power issues in bid-based hydrothermal dispatch | 2003-03-10 | Paper |
| A New Relaxation in Conic Form for the Euclidean Steiner Problem in ℜ | 2002-08-18 | Paper |
| Maximum-entropy remote sampling | 2001-06-19 | Paper |
| Using continuous nonlinear relaxations to solve constrained maximum-entropy sampling problems | 2001-02-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4400646 | 1998-08-02 | Paper |
| Generalized Scaling for the Constrained Maximum-Entropy Sampling Problem | N/A | Paper |
| Good and Fast Row-Sparse ah-Symmetric Reflexive Generalized Inverses | N/A | Paper |
