Treffer: Combinatorial algorithms for the minimum interval cost flow problem
Title:
Combinatorial algorithms for the minimum interval cost flow problem
Authors:
Source:
Applied mathematics and computation. 175(2):1200-1216
Publisher Information:
New York, NY: Elsevier, 2006.
Publication Year:
2006
Physical Description:
print, 23 ref
Original Material:
INIST-CNRS
Subject Terms:
Control theory, operational research, Automatique, recherche opérationnelle, Computer science, Informatique, Mathematics, Mathématiques, 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, Optimisation. Problèmes de recherche, Optimization. Search problems, Programmation mathématique, Mathematical programming, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Algorithmique. Calculabilité. Arithmétique ordinateur, Algorithmics. Computability. Computer arithmetics, Donnée statistique, Statistical data, Dato estadístico, Incertitude, Uncertainty, Incertidumbre, Mathématiques appliquées, Applied mathematics, Matemáticas aplicadas, Performance algorithme, Algorithm performance, Resultado algoritmo, Programmation floue, Fuzzy programming, Programación difusa, Relation ordre, Ordering, Relación orden, Algorithme combinatoire, Combinatorial algorithm, Problème flot coût intervalle minimum, Minimum interval cost flow problem, Combinatorial algorithms, Complete ordering
Document Type:
Fachzeitschrift
Article
File Description:
text
Language:
English
Author Affiliations:
Faculty of Mathematics and Computer Sciences, Amirkabir University of Technology, Tehran, Iran, Islamic Republic of
ISSN:
0096-3003
Rights:
Copyright 2006 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:
Computer science; theoretical automation; systems
Operational research. Management
Operational research. Management
Accession Number:
edscal.17689041
Database:
PASCAL Archive
Weitere Informationen
The aim of minimum the interval cost flow problem (MICFP) is to find the least cost of the shipment of a commodity through a capacitated network in order to satisfy demands at certain nodes from available supplies at other nodes where there exists some vague in vector cost of problem. Interval cost is a common event in uncertainty environments, where statistical data are applied. Moreover they almost play an essential role in fuzzy programming, specially in the case of using their cuts. In this paper, a complete order on intervals is defined and efficient combinatorial algorithms for MICFP are proposed. Digital simulation results show the performance of the proposed algorithms compared with real scenarios.