Pages that link to "Item:Q1244239"
From MaRDI portal
The following pages link to The Min-Max Spanning Tree Problem and some extensions (Q1244239):
Displayed 50 items.
- Possibilistic bottleneck combinatorial optimization problems with ill-known weights (Q433509) (← links)
- Maximum weight archipelago subgraph problem (Q490157) (← links)
- Minimum deviation and balanced optimization: A unified approach (Q806674) (← links)
- A linear time algorithm for the maximum capacity path problem (Q809905) (← links)
- Partial inverse min-max spanning tree problem (Q830941) (← links)
- The minimum moving spanning tree problem (Q832829) (← links)
- Cuttings for disks and axis-aligned rectangles in three-space (Q848675) (← links)
- k-sum optimization problems (Q916568) (← links)
- Inverse min-max spanning tree problem under the weighted sum-type Hamming distance (Q924129) (← links)
- Dynamic bottleneck optimization for \(k\)-edge and 2-vertex connectivity (Q963381) (← links)
- The tricriterion shortest path problem with at least two bottleneck objective functions (Q1026760) (← links)
- Constrained inverse min-max spanning tree problems under the weighted Hamming distance (Q1029667) (← links)
- The bottleneck \(k\)-MST (Q1041824) (← links)
- Solving the 2-rooted mini-max spanning forest problem by branch-and-bound (Q1043334) (← links)
- Most and least uniform spanning trees (Q1087546) (← links)
- Complexity of spanning tree problems: Part I (Q1145635) (← links)
- The image of weighted combinatorial problems (Q1179736) (← links)
- The partial sum criterion for Steiner trees in graphs and shortest paths (Q1278596) (← links)
- A fast and simple algorithm for the bottleneck biconnected spanning subgraph problem (Q1329426) (← links)
- On combined minmax-minsum optimization (Q1333027) (← links)
- Arborescence optimization problems solvable by Edmonds' algorithm (Q1399999) (← links)
- Lexicographic balanced optimization problems (Q1433654) (← links)
- The minimum labeling spanning trees (Q1567492) (← links)
- Minmax regret solutions for minimax optimization problems with uncertainty (Q1591541) (← links)
- Solving some lexicographic multi-objective combinatorial problems (Q1598728) (← links)
- Upgrading min-max spanning tree problem under various cost functions (Q1680539) (← links)
- An algebraic framework for minimum spanning tree problems (Q1786562) (← links)
- In memoriam Paolo M. Camerini (Q1803668) (← links)
- A linear time algorithm for the bottleneck biconnected spanning subgraph problem (Q1847357) (← links)
- A fast algorithm for a class of bottleneck problems (Q1916054) (← links)
- Constrained matroidal bottleneck problems (Q1917230) (← links)
- On some multicriteria arborescence problems: Complexity and algorithms (Q1917271) (← links)
- On weighting two criteria with a parameter in combinatorial optimization problems (Q1926813) (← links)
- Euclidean bottleneck bounded-degree spanning tree ratios (Q2066315) (← links)
- Bounded-angle minimum spanning trees (Q2072102) (← links)
- Efficient computation of tolerances in the sensitivity analysis of combinatorial bottleneck problems (Q2089667) (← links)
- Distributionally robust bottleneck combinatorial problems: uncertainty quantification and robust decision making (Q2097653) (← links)
- Online learning for min-max discrete problems (Q2166779) (← links)
- An efficient heuristic algorithm for the bottleneck traveling salesman problem (Q2269075) (← links)
- Degree bounded bottleneck spanning trees in three dimensions (Q2292155) (← links)
- Approximate spanning cactus (Q2353648) (← links)
- Some inverse min-max network problems under weighted \(l_1\) ans \(l_{\infty}\) norms with bound constraints on changes (Q2385479) (← links)
- Bottleneck combinatorial optimization problems with uncertain costs and the OWA criterion (Q2450748) (← links)
- (Q4969037) (← links)
- Algorithms for Euclidean Degree Bounded Spanning Tree Problems (Q5197492) (← links)
- Quadratic bottleneck problems (Q5392805) (← links)
- Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin–Marsten bounding (Q5865336) (← links)
- (Q5881545) (← links)
- The Minimum Moving Spanning Tree Problem (Q5886031) (← links)
- A class of bottleneck expansion problems (Q5936134) (← links)