Minimum cost capacity installation for multicommodity network flows
type: Item
instance of: scholarly article
title: Minimum cost capacity installation for multicommodity network flows
zbMATH Open document ID: 0922.90064
DOI: 10.1007/BF01581104
author: Sunil Chopra
author: Oktay Günlük
author: Chih-Yang Tsai
author: Daniel Bienstock
published in: Mathematical Programming. Series A. Series B
publication date: 1999-10-18T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 1294669
zbMATH Keywords: network design
zbMATH Keywords: directed graph
zbMATH Keywords: minimum cost installation of capacity
zbMATH Keywords: metric inequalities
zbMATH Keywords: aggregated multicommodity flow formulation
MaRDI profile type: Publication
cites work: Network Design Using Cut Inequalities
cites work: Capacitated Network Design—Polyhedral Structure and Computation
cites work: Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut
cites work: Q4040221
cites work: Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems
cites work: Computational experience with a difficult mixed-integer multicommodity flow problem
cites work: Solving Airline Crew Scheduling Problems by Branch-and-Cut
cites work: A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
cites work: Modeling and Solving the Two-Facility Capacitated Network Loading Problem
cites work: A polyhedral approach to multicommodity survivable network design
full work available at URL: https://doi.org/10.1007/bf01581104
OpenAlex ID: W2051290577
description: scientific article; zbMATH DE number 1294669