Pages that link to "Item:Q2479840"

The following pages link to A simplicial branch-and-bound algorithm conscious of special structures in concave minimization problems (Q2479840):

Displaying 7 items.

• A convergent simplicial algorithm with \(\omega \)-subdivision and \(\omega \)-bisection strategies (Q427360) (← links)
• A simplicial algorithm for concave minimization and its performance as a heuristic tool (Q934181) (← links)
• A new simplicial cover technique in constrained global optimization (Q1187367) (← links)
• A finite concave minimization algorithm using branch and bound and neighbor generation (Q1330802) (← links)
• On new methods to construct lower bounds in simplicial branch and bound based on interval arithmetic (Q2046307) (← links)
• (Q5462190) (← links)
• A new Lagrangian-Benders approach for a concave cost supply chain network design problem (Q5889193) (← links)