Pascal and Francis Bibliographic Databases

Help

Export

Selection :

Permanent link
http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=22772897

The Regenerator Location Problem

Author
SI CHEN1 ; LJUBIE, Ivana2 ; RAGHAVAN, S3
[1] College of Business and Public Affairs, Murray State University, Murray, Kentucky 42071, United States
[2] Department of Statistics and Decision Support Systems, Faculty of Business, Economics and Statistics, University of Vienna, Vienna 1210, Austria
[3] Robert H. Smith School of Business & Institute for Systems Research, University of Maryland, College Park, Maryland 20742, United States
Conference title
Special Issue on Network Optimization (INOC 2007)
Conference name
International Network Optimization Conference (INOC 2007) (INOC 2007) (3 ; Spa 2007-04-22)
Author (monograph)
FORTZ, Bernard (Editor); GOUVEIA, Luis (Editor)
Association of European Operational Research Societies (EURO), European Network Optimization Group (ENOG), Europe (Organiser of meeting)
Source

Networks (New York, NY). 2010, Vol 55, Num 3, pp 205-220, 16 p ; ref : 16 ref

CODEN
NTWKAA
ISSN
0028-3045
Scientific domain
Control theory, operational research; Computer science
Publisher
Wiley, Hoboken, NJ
Publication country
United States
Document type
Conference Paper
Language
English
Author keyword
Steiner arborescence problem branch-and-cut greedy heuristics maximum leaf spanning tree problem optical network design
Keyword (fr)
Arbre maximal Coût Cycle régénération Durée trajet Modélisation Méthode heuristique Méthode séparation et coupe Problème NP complet Problème arbre Steiner Problème localisation Réseau communication Réseau fibre optique Solution optimale Système réparti Transmission optique Réseau transmission
Keyword (en)
Spanning tree Costs Regeneration cycle Travel time Modeling Heuristic method Branch and cut method NP complete problem Steiner tree problem Location problem Communication network Optical fiber network Optimal solution Distributed system Optical transmission Transmission networks
Keyword (es)
Arbol máximo Coste Ciclo regeneración Duración trayecto Modelización Método heurístico Método branch and cut Problema NP completo Problema arbol Steiner Problema localización Red de comunicación Red fibra óptica Solución óptima Sistema repartido Transmisión óptica Redes de transmisión
Classification
Pascal
001 Exact sciences and technology / 001D Applied sciences / 001D01 Operational research. Management science / 001D01A Operational research and scientific management / 001D01A04 Flows in networks. Combinatorial problems

Pascal
001 Exact sciences and technology / 001D Applied sciences / 001D01 Operational research. Management science / 001D01A Operational research and scientific management / 001D01A15 Logistics

Pascal
001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02B Software / 001D02B04 Computer systems and distributed systems. User interface

Discipline
Computer science : theoretical automation and systems Operational research. Management
Origin
Inist-CNRS
Database
PASCAL
INIST identifier
22772897

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

Searching the Web