Algorithms for two bottleneck optimization problems
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 4014451
- An optimal algorithm for \(2 \times{} n\) bottleneck transportation problems
- A fast algorithm for a class of bottleneck problems
- A bilevel bottleneck programming problem
- An Optimal Algorithm for the Maximum Two-Chain Problem
- An optimal algorithm for the two-order multiple problem
- Algorithm for a bottleneck optimization problem in data processing and data transmission systems
- An algorithm for solving two-level convex optimization problems
- An algorithm for the bottleneck generalized assignment problem
- scientific article; zbMATH DE number 969179
Cited in
(75)- On the weak robustness of interval fuzzy matrices
- Linear time approximation algorithms for~degree~constrained subgraph problems
- Dynamic bottleneck optimization for \(k\)-edge and 2-vertex connectivity
- The \(k\)-centrum Chinese postman delivery problem and a related cost allocation game
- A stronger lower bound on parametric minimum spanning trees
- Computation of lower tolerances of combinatorial bottleneck problems
- Path-matching problems
- An O(n) algorithm to solve the Bottleneck Traveling Salesman Problem restricted to ordered product matrices
- A stronger lower bound on parametric minimum spanning trees
- Arborescence optimization problems solvable by Edmonds' algorithm
- Linear independence in bottleneck algebras
- Higher-order triangular-distance Delaunay graphs: graph-theoretical properties
- Selected topics on assignment problems
- The complexity of bottleneck labeled graph problems
- Algebraic theory on shortest paths for all flows
- Bottleneck partial-matching Voronoi diagrams and applications
- Bottleneck flows in unit capacity networks
- Scheduling problems on parallel machines with machine-dependent generalized due-dates
- Computing fair and bottleneck matchings in geometric graphs
- Uniform machine scheduling of unit-time jobs subject to resource constraints
- Deterministic Graphical Games Revisited
- A greedy and distributable approach to the Lexicographic Bottleneck Assignment Problem with conditions on exactness
- Visualization of bipartite graphs in limited window size
- An Improved Algorithm for the Constrained Bottleneck Spanning Tree Problem
- scientific article; zbMATH DE number 63645 (Why is no real title available?)
- Quadratic bottleneck problems
- Solution methods and computational investigations for the linear bottleneck assignment problem
- An efficient algorithm for the Steiner tree problem with revenue, bottleneck and hop objective functions
- Possibilistic bottleneck combinatorial optimization problems with ill-known weights
- Forests, frames, and games: Algorithms for matroid sums and applications
- Trapezoidal matrices and the bottleneck assignment problem
- Strong regularity of matrices -- a survey of results
- Improved polynomial algorithms for robust bottleneck problems with interval data
- On some matching problems under the color-spanning model
- The dominance assignment problem
- scientific article; zbMATH DE number 7255037 (Why is no real title available?)
- A heuristic for decomposing traffic matrices in TDMA satellite communication
- scientific article; zbMATH DE number 7121921 (Why is no real title available?)
- Dynamic Euclidean bottleneck matching
- Random assignment problems
- A simple algorithm for \(r\)-gatherings on the line
- The stochastic bottleneck linear programming problem
- On algorithms for the tricriteria shortest path problem with two bottleneck objective functions
- The tricriterion shortest path problem with at least two bottleneck objective functions
- Minmax scheduling and due-window assignment with position-dependent processing times and job rejection
- An Oracle Strongly Polynomial Algorithm for Bottleneck Expansion Problems
- Most and least uniform spanning trees
- Online learning for min-max discrete problems
- Transitive blocks and their applications in fuzzy interconnection networks
- A linear time algorithm for the \(r\)-gathering problem on the line
- Minimizing weighted earliness-tardiness and due-date cost with unit processing-time jobs
- All-pairs bottleneck paths in vertex weighted graphs
- The bottleneck \(k\)-MST
- An optimal algorithm for \(2 \times{} n\) bottleneck transportation problems
- Serve or skip: the power of rejection in online bottleneck matching
- Solving the Euclidean bottleneck matching problem by \(k\)-relative neighborhood graphs
- The random linear bottleneck assignment problem
- Bottleneck matching in the plane
- Computing Euclidean bottleneck matchings in higher dimensions
- scientific article; zbMATH DE number 3942929 (Why is no real title available?)
- Single-source bottleneck path algorithm faster than sorting for sparse graphs
- Some results concerning the complexity of restricted colorings of graphs
- A fast and simple algorithm for the bottleneck biconnected spanning subgraph problem
- Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem
- On element-connectivity preserving graph simplification
- An efficient heuristic algorithm for the bottleneck traveling salesman problem
- Bottleneck combinatorial optimization problems with uncertain costs and the OWA criterion
- A class of bottleneck expansion problems
- A linear time algorithm for the bottleneck biconnected spanning subgraph problem
- A fast algorithm for a class of bottleneck problems
- Efficient computation of tolerances in the sensitivity analysis of combinatorial bottleneck problems
- Preconditioning techniques based on the Birkhoff-von Neumann decomposition
- Proportionate flowshops with general position-dependent processing times
- The algebraic Monge property and path problems
- Algebraic theory on shortest paths for all flows
This page was built for publication: Algorithms for two bottleneck optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3799842)
