Pages that link to "Item:Q2277369"

The following pages link to Separable concave minimization via partial outer approximation and branch and bound (Q2277369):

Displaying 12 items.

• New formulations of the multiple sequence alignment problem (Q628651) (← links)
• On a finite branch and bound algorithm for the global minimization of a concave power law over a polytope (Q650234) (← links)
• A new simplicial cover technique in constrained global optimization (Q1187367) (← links)
• Nonlinear programming for multiperiod capacity planning in a manufacturing system (Q1278476) (← links)
• A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron (Q1332814) (← links)
• Computational comparison of two methods for constrained global optimization (Q1342896) (← links)
• Capacity planning in networks of queues with manufacturing applications (Q1900269) (← links)
• A note on adapting methods for continuous global optimization to the discrete case (Q2276877) (← links)
• Separable concave minimization via partial outer approximation and branch and bound (Q2277369) (← links)
• Sufficient optimality criterion for linearly constrained, separable concave minimization problems (Q2569195) (← links)
• Improved convex and concave relaxations of composite bilinear forms (Q2697000) (← links)
• A continuous approch for globally solving linearly constrained quadratic (Q2767579) (← links)