Fixed charge multicommodity network design using \(p\)-partition facets
type: Item
instance of: scholarly article
title: Fixed charge multicommodity network design using \(p\)-partition facets
zbMATH Open document ID: 1380.90283
author: Y. K. Agarwal
author: Y. P. Aneja
published in: European Journal of Operational Research
publication date: 2018-02-16T00:00:00Z
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 52B55
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C11
zbMATH DE Number: 6839956
zbMATH Keywords: fixed charge
zbMATH Keywords: multicommodity flows
zbMATH Keywords: network design
zbMATH Keywords: integer programming
zbMATH Keywords: polyhedral structure
MaRDI profile type: Publication
full work available at URL: j.ejor.2016.09.015
OpenAlex ID: W2523164219
cites work: k-Partition-based facets of the network design problem
cites work: Fixed-Charge Transportation Problem: Facets of the Projection Polyhedron
cites work: Metric inequalities and the network loading problem
cites work: A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design
cites work: Minimum cost capacity installation for multicommodity network flows
cites work: On the spanning tree polyhedron
cites work: Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
cites work: An improved Benders decomposition applied to a multi-layer network design problem
cites work: A note on ``A dual-ascent approach to the fixed-charge capacitated network design problem''
cites work: Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints
cites work: A dual ascent approach to the fixed-charge capacitated network design problem
cites work: Q5629416
cites work: On the use of guided design search for discovering significant decision variables in the fixed‐charge capacitated multicommodity network design problem
cites work: Combinatorial approaches to multiflow problems
cites work: The convex hull of two core capacitated network design problems
cites work: Separating tight metric inequalities by bilevel programming
DOI: 10.1016/J.EJOR.2016.09.015
description: scientific article; zbMATH DE number 6839956