Solving difficult multicommodity problems with a specialized interior-point algorithm
type: Item
instance of: scholarly article
title: Solving difficult multicommodity problems with a specialized interior-point algorithm
zbMATH Open document ID: 1053.90010
author: Jordi Castro
published in: Annals of Operations Research
publication date: 2004-01-06T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C51
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 2021904
zbMATH Keywords: interior-point methods
zbMATH Keywords: linear programming
zbMATH Keywords: multicommodity flows
zbMATH Keywords: network optimization
describes a project that uses: KORBX
describes a project that uses: PPRN
describes a project that uses: CPLEX
MaRDI profile type: Publication
full work available at URL: b:anor.0000004761.99649.a5
OpenAlex ID: W2145667263
DOI: 10.1023/B:ANOR.0000004761.99649.A5
Recommended article: A Specialized Interior-Point Algorithm for Multicommodity Network Flows
Recommended article: Q4817271
Recommended article: Simplex and Interior Point Specialized Algorithms for Solving Nonoriented Multicommodity Flow Problems
Recommended article: Q4886084
Recommended article: Q3348677
Recommended article: Improving an interior-point algorithm for multicommodity flows by quadratic regularizations
Recommended article: Q4472366
Recommended article: Solving Multicommodity Flow Problems by an Approximation Scheme
Recommended article: Q4353551
Recommended article: Q4322779
description: scientific article; zbMATH DE number 2021904