Multicommodity network flow with jump constraints

DOI10.1016/S0012-365X(96)00194-XzbMath0872.90038OpenAlexW1997272880MaRDI QIDQ1356790

Yann Vaxès, Jean-Francois Maurras

Publication date: 10 June 1997

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(96)00194-x

zbMATH Keywords

jump constraintsmulticommodity network flowarc-chain formulationprimal partitioning techniquetelecommunication network optimization

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Deterministic network models in operations research (90B10)

Related Items

A remark on a standard and linear vector network equilibrium problem with capacity constraints ⋮ Max flow and min cut with bounded-length paths: complexity, algorithms, and approximation ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A primal partitioning approach for single and non-simultaneous multicommodity flow problems

Cites Work

• Unnamed Item
• A generalized upper bounding approach to a communications network planning problem
• A Survey of Linear Cost Multicommodity Network Flows
• Multicommodity network flows—A survey
• A Primal Partitioning Solution for the Arc-Chain Formulation of a Multicommodity Network Flow Problem
• A generalized upper bounding algorithm for multicommodity network flow problems