LP relaxations better than convexification for multicommodity network optimization problems with step increasing cost functions
type: Item
instance of: scholarly article
title: LP relaxations better than convexification for multicommodity network optimization problems with step increasing cost functions
zbMATH Open document ID: 0896.90088
published in: Acta Mathematica Vietnamica
publication date: 1998-04-13T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 1140458
zbMATH Keywords: convexification
zbMATH Keywords: multicommodity network optimization
zbMATH Keywords: lower bounds
zbMATH Keywords: discontinuous step increasing cost functions
author: V. Gabrel
author: Michel Minoux
MaRDI profile type: Publication
Recommended article: An exact approach for the multicommodity network optimization problem with a step cost function
Recommended article: Exact solution of multicommodity network optimization problems with general step cost functions
Recommended article: D.C. programming approach for multicommodity network optimization problems with step increasing cost functions
Recommended article: On the Effectiveness of the Linear Programming Relaxation of the 0-1 Multi-commodity Minimum Cost Network Flow Problem
Recommended article: A Lagrangean Relaxation Scheme for Structured Linear Programs With Application To Multicommodity Network Flows
Recommended article: Relaxation methods for the strictly convex multicommodity flow problem with capacity constraints on individual commodities
Recommended article: Lagrangean-based decomposition algorithms for multicommodity network design problems with penalized constraints
Recommended article: Q4035640
Recommended article: An $\epsilon$-Relaxation Method for Separable Convex Cost Network Flow Problems
Recommended article: Lagrangian bounds for large‐scale multicommodity network design: a comparison between Volume and Bundle methods
description: scientific article; zbMATH DE number 1140458