Pages that link to "Item:Q1384224"

The following pages link to An integer concave minimization approach for the minimum concave cost capacitated flow problem on networks (Q1384224):

Displaying 8 items.

• Exact algorithm for concave knapsack problems: linear underestimation and partition method (Q811881) (← links)
• Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method (Q946351) (← links)
• Two level hierarchical time minimizing transportation problem (Q1769948) (← 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)
• A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems (Q2503087) (← links)
• A general purpose exact solution method for mixed integer concave minimization problems (Q6112823) (← links)