A branch-and-cut algorithm for capacitated network design problems
type: Item
instance of: scholarly article
title: A branch-and-cut algorithm for capacitated network design problems
zbMATH Open document ID: 1015.90090
published in: Mathematical Programming. Series A. Series B
publication date: 1999-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 1356207
zbMATH Keywords: capacity expansion problem
zbMATH Keywords: network loading problem
zbMATH Keywords: bi-directional edge capacities
zbMATH Keywords: knapsack branching
zbMATH Keywords: branch-and-cut algorithm
zbMATH Keywords: capacitated network design
zbMATH Keywords: point-to-point traffic demands
zbMATH Keywords: mixed-integer programming
author: Oktay Günlük
describes a project that uses: Concorde
MaRDI profile type: Publication
full work available at URL: s101070050077
OpenAlex ID: W2010440802
DOI: 10.1007/S101070050077
Recommended article: A branch and cut algorithm for the hierarchical network design problem
Recommended article: Q2753737
Recommended article: Approximation algorithms for a capacitated network design problem
Recommended article: Q4233338
Recommended article: Q3840281
Recommended article: A branch‐and‐cut algorithm for hub network design problems with profits
Recommended article: Branch and cut methods for network optimization
Recommended article: Benders-and-cut algorithm for fixed-charge capacitated network design problem
Recommended article: Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems
Recommended article: A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
description: scientific article; zbMATH DE number 1356207