LP relaxations better than convexification for multicommodity network optimization problems with step increasing cost functions
From MaRDI portal
Publication:1384428
zbMath0896.90088MaRDI QIDQ1384428
Michel Minoux, Virginie Gabrel
Publication date: 13 April 1998
Published in: Acta Mathematica Vietnamica (Search for Journal in Brave)
lower boundsconvexificationmulticommodity network optimizationdiscontinuous step increasing cost functions
Programming involving graphs or networks (90C35) Linear programming (90C05) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)
Related Items (4)
The multi-layered network design problem ⋮ Adaptive memory in multistart heuristics for multicommodity network design ⋮ An exact approach for the multicommodity network optimization problem with a step cost function ⋮ Exact solution of multicommodity network optimization problems with general step cost functions
This page was built for publication: LP relaxations better than convexification for multicommodity network optimization problems with step increasing cost functions
