Treffer: Minimal multicut and maximal integer multiflow: A survey : Logistics: From theory to application
Title:
Minimal multicut and maximal integer multiflow: A survey : Logistics: From theory to application
Source:
European journal of operational research. 162(1):55-69
Publisher Information:
Amsterdam: Elsevier, 2005.
Publication Year:
2005
Physical Description:
print, 63 ref
Original Material:
INIST-CNRS
Subject Terms:
Control theory, operational research, Automatique, recherche opérationnelle, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Recherche operationnelle. Gestion, Operational research. Management science, Recherche opérationnelle et modèles formalisés de gestion, Operational research and scientific management, Flots dans les réseaux. Problèmes combinatoires, Flows in networks. Combinatorial problems, Complexité algorithme, Algorithm complexity, Complejidad algoritmo, Graphe biparti, Bipartite graph, Grafo bipartido, Graphe planaire, Planar graph, Grafo planario, Problème UFP, Unsplittable flow problem, Problema UFP, Problème multiflot, Multicommodity flow problem, Problema multiflujo, Problème multicoupe, Approximation, Complexity, Integer multicommodity flows, Minimum multicut, Multiway cut
Document Type:
Konferenz
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
CEDRIC, CNAM, 292 rue St-Martin, 75141 Paris, France
CEDRIC, CNAM-IIE, 18 Allée Jean Rostand, 91025 Evry, France
CEDRIC, CNAM-IIE, 18 Allée Jean Rostand, 91025 Evry, France
ISSN:
0377-2217
Rights:
Copyright 2005 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Operational research. Management
Accession Number:
edscal.16436326
Database:
PASCAL Archive
Weitere Informationen
We present a survey about the maximum integral multiflow and minimum multicut problems and their subproblems, such as the multiterminal cut and the unsplittable flow problems. We consider neither continuous multiflow nor minimum cost multiflow. Most of the results are very recent and some are new. We recall the dual relationship between both problems, give complexity results and algorithms, firstly in unrestricted graphs and secondly in several special graphs: trees, bipartite or planar graphs. A table summarizes the most important results.