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 13 items.
- On a finite branch and bound algorithm for the global minimization of a concave power law over a polytope (Q650234) (← links)
- Global search algorithms for minimum concave-cost network flow problems (Q1200522) (← links)
- An integer concave minimization approach for the minimum concave cost capacitated flow problem on networks (Q1384224) (← links)
- Network cost minimization using threshold-based discounting (Q1600844) (← links)
- Domain reduction techniques for global NLP and MINLP optimization (Q1699520) (← links)
- A concave link elimination (CLE) procedure and lower bound for concave topology, capacity and flow assignment network design problems (Q1854815) (← links)
- Nonconvex optimization over a polytope using generalized capacity improvement (Q1904646) (← links)
- A branch-and-reduce approach to global optimization (Q1924068) (← links)
- A deterministic annealing algorithm for the minimum concave cost network flow problem (Q1952548) (← links)
- Correlative sparsity structures and semidefinite relaxations for concave cost transportation problems with change of variables (Q2392116) (← links)
- Lower bounds from state space relaxations for concave cost network flow problems (Q2494472) (← links)
- A branch-and-bound algorithm for concave network flow problems (Q2494473) (← links)
- Capacity improvement, penalties, and the fixed charge transportation problem (Q4261216) (← links)
