Computational experience with a difficult mixedinteger multicommodity flow problem

This publication has 9 references indexed in Scilit:

• Polyhedra of the Equivalent Subgraph Problem and Some Edge Connectivity Problems
  SIAM Journal on Discrete Mathematics, 1992
• Fast approximation algorithms for multicommodity flow problems
  Published by Association for Computing Machinery (ACM) ,1991
• Logically rearrangeable multihop lightwave networks
  IEEE Transactions on Communications, 1991
• Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints
  SIAM Journal on Discrete Mathematics, 1990
• The maximum concurrent flow problem
  Journal of the ACM, 1990
• A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design
  Operations Research, 1989
• Integer and Combinatorial Optimization
  Published by Wiley ,1988
• Valid inequalities and separation for uncapacitated fixed charge networks
  Operations Research Letters, 1985
• Valid Linear Inequalities for Fixed Charge Problems
  Operations Research, 1985