Pages that link to "Item:Q1924072"
From MaRDI portal
The following pages link to BARON: A general purpose global optimization software package (Q1924072):
Displaying 12 items.
- Interval constraint programming for globally solving catalog-based categorical optimization (Q6541384) (← links)
- An exact decomposition technique for the deadline-constrained discrete time/cost trade-off problem with discounted cash flows (Q6551096) (← links)
- An efficient branch-and-bound algorithm using an adaptive branching rule with quadratic convex relaxation for globally solving general linear multiplicative programs (Q6581973) (← links)
- A criterion space algorithm for solving linear multiplicative programming problems (Q6582405) (← links)
- Arc-dependent networks: theoretical insights and a computational study (Q6588520) (← links)
- Solving two-trust-region subproblems using semidefinite optimization with eigenvector branching (Q6596338) (← links)
- Very high-order A-stable stiffly accurate diagonally implicit Runge-Kutta methods with error estimators (Q6604517) (← links)
- Constrained optimization of rank-one functions with indicator variables (Q6634534) (← links)
- A novel branch-and-bound algorithm for solving linear multiplicative programming problems (Q6646071) (← links)
- Estimating the robust domain of attraction for difference inclusions using an interval Lyapunov equation (Q6648477) (← links)
- A new branch-and-cut algorithm for linear sum-of-ratios problem based on SLO method and LO relaxation (Q6667698) (← links)
- Global optimization: a machine learning approach (Q6667701) (← links)
