X
Search Filters
Format Format
Format Format
X
Sort by Item Count (A-Z)
Filter by Count
Journal Article (1454) 1454
Conference Proceeding (635) 635
Publication (109) 109
Dissertation (74) 74
Book Chapter (34) 34
Book / eBook (15) 15
Magazine Article (12) 12
Paper (8) 8
Newspaper Article (5) 5
Book Review (4) 4
Transcript (1) 1
Web Resource (1) 1
more...
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
steiner trees (650) 650
algorithms (535) 535
steiner tree (532) 532
mathematics, applied (358) 358
routing (349) 349
approximation algorithms (326) 326
computer science (307) 307
optimization (277) 277
operations research & management science (242) 242
mathematics (241) 241
trees (217) 217
computer science, theory & methods (204) 204
networks (196) 196
graphs (195) 195
computer science, hardware & architecture (193) 193
engineering, electrical & electronic (193) 193
steiner tree problem (172) 172
algorithm (170) 170
computer science, information systems (146) 146
approximation algorithm (138) 138
telecommunications (136) 136
analysis (135) 135
steiner problem (128) 128
algorithm design and analysis (123) 123
studies (123) 123
computer science, interdisciplinary applications (121) 121
multicast (112) 112
computer science, software engineering (109) 109
heuristic algorithms (108) 108
approximation (106) 106
network design (106) 106
theory of computation (104) 104
very large scale integration (103) 103
combinatorics (96) 96
delay (96) 96
topology (92) 92
mathematical analysis (90) 90
costs (87) 87
mathematical models (87) 87
multicast routing (84) 84
polynomials (74) 74
computer networks (73) 73
graph theory (73) 73
wireless sensor networks (68) 68
tree graphs (66) 66
research (63) 63
linear programming (61) 61
quality of service (61) 61
algorithm analysis and problem complexity (60) 60
mathematics of computing (58) 58
combinatorial optimization (57) 57
usage (57) 57
wire (57) 57
integer programming (55) 55
multicast algorithms (55) 55
baumstruktur (54) 54
joining processes (54) 54
operations research/decision theory (53) 53
heuristic (52) 52
decision trees (50) 50
genetic algorithm (50) 50
steiner (49) 49
wireless networks (49) 49
genetic algorithms (48) 48
data structures, cryptology and information theory (47) 47
computational geometry (46) 46
design (46) 46
approximation methods (45) 45
heuristics (45) 45
mathematical optimization (44) 44
operations research (44) 44
computer systems organization and communication networks (43) 43
integrated circuit interconnections (43) 43
leitweglenkung (43) 43
connectivity (42) 42
relays (41) 41
artificial intelligence (40) 40
construction (39) 39
convex and discrete geometry (39) 39
cost function (39) 39
computer science, artificial intelligence (38) 38
models (38) 38
operation research/decision theory (38) 38
pins (38) 38
wires (38) 38
applied mathematics (37) 37
steiner minimal tree (37) 37
complexity (36) 36
graph (36) 36
mathematical modeling and industrial mathematics (36) 36
ad hoc networks (35) 35
computation (35) 35
design engineering (35) 35
dynamic programming (35) 35
methods (35) 35
terminals (35) 35
traveling salesman problem (35) 35
network topology (34) 34
physical design (34) 34
bandwidth (33) 33
more...
Library Location Library Location
Language Language
Language Language
X
Sort by Item Count (A-Z)
Filter by Count
English (2062) 2062
Japanese (25) 25
Chinese (24) 24
French (7) 7
Korean (5) 5
German (4) 4
Portuguese (2) 2
Russian (2) 2
Spanish (1) 1
Turkish (1) 1
more...
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


1992, Annals of discrete mathematics, ISBN 044489098X, Volume 53., xi, 339
Book
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, ISSN 0129-0541, 11/2017, Volume 28, Issue 7, pp. 869 - 887
We introduce and study a new Steiner tree problem variation called the bursty Steiner tree problem where new nodes arrive into bursts. This is an online... 
approximation | Steiner tree | BOUNDS | online execution | COMPUTER SCIENCE, THEORY & METHODS | terminal Steiner tree | terminal bursts
Journal Article
Advances in Calculus of Variations, ISSN 1864-8258, 01/2016, Volume 9, Issue 1, pp. 19 - 39
The Steiner tree problem can be stated in terms of finding a connected set of minimal length containing a given set of finitely many points. We show how to... 
rectifiable currents | chains | flat | 49Q15 | Steiner tree problem | calibration | 49Q20 | flat G-chains | MATHEMATICS | MATHEMATICS, APPLIED | FLAT CHAINS | METRIC SPACE | SETS | PARTITIONS | SOAP FILMS | FINITE PERIMETER | Decision trees | Optimization | Trees | Representations | Calibration | Mathematical analysis | Calculus of variations | Mathematics - Optimization and Control
Journal Article
Networks, ISSN 0028-3045, 01/2020, Volume 75, Issue 1, pp. 3 - 17
The Steiner tree problem (STP) is a classical NP‐hard combinatorial optimization problem with applications in computational biology and network wiring. The... 
linear programming relaxation | mixed‐integer linear programming | extended formulation | Steiner tree | integrality gap | flow‐based formulation | flow-based formulation | mixed-integer linear programming | Wiring | Lower bounds | Apexes | Minimum cost | Linear programming | Graphs | Graph theory | Decision trees | Combinatorial analysis | Optimization
Journal Article
Engineering Optimization, ISSN 0305-215X, 11/2019, Volume 51, Issue 11, pp. 1980 - 1996
This article introduces a novel method using mixed-integer linear programming for optimizing sewer layouts. The research concept was obtained from the... 
sewer layout | Steiner minimal tree | mixed-integer linear programming | Optimization | Integrated circuits | Integer programming | Layouts | Circuit design | Linear programming | Cost analysis | Nodes | Construction costs | Design optimization
Journal Article
Algorithmica, ISSN 0178-4617, 4/2013, Volume 65, Issue 4, pp. 868 - 884
Journal Article
European Journal of Operational Research, ISSN 0377-2217, 05/2020, Volume 283, Issue 1, pp. 1 - 15
•We focus on the generalized minimum spanning tree problem.•Some of the main known results relative to this problem are surveyed.•The paper is structured... 
Combinatorial optimization | Survey | Generalized minimum spanning tree problem | DESIGN | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | problem | NEIGHBORHOOD SEARCH | Generalized minimum spanning tree | STEINER PROBLEMS | ALGORITHM
Journal Article
Applied Soft Computing Journal, ISSN 1568-4946, 11/2019, Volume 84
This study investigates a hierarchized Steiner tree problem in telecommunication networks. In such networks, users must be connected to capacitated hubs.... 
Co-evolutionary algorithms | Bi-level programming | Steiner tree problem | DESIGN | COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS | OPTIMIZATION | HEURISTICS | COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Journal Article
Evolutionary Computation, ISSN 1530-9304, 12/2017, Volume 25, Issue 4, pp. 707 - 723
Journal Article
European Journal of Operational Research, ISSN 0377-2217, 08/2017, Volume 261, Issue 1, pp. 54 - 66
•The framework considers connected facility location, (generalized) Steiner tree-star, rent-or-buy problems.•Dual ascent algorithm for asymmetric connected... 
Connected facility location | Dual ascent | Benders decomposition | Combinatorial optimization | Branch-and-cut | STEINER PROBLEM | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | APPROXIMATION ALGORITHMS | Heuristic programming | Mathematical optimization | Analysis | Decomposition method | Computer Science | Operations Research
Journal Article
Computers and Operations Research, ISSN 0305-0548, 06/2018, Volume 94, pp. 38 - 51
•Four novel reliability measures for ring tree network design are proposed as an alternative for cost minimization.•We develop a generic ϵ-constraint method to... 
Capacitated ring tree problem | Bi-objective optimization | Reliable network design | Telecommunications | Steiner tree | Mathematical programming | DESIGN | COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | MULTIOBJECTIVE NETWORK | ENGINEERING, INDUSTRIAL
Journal Article
European Journal of Operational Research, ISSN 0377-2217, 10/2018, Volume 270, Issue 2, pp. 419 - 429
•A fixed-parameter algorithm for the rectilinear travelling salesman problem.•A fixed-parameter algorithm for the rectilinear Steiner tree problem.•A refined... 
Traveling salesman | Rectilinear Steiner tree problem | Fixed-parameter algorithm | Rectilinear traveling salesman problem | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | WAREHOUSE | TIME | Services | Usage | Graph theory | Sales personnel | Management | Computer Science | Operations Research
Journal Article
Optimization Letters, ISSN 1862-4472, 03/2019, Volume 13, Issue 2, pp. 341 - 348
This paper studies a 4-approximation algorithm for k-prize collecting Steiner tree problems. This problem generalizes both k-minimum spanning tree problems and... 
Primal-dual algorithm | Approximation algorithm | k-prize collecting traveling salesman problems | k-prize collecting Steiner tree problems | MATHEMATICS, APPLIED | OPERATIONS RESEARCH & MANAGEMENT SCIENCE
Journal Article
European Journal of Operational Research, ISSN 0377-2217, 09/2013, Volume 229, Issue 3, pp. 599 - 612
•The paper deals with the Robust PCStT, addressing interval uncertainty on its data.•Different mathematical programming formulations are... 
Interval uncertainty | Mixed integer programming | Robust optimization | Prize collecting Steiner trees | Branch-and-cut | Steiner trees | Prize collecting | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | PRICE | ALGORITHM | OPTIMIZATION | Robust statistics | Mathematical optimization | Analysis
Journal Article
Computers and Operations Research, ISSN 0305-0548, 07/2017, Volume 83, pp. 13 - 27
•We consider budget constrained network upgrading problems.•Lagrangian Relaxations and Branch-and-cut algorithms are designed.•Additional algorithmic... 
Integer programming | Spanning tree problems | Lagrangian relaxation | COLLECTING STEINER PROBLEM | COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | ENGINEERING, INDUSTRIAL | Management science | Algorithms | Computer Science | Operations Research
Journal Article
No results were found for your search.

Cannot display more than 1000 results, please narrow the terms of your search.