Pages that link to "Item:Q686988"
From MaRDI portal
The following pages link to An improved branch and bound algorithm for minimum concave cost network flow problems (Q686988):
Displaying 7 items.
- On a finite branch and bound algorithm for the global minimization of a concave power law over a polytope (Q650234) (← links)
- Network cost minimization using threshold-based discounting (Q1600844) (← links)
- Domain reduction techniques for global NLP and MINLP optimization (Q1699520) (← links)
- Nonconvex optimization over a polytope using generalized capacity improvement (Q1904646) (← links)
- A branch-and-reduce approach to global optimization (Q1924068) (← links)
- Correlative sparsity structures and semidefinite relaxations for concave cost transportation problems with change of variables (Q2392116) (← links)
- (Q4261216) (← links)
