A decomposition algorithm for circuit routing
type: Item
instance of: scholarly article
title: A decomposition algorithm for circuit routing
zbMATH Open document ID: 0584.90057
published in: Mathematical Programming Essays in Honor of George B. Dantzig Part I
publication date: 1985-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C06
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 49M27
zbMATH DE Number: 3936925
zbMATH Keywords: large linear program
zbMATH Keywords: decomposition principle
zbMATH Keywords: Circuit routing
zbMATH Keywords: integer linear program
zbMATH Keywords: cut paste approach
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1007/bfb0121044
OpenAlex ID: W4694820
DOI: 10.1007/BFB0121044
Recommended article: An approximation algorithm for multiroute flow decomposition
Recommended article: Decomposition algorithms for finding the shortest path between a source node and a sink node of a network
Recommended article: An optimal distributed routing algorithm using dual decomposition techniques
Recommended article: A decomposition algorithm for multi-terminal network flows
Recommended article: Q3327721
Recommended article: Q3831051
Recommended article: Q5015392
Recommended article: Algorithms – ESA 2005
Recommended article: Dynamic programming in the routing problem: decomposition variant
Recommended article: A new proximal decomposition algorithm for routing in telecommunication networks
description: scientific article