A primal partitioning approach for single and non-simultaneous multicommodity flow problems

DOI10.1016/S0377-2217(99)00264-7zbMath0967.90014OpenAlexW1967043869MaRDI QIDQ1569942

Malika Hadjiat, Yann Vaxès, Jean-Francois Maurras

Publication date: 9 July 2000

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(99)00264-7

zbMATH Keywords

telecommunication networkssimplex methodsnon-simultaneous multicommodity flowsprimal basis partitioning

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Linear programming (90C05)

Related Items (4)

A linear model for compound multicommodity network flow problems ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A primal partitioning approach for single and non-simultaneous multicommodity flow problems

Cites Work

• Unnamed Item
• Unnamed Item
• A polyhedral approach to multicommodity survivable network design
• Multicommodity network flow with jump constraints
• A primal partitioning approach for single and non-simultaneous multicommodity flow problems
• Generalized upper bounding techniques
• The Elimination form of the Inverse and its Application to Linear Programming
• Optimum Synthesis of a Network with Non-Simultaneous Multicommodity Flow Requirements
• A generalized upper bounding approach to a communications network planning problem
• A Primal Partitioning Solution for the Arc-Chain Formulation of a Multicommodity Network Flow Problem
• Formulating a Mixed Integer Programming Problem to Improve Solvability
• Solving the Two-Connected Network with Bounded Meshes Problem

This page was built for publication: A primal partitioning approach for single and non-simultaneous multicommodity flow problems