Pages that link to "Item:Q3799842"
From MaRDI portal
The following pages link to Algorithms for two bottleneck optimization problems (Q3799842):
Displaying 50 items.
- Serve or skip: the power of rejection in online bottleneck matching (Q346521) (← links)
- Possibilistic bottleneck combinatorial optimization problems with ill-known weights (Q433509) (← links)
- The \(k\)-centrum Chinese postman delivery problem and a related cost allocation game (Q477339) (← links)
- Preconditioning techniques based on the Birkhoff-von Neumann decomposition (Q521649) (← links)
- All-pairs bottleneck paths in vertex weighted graphs (Q633850) (← links)
- Linear independence in bottleneck algebras (Q679013) (← links)
- Selected topics on assignment problems (Q697571) (← links)
- A stronger lower bound on parametric minimum spanning trees (Q832875) (← links)
- Bottleneck partial-matching Voronoi diagrams and applications (Q902422) (← links)
- Higher-order triangular-distance Delaunay graphs: graph-theoretical properties (Q904106) (← links)
- Random assignment problems (Q953417) (← links)
- Dynamic bottleneck optimization for \(k\)-edge and 2-vertex connectivity (Q963381) (← links)
- On algorithms for the tricriteria shortest path problem with two bottleneck objective functions (Q976042) (← links)
- Bottleneck flows in unit capacity networks (Q976109) (← links)
- An efficient algorithm for the Steiner tree problem with revenue, bottleneck and hop objective functions (Q992574) (← links)
- The tricriterion shortest path problem with at least two bottleneck objective functions (Q1026760) (← links)
- The bottleneck \(k\)-MST (Q1041824) (← links)
- Improved polynomial algorithms for robust bottleneck problems with interval data (Q1046706) (← links)
- Most and least uniform spanning trees (Q1087546) (← links)
- Some results concerning the complexity of restricted colorings of graphs (Q1186161) (← links)
- Forests, frames, and games: Algorithms for matroid sums and applications (Q1186784) (← links)
- An optimal algorithm for \(2 \times{} n\) bottleneck transportation problems (Q1186949) (← links)
- Path-matching problems (Q1193516) (← links)
- Solving the Euclidean bottleneck matching problem by \(k\)-relative neighborhood graphs (Q1194341) (← links)
- The stochastic bottleneck linear programming problem (Q1304778) (← links)
- An \(O(n)\) algorithm to solve the Bottleneck Traveling Salesman Problem restricted to ordered product matrices (Q1314323) (← links)
- Strong regularity of matrices -- a survey of results (Q1314327) (← links)
- A fast and simple algorithm for the bottleneck biconnected spanning subgraph problem (Q1329426) (← links)
- Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem (Q1337676) (← links)
- Solution methods and computational investigations for the linear bottleneck assignment problem (Q1377280) (← links)
- Uniform machine scheduling of unit-time jobs subject to resource constraints (Q1392579) (← links)
- Arborescence optimization problems solvable by Edmonds' algorithm (Q1399999) (← links)
- Computing Euclidean bottleneck matchings in higher dimensions (Q1607062) (← links)
- The algebraic Monge property and path problems (Q1765525) (← links)
- Transitive blocks and their applications in fuzzy interconnection networks (Q1795382) (← links)
- Trapezoidal matrices and the bottleneck assignment problem (Q1805450) (← 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)
- The dominance assignment problem (Q1926493) (← links)
- Proportionate flowshops with general position-dependent processing times (Q1944066) (← links)
- Minmax scheduling and due-window assignment with position-dependent processing times and job rejection (Q2026708) (← links)
- Efficient computation of tolerances in the sensitivity analysis of combinatorial bottleneck problems (Q2089667) (← links)
- A greedy and distributable approach to the Lexicographic Bottleneck Assignment Problem with conditions on exactness (Q2125539) (← links)
- Online learning for min-max discrete problems (Q2166779) (← links)
- An efficient heuristic algorithm for the bottleneck traveling salesman problem (Q2269075) (← links)
- On some matching problems under the color-spanning model (Q2319899) (← links)
- On the weak robustness of interval fuzzy matrices (Q2341828) (← links)
- Algebraic theory on shortest paths for all flows (Q2424883) (← links)
- Bottleneck combinatorial optimization problems with uncertain costs and the OWA criterion (Q2450748) (← links)
- Minimizing weighted earliness-tardiness and due-date cost with unit processing-time jobs (Q2490167) (← links)
