Concurrent processing of mixed-integer non-linear programming problems
From MaRDI portal
Recommendations
- A flexible platform for mixed-integer non-linear programming problems
- Mixed-integer nonlinear optimization
- Solving large MINLPs on computational grids
- Solving Large-Scale Nonlinear Programming Problems by Constraint Partitioning
- Integrating SQP and branch-and-bound for mixed integer nonlinear programming
Cites work
- A distributed parallel genetic algorithm for solving optimal growth models
- A flexible platform for mixed-integer non-linear programming problems
- A generalized dual phase-2 simplex algorithm.
- A multipurpose parallel genetic hybrid algorithm for nonlinear nonconvex programming problems
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Designing a superstructure for parametric search for optimal search spaces in non‐trivial optimization problems
- Globally convergent limited memory bundle method for large-scale nonsmooth optimization
- Heterogeneous distribution of computations solving linear algebra problems on networks of heterogeneous computers
- Integrating SQP and branch-and-bound for mixed integer nonlinear programming
- Performance and modularity benefits of message-driven execution
- Solving a nonlinear non-convex trim loss problem with a genetic hybrid algorithm
- Solving convex MINLP optimization problems using a sequential cutting plane algorithm
- Solving irregular econometric and mathematical optimization problems with a genetic hybrid algorithm
- Solving large MINLPs on computational grids
- Speedup and scalability analysis of master-slave applications on large heterogeneous clusters
This page was built for publication: Concurrent processing of mixed-integer non-linear programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4932950)
