Quadratic bottleneck problems

DOI10.1002/NAV.20446MaRDI QIDQ5392805zbMATH OpenOpenAlexFDO

Authors Abraham P. Punnen, Ruonan Zhang

Publication date 14 April 2011

Published in Naval Research Logistics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/nav.20446

zbMATH Keywords

bottleneck extremabottleneck problemscombinatorial optimizationquadratic optimization

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Programming involving graphs or networks (90C35) Optimality conditions and duality in mathematical programming (90C46) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Quadratic bottleneck knapsack problems
• Generalized Bottleneck Problems^∗
• The quadratic minimum spanning tree problem: a lower bounding procedure and an efficient search algorithm
• scientific article; zbMATH DE number 35513

Cites work

• A fast algorithm for a class of bottleneck problems
• A note on the asymptotic behaviour of bottleneck problems
• Algorithms for two bottleneck optimization problems
• An O(m n) algorithm for the max+sum spanning tree problem
• An Improved Algorithm for the Constrained Bottleneck Spanning Tree Problem
• Arborescence optimization problems solvable by Edmonds' algorithm
• Balanced optimization problems
• Bottleneck extrema
• Combinational optimization problems for which almost every algorithm is asymptotically optimal
• Fuzzy random bottleneck spanning tree problems using possibility and necessity measures
• Genetic algorithm approach on multi-criteria minimum spanning tree problem
• scientific article; zbMATH DE number 5485494 (Why is no real title available?)
• scientific article; zbMATH DE number 35513 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1281677 (Why is no real title available?)
• Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem
• k-sum optimization problems
• Minimum deviation and balanced optimization: A unified approach
• Mosaicking of aerial photographic maps via seams defined by bottleneck shortest paths
• Most and least uniform spanning trees
• On \(k\)-sum optimization
• On finding most uniform spanning trees
• On random quadratic bottleneck assignment problems
• On three basic methods for solving bottleneck transportation problems
• Parallel algorithm to find maximum capacity paths
• Quadratic knapsack problems
• Reducibility of minimax to minisum 0-1 programming problems
• Solution methods and computational investigations for the linear bottleneck assignment problem
• The Backboard Wiring Problem: A Placement Algorithm
• The bottleneck transportation problem
• The Min-Max Spanning Tree Problem and some extensions
• Weighted graphs with all Hamiltonian cycles of the same length

Cited in

(7)

• Bottleneck options
• A branch and cut algorithm for minimum spanning trees under conflict constraints
• The quadratic balanced optimization problem
• Quadratic bottleneck knapsack problems
• Fairness in academic course timetabling
• Polynomial algorithms for solving the quadratic bottleneck assignment problem on networks
• On conflict-free spanning tree: mapping tractable and hard instances through the lenses of graph classes

This page was built for publication: Quadratic bottleneck problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5392805)