A polyhedral approach to an integer multicommodity flow problem

DOI10.1016/S0166-218X(99)00187-0zbMath0944.90008OpenAlexW2063375015WikidataQ127186905 ScholiaQ127186905MaRDI QIDQ1975361

Lorenzo Brunetta, Matteo Fischetti, Michele Conforti

Publication date: 22 June 2000

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

Full work available at URL: https://doi.org/10.1016/s0166-218x(99)00187-0

zbMATH Keywords

transportationbranch-and-cut\({\mathcal N}{\mathcal P}\)-hard probleminteger multi-commodity flow problemVLSI design, and telecommunications

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)

Related Items (9)

Heuristic approaches for the multiperiod location-transportation problem with reuse of vehicles in emergency logistics ⋮ Optimization in telecommunication networks ⋮ Routing and scheduling of network flows with deadlines and discrete capacity allocation ⋮ On seeking efficient Pareto optimal points in multi-player minimum cost flow problems with application to transportation systems ⋮ Multicut Is FPT ⋮ Unnamed Item ⋮ Tree metrics and edge-disjoint \(S\)-paths ⋮ Algorithms for an integer multicommodity network flow problem with node reliability considerations ⋮ Minimal multicut and maximal integer multiflow: a survey

Uses Software

• CPLEX
• RelaxIV

Cites Work

• Unnamed Item
• Unnamed Item
• On the cycle polytope of a binary matroid
• Matroids and multicommodity flows
• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
• Odd Minimum Cut-Sets and b-Matchings
• On the Computational Complexity of Combinatorial Problems
• The Circuit Polytope: Facets

This page was built for publication: A polyhedral approach to an integer multicommodity flow problem