BARON
From MaRDI portal
Software:12838
swMATH66MaRDI QIDQ12838FDOQ12838
Author name not available (Why is that?)
Cited In (only showing first 100 items - show all)
- Global optimization in stabilizing controller design
- Alternative branching rules for some nonconvex problems
- A pseudo-global optimization approach with application to the design of containerships
- GlobSol user guide
- A global optimization RLT-based approach for solving the hard clustering problem
- Energy-optimal multi-goal motion planning for planar robot manipulators
- Convex relaxations for mixed-integer nonlinear programs
- Supply capacity acquisition and allocation with uncertain customer demands
- A branch-and-cut algorithm for mixed-integer bilinear programming
- A new local and global optimization method for mixed integer quadratic programming problems
- Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method
- Rigorous filtering using linear relaxations
- Solving large MINLPs on computational grids
- The travelling salesman problem with neighbourhoods: MINLP solution
- The supporting hyperplane optimization toolkit for convex MINLP
- Optimal explicit strong-stability-preserving general linear methods
- On the optimal design of water distribution networks: a practical MINLP approach
- Nonconvex min-max fractional quadratic problems under quadratic constraints: copositive relaxations
- Convex envelopes of products of convex and component-wise concave functions
- Clouds, fuzzy sets, and probability intervals
- Title not available (Why is that?)
- Bound constrained interval global optimization in the COCONUT environment
- Book review of: J.-B. Lasserre, An introduction to polynomial and semi-algebraic optimization
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- Strict linear prices in non-convex European day-ahead electricity markets
- A recipe for finding good solutions to MINLPs
- Copositivity and constrained fractional quadratic problems
- Reduced RLT representations for nonconvex polynomial programming problems
- A hierarchy of relaxations for nonlinear convex generalized disjunctive programming
- On the solution of the inverse eigenvalue complementarity problem
- Interval computations, rigour and non-rigour in deterministic continuous global optimization
- Interval analysis on directed acyclic graphs for global optimization
- Contractor programming
- Exact cost minimization of a series-parallel reliable system with multiple component choices using an algebraic method
- Solving quality control problems with an algorithm for minimax programs with coupled constraints
- Global optimization of general non-convex problems with intermediate bilinear substructures
- Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations
- Convergence rate of McCormick relaxations
- Nonconvex generalized Benders decomposition for stochastic separable mixed-integer nonlinear programs
- Reformulations in mathematical programming: automatic symmetry detection and exploitation
- Optimal implicit strong stability preserving Runge-Kutta methods
- An improved Bernstein global optimization algorithm for MINLP problems with application in process industry
- A non-parametric approach to demand forecasting in revenue management
- Divisive heuristic for modularity density maximization
- Soft time-windows for a bi-objective vendor selection problem under a multi-sourcing strategy: binary-continuous differential evolution
- A risk-averse stochastic program for integrated system design and preventive maintenance planning
- Enhancing RLT-based relaxations for polynomial programming problems via a new class of \(v\)-semidefinite cuts
- A capacitated location-allocation model for flood disaster service operations with border crossing passages and probabilistic demand locations
- Convex relaxation for solving posynomial programs
- Combined bound-grid-factor constraints for enhancing RLT relaxations for polynomial programs
- Extrapolating curvature lines in rough concept sketches using mixed-integer nonlinear optimization
- Sample average approximation for stochastic nonconvex mixed integer nonlinear programming via outer-approximation
- Title not available (Why is that?)
- Rounding-based heuristics for nonconvex MINLPS
- A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
- Tacit collusion games in pool-based electricity markets under transmission constraints
- Emissions trading and technology deployment in an energy-systems ``bottom-up model with technology learning
- Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches
- Some results on the strength of relaxations of multilinear functions
- Algorithms for linear programming with linear complementarity constraints
- On convex relaxations of quadrilinear terms
- Bilinear modeling solution approach for fixed charge network flow problems
- Interval methods for semi-infinite programs
- Global optimization of multi-parametric MILP problems
- Global optimization of general nonconvex problems with intermediate polynomial substructures
- Multivariate McCormick relaxations
- Convex underestimation for posynomial functions of positive variables
- A heuristic approach to a single stage assembly problem with transportation allocation
- Bound reduction using pairs of linear inequalities
- Derivative-free optimization: a review of algorithms and comparison of software implementations
- Large-scale standard pooling problems with constrained pools and fixed demands
- Mixed integer nonlinear programming tools: an updated practical overview
- New bounding schemes and algorithmic options for the Branch-and-Sandwich algorithm
- Global optimization of bounded factorable functions with discontinuities
- Title not available (Why is that?)
- Minimizing the sum of many rational functions
- Cutting-Planes for Optimization of Convex Functions over Nonconvex Sets
- The optimization test environment
- Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs
- Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming
- MINLPLib -- a collection of test models for mixed-integer nonlinear programming
- Packing circles into perimeter-minimizing convex hulls
- Normalized multiparametric disaggregation: an efficient relaxation for mixed-integer bilinear problems
- Transformation-based preprocessing for mixed-integer quadratic programs
- A planar single facility location and border crossing problem
- Global solution of bilevel programs with a nonconvex inner program
- Semidefinite relaxations for non-convex quadratic mixed-integer programming
- Global optimization of bilinear programs with a multiparametric disaggregation technique
- Optimizing a polyhedral-semidefinite relaxation of completely positive programs
- The global solver in the LINDO API
- On an enumerative algorithm for solving eigenvalue complementarity problems
- Integration of AI and OR techniques in constraint programming for combinatorial optimization problems. 8th international conference, CPAIOR 2011, Berlin, Germany, May 23--27, 2011. Proceedings
- Theoretical and computational results about optimality-based domain reductions
- Complete search in continuous global optimization and constraint satisfaction
- Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach
- Global optimization of explicit strong-stability-preserving Runge-Kutta methods
- High order strong stability preserving time discretizations
- An algorithm for nonlinear optimization problems with binary variables
- Global optimisation of pessimistic bi-level problems
- An algorithm based on semidefinite programming for finding minimax optimal designs
This page was built for software: BARON