Pages that link to "Item:Q1863899"
From MaRDI portal
The following pages link to Solving large MINLPs on computational grids (Q1863899):
Displaying 13 items.
- Global optimization of mixed-integer nonlinear (polynomial) programming problems: The Bernstein polynomial approach (Q411431) (← links)
- An improved Bernstein global optimization algorithm for MINLP problems with application in process industry (Q475423) (← links)
- Analysis of stochastic problem decomposition algorithms in computational grids (Q1026583) (← links)
- A branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: a bi-objective optimization approach (Q1628068) (← links)
- An efficient strategy for the activation of MIP relaxations in a multicore global MINLP solver (Q1704912) (← links)
- Solving large quadratic assignment problems on computational grids (Q1849534) (← links)
- An augmented Lagrangian filter method (Q2216190) (← links)
- Redundant robust topology optimization of truss (Q2357836) (← links)
- A partial outer convexification approach to control transmission lines (Q2419514) (← links)
- The empirical behavior of sampling methods for stochastic programming (Q2507414) (← links)
- Challenges in Enterprise Wide Optimization for the Process Industries (Q3638498) (← links)
- (Q3690113) (← links)
- Concurrent processing of mixed‐integer non‐linear programming problems (Q4932950) (← links)