Fixed-Charge Transportation Problem: Facets of the Projection Polyhedron

DOI10.1287/opre.1120.1041zbMath1251.90270OpenAlexW2154326504MaRDI QIDQ4648260

Y. K. Agarwal, Yash P. Aneja

Publication date: 8 November 2012

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.1120.1041

zbMATH Keywords

integer programmingbranch and cuttransportation problemfixed charge

Mathematics Subject Classification ID

Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items (6)

Minimum‐cost flow problems having arc‐activation costs ⋮ Fixed charge multicommodity network design using \(p\)-partition facets ⋮ Fixed-charge transportation problems on trees ⋮ Regenerator location problem: polyhedral study and effective branch-and-cut algorithms ⋮ A stochastic multi-stage fixed charge transportation problem: worst-case analysis of the rolling horizon approach ⋮ The noncooperative fixed charge transportation problem

This page was built for publication: Fixed-Charge Transportation Problem: Facets of the Projection Polyhedron