Treffer: A heuristic for finding embedded network structure in mathematical programmes
Title:
A heuristic for finding embedded network structure in mathematical programmes
Authors:
Source:
European journal of operational research. 67(1):52-63
Publisher Information:
Amsterdam: Elsevier, 1993.
Publication Year:
1993
Physical Description:
print, 12 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, Programmation mathématique, Mathematical programming, Complexité calcul, Computing complexity, Complejidad cálculo, Méthode heuristique, Heuristic method, Método heurístico, Programmation linéaire, Linear programming, Programación lineal, Programmation mathématique, Mathematical programming, Programación matemática, Réseau, Network, Red, Simulation ordinateur, Computer simulation, Simulación computadora, Flot réseau, Network flow
Document Type:
Fachzeitschrift
Article
File Description:
text
Language:
English
Author Affiliations:
Coventry polytech., Coventry CV1 5FB, United Kingdom
ISSN:
0377-2217
Rights:
Copyright 1993 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.4715836
Database:
PASCAL Archive
Weitere Informationen
An intuitive description is given of how to recognise when a mathematical programme can be converted to a network flow problem. In practice, it is more likely that a mathematical programme with a high degree of network structure will have additional complicating constraints. Thus, a heuristic is presented for identifying a maximal subset of the constraints which can be converted to a network flow problem. Computational results show that the heuristic is highly effective, and that much larger networks are identified by seeking a general network structure, rather than limiting the search to a subset of rows giving at most one + 1 and one - 1 in each column, as has been done previously.