Pages that link to "Item:Q1384428"

The following pages link to LP relaxations better than convexification for multicommodity network optimization problems with step increasing cost functions (Q1384428):

Displaying 8 items.

• Adaptive memory in multistart heuristics for multicommodity network design (Q535395) (← links)
• D.C. programming approach for multicommodity network optimization problems with step increasing cost functions (Q598597) (← links)
• Exact solution of multicommodity network optimization problems with general step cost functions (Q1306346) (← links)
• Bounds for global optimization of capacity expansion and flow assignment problems (Q1591547) (← links)
• The multi-layered network design problem (Q2370332) (← links)
• Lower bounds from state space relaxations for concave cost network flow problems (Q2494472) (← links)
• New formulation and relaxation to solve a concave-cost network flow problem (Q4367015) (← links)
• An exact approach for the multicommodity network optimization problem with a step cost function (Q5244303) (← links)