Quadratic bottleneck problems
From MaRDI portal
Publication:5392805
DOI10.1002/nav.20446zbMath1216.90074OpenAlexW2081756636MaRDI QIDQ5392805
Abraham P. Punnen, Ruonan Zhang
Publication date: 14 April 2011
Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.20446
Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Optimality conditions and duality in mathematical programming (90C46) Combinatorial optimization (90C27)
Related Items (4)
Quadratic bottleneck knapsack problems ⋮ Fairness in academic course timetabling ⋮ A branch and cut algorithm for minimum spanning trees under conflict constraints ⋮ The quadratic balanced optimization problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Balanced optimization problems
- Minimum deviation and balanced optimization: A unified approach
- k-sum optimization problems
- Most and least uniform spanning trees
- On finding most uniform spanning trees
- Reducibility of minimax to minisum 0-1 programming problems
- The Min-Max Spanning Tree Problem and some extensions
- An \(O(m\log n)\) algorithm for the max+sum spanning tree problem
- Parallel algorithm to find maximum capacity paths
- Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem
- Solution methods and computational investigations for the linear bottleneck assignment problem
- Arborescence optimization problems solvable by Edmonds' algorithm
- Weighted graphs with all Hamiltonian cycles of the same length
- Fuzzy random bottleneck spanning tree problems using possibility and necessity measures
- Genetic algorithm approach on multi-criteria minimum spanning tree problem
- A fast algorithm for a class of bottleneck problems
- On \(k\)-sum optimization
- A note on the asymptotic behaviour of bottleneck problems
- Mosaicking of Aerial Photographic Maps Via Seams Defined by Bottleneck Shortest Paths
- The Backboard Wiring Problem: A Placement Algorithm
- On three basic methods for solving bottleneck transportation problems
- Algorithms for two bottleneck optimization problems
- Quadratic knapsack problems
- On random quadratic bottleneck assignment problems
- Combinational optimization problems for which almost every algorithm is asymptotically optimal
- An Improved Algorithm for the Constrained Bottleneck Spanning Tree Problem
- Bottleneck extrema
- The bottleneck transportation problem
This page was built for publication: Quadratic bottleneck problems
