The capacitated arc routing problem: Valid inequalities and facets
type: Item
instance of: scholarly article
title: The capacitated arc routing problem: Valid inequalities and facets
zbMATH Open document ID: 0895.90083
DOI: 10.1023/A:1018316919294
published in: Computational Optimization and Applications
publication date: 1998-04-13T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 52B12
zbMATH DE Number: 1140020
zbMATH Keywords: routing
zbMATH Keywords: arc routing problems
zbMATH Keywords: integer programming
zbMATH Keywords: polyhedral combinatorics
zbMATH Keywords: capacitated arc routing
zbMATH Keywords: generalized assignment problem
zbMATH Keywords: valid inequalities
zbMATH Keywords: facet
author: José-Manuel Belenguer
author: Enrique Benavent
MaRDI profile type: Publication
Recommended article: The Capacitated Arc Routing Problem: Lower bounds
Recommended article: Q5271456
Recommended article: Q5271455
Recommended article: Approximate solutions for the capacitated arc routing problem
Recommended article: An Approximation Algorithm for the Capacitated Arc Routing Problem
Recommended article: Q5271457
Recommended article: The capacitated arc routing problem with intermediate facilities
Recommended article: New lower bounds for the Capacitated Arc Routing Problem
Recommended article: Improved lower bounds and exact algorithm for the capacitated arc routing problem
description: scientific article; zbMATH DE number 1140020