Found: 22
Select item for more details and to access through your institution.
Experimental analysis of local searches for sparse reflexive generalized inverses.
- Published in:
- Journal of Global Optimization, 2021, v. 81, n. 4, p. 1057, doi. 10.1007/s10898-021-01087-y
- By:
- Publication type:
- Article
Convexification of bilinear forms through non-symmetric lifting.
- Published in:
- Journal of Global Optimization, 2021, v. 80, n. 2, p. 287, doi. 10.1007/s10898-020-00975-z
- By:
- Publication type:
- Article
Integrality gap minimization heuristics for binary mixed integer nonlinear programming.
- Published in:
- Journal of Global Optimization, 2018, v. 71, n. 3, p. 593, doi. 10.1007/s10898-018-0623-4
- By:
- Publication type:
- Article
Extensions on ellipsoid bounds for quadratic integer programming.
- Published in:
- Journal of Global Optimization, 2018, v. 71, n. 3, p. 457, doi. 10.1007/s10898-017-0557-2
- By:
- Publication type:
- Article
Integrating nonlinear branch-and-bound and outer approximation for convex Mixed Integer Nonlinear Programming.
- Published in:
- Journal of Global Optimization, 2014, v. 60, n. 2, p. 373, doi. 10.1007/s10898-014-0217-8
- By:
- Publication type:
- Article
D-Optimal Data Fusion: Exact and Approximation Algorithms.
- Published in:
- INFORMS Journal on Computing, 2024, v. 36, n. 1, p. 97, doi. 10.1287/ijoc.2022.0235
- By:
- Publication type:
- Article
On Computing with Some Convex Relaxations for the Maximum-Entropy Sampling Problem.
- Published in:
- INFORMS Journal on Computing, 2023, v. 35, n. 2, p. 368, doi. 10.1287/ijoc.2022.1264
- By:
- Publication type:
- Article
Two linear approximation algorithms for convex mixed integer nonlinear programming.
- Published in:
- Annals of Operations Research, 2022, v. 316, n. 2, p. 1471, doi. 10.1007/s10479-020-03722-5
- By:
- Publication type:
- Article
An overview of MINLP algorithms and their implementation in Muriqui Optimizer.
- Published in:
- Annals of Operations Research, 2020, v. 286, n. 1/2, p. 217, doi. 10.1007/s10479-018-2872-5
- By:
- Publication type:
- Article
Mixing convex-optimization bounds for maximum-entropy sampling.
- Published in:
- Mathematical Programming, 2021, v. 188, n. 2, p. 539, doi. 10.1007/s10107-020-01588-w
- By:
- Publication type:
- Article
Using continuous nonlinear relaxations to solve. constrained maximum-entropy sampling problems.
- Published in:
- Mathematical Programming, 1999, v. 85, n. 2, p. 221, doi. 10.1007/s101070050055
- By:
- Publication type:
- Article
Linear programing relaxations for a strategic pricing problem in electricity markets.
- Published in:
- International Transactions in Operational Research, 2017, v. 24, n. 1/2, p. 159, doi. 10.1111/itor.12293
- By:
- Publication type:
- Article
An overview of exact algorithms for the Euclidean Steiner tree problem in n-space.
- Published in:
- International Transactions in Operational Research, 2016, v. 23, n. 5, p. 861, doi. 10.1111/itor.12207
- By:
- Publication type:
- Article
Semidefinite relaxation for linear programs with equilibrium constraints.
- Published in:
- International Transactions in Operational Research, 2013, v. 20, n. 2, p. 201, doi. 10.1111/j.1475-3995.2012.00869.x
- By:
- Publication type:
- Article
A stochastic local search algorithm for constrained continuous global optimization.
- Published in:
- International Transactions in Operational Research, 2012, v. 19, n. 6, p. 825, doi. 10.1111/j.1475-3995.2012.00854.x
- By:
- Publication type:
- Article
Technical Note—Masking Anstreicher's linx Bound for Improved Entropy Bounds.
- Published in:
- Operations Research, 2024, v. 72, n. 2, p. 591, doi. 10.1287/opre.2022.2324
- By:
- Publication type:
- Article
A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in n-space.
- Published in:
- Computational Optimization & Applications, 2016, v. 65, n. 1, p. 47, doi. 10.1007/s10589-016-9835-z
- By:
- Publication type:
- Article
Column generation approaches for the software clustering problem.
- Published in:
- Computational Optimization & Applications, 2016, v. 64, n. 3, p. 843, doi. 10.1007/s10589-015-9822-9
- By:
- Publication type:
- Article
Mixed-Integer Linear Programming Formulations for the Software Clustering Problem.
- Published in:
- Computational Optimization & Applications, 2013, v. 55, n. 1, p. 113, doi. 10.1007/s10589-012-9512-9
- By:
- Publication type:
- Article
Lower Bounds for Cubic Optimization over the Sphere.
- Published in:
- Journal of Optimization Theory & Applications, 2021, v. 188, n. 3, p. 823, doi. 10.1007/s10957-021-01809-y
- By:
- Publication type:
- Article
Bid-Based Dispatch of Hydrothermal Systems in Competitive Markets.
- Published in:
- Annals of Operations Research, 2003, v. 120, n. 1-4, p. 81, doi. 10.1023/A:1023322328294
- By:
- Publication type:
- Article
Market Power Issues in Bid-Based Hydrothermal Dispatch.
- Published in:
- Annals of Operations Research, 2002, v. 117, n. 1-4, p. 247, doi. 10.1023/A:1021537910823
- By:
- Publication type:
- Article