Pages that link to "Item:Q1881050"
From MaRDI portal
The following pages link to Global optimization of mixed-integer nonlinear programs: a theoretical and computational study (Q1881050):
Displayed 23 items.
- A global optimization method, QBB, for twice-differentiable nonconvex optimization problem (Q811896) (← links)
- An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms (Q857806) (← links)
- A lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures (Q933795) (← links)
- Lago: a (heuristic) branch and cut algorithm for nonconvex minlps (Q940828) (← links)
- Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method (Q946351) (← links)
- An algorithmic framework for convex mixed integer nonlinear programs (Q951092) (← links)
- Efficient interval partitioning for constrained global optimization (Q956597) (← links)
- Parametric mixed-integer 0-1 linear programming: The general case for a single parameter (Q958548) (← links)
- An exact solution method for reliability optimization in complex systems (Q1772968) (← links)
- A polyhedral branch-and-cut approach to global optimization (Q1780949) (← links)
- A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs (Q1780950) (← links)
- A comparison of complete global optimization solvers (Q1780958) (← links)
- Optimization of a complex flexible multibody systems with composite materials (Q2458275) (← links)
- Efficient interval partitioning-local search collaboration for constraint satisfaction (Q2459380) (← links)
- Global optimization in stabilizing controller design (Q2465481) (← links)
- Robust optimization of contaminant sensor placement for community water systems (Q2492697) (← links)
- A local relaxation approach for the siting of electrical substations (Q2506167) (← links)
- An optimization method for solving mixed discrete-continuous programming problems (Q2519622) (← links)
- Reliability redundancy allocation: an improved realization for nonconvex nonlinear programming problems (Q2576243) (← links)
- Accelerating branch-and-bound through a modeling language construct for relaxation-specific constraints (Q2576448) (← links)
- Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs (Q3503837) (← links)
- A revised Taha's algorithm for polynomial 0-1 programming (Q5426969) (← links)
- Global optimization of explicit strong-stability-preserving Runge-Kutta methods (Q5713223) (← links)