The quadratic balanced optimization problem
From MaRDI portal
Publication:2339810
DOI10.1016/j.disopt.2014.01.001zbMath1308.90152arXiv1212.4211MaRDI QIDQ2339810
Bishnu Bhattacharyya, Sara Taghipour, Abraham P. Punnen, Daniel Karapetyan
Publication date: 9 April 2015
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1212.4211
heuristics; combinatorial optimization; knapsack problem; bottleneck problems; balanced optimization
90C60: Abstract computational complexity for mathematical programming problems
90C20: Quadratic programming
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
Related Items
Effective metaheuristic algorithms for the minimum differential dispersion problem, A hybrid metaheuristic of integrating estimation of distribution algorithm with Tabu search for the max-mean dispersion problem, Tabu search guided by reinforcement learning for the max-mean dispersion problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The minimum spanning tree problem with conflict constraints and its variations
- The balanced traveling salesman problem
- On generalized balanced optimization problems
- Paths, trees and matchings under disjunctive constraints
- Balanced optimization problems
- Maximum weight independent sets in hole- and co-chair-free graphs
- Minimum deviation and balanced optimization: A unified approach
- Most and least uniform spanning trees
- Minimum cost-reliability ratio path problem
- On finding most uniform spanning trees
- Minimization of maximum absolute deviation in integers
- An \(\varepsilon\)-approximation scheme for combinatorial optimization problems with minimum variance criterion
- The balanced linear programming problem
- Minimizing maximum absolute lateness and range of lateness under generalized due dates on a single machine
- On combined minmax-minsum optimization
- Minimum dispersion problems
- Paths with minimum range and ratio of arc lengths
- A strongly polynomial algorithm for the uniform balanced network flow problem
- Lexicographic balanced optimization problems
- A new unifying heuristic algorithm for the undirected minimum cut problems using minimum range cut algorithms
- Constrained balanced optimization problems
- Quadratic bottleneck knapsack problems
- An Algorithm for Minimizing the Range of Lateness on a Single Machine
- Minimizing the Range of Lateness on a Single Machine
- Improved Bounds for the Range of Lateness on a Single Machine
- Efficient algorithms for minimum range cut problems
- Minimum Range Balanced Cuts via Dynamic Subset Sums
- Minimizing The Range Of Lateness On A Single Machine Under Generalized Due Dates
- Balanced problems on graphs with categorization of edges
- Balanced paths in acyclic networks: Tractable cases and related approaches
- Quadratic bottleneck problems
- Bottleneck extrema
- Independent Sets of Maximum Weight in Apple-Free Graphs
- An algorithm to determine a path with minimal cost/capacity ratio