The quadratic balanced optimization problem
From MaRDI portal
Publication:2339810
Abstract: We introduce the quadratic balanced optimization problem (QBOP) which can be used to model equitable distribution of resources with pairwise interaction. QBOP is strongly NP-hard even if the family of feasible solutions has a very simple structure. Several general purpose exact and heuristic algorithms are presented. Results of extensive computational experiments are reported using randomly generated quadratic knapsack problems as the test bed. These results illustrate the efficacy of our exact and heuristic algorithms. We also show that when the cost matrix is specially structured, QBOP can be solved as a sequence of linear balanced optimization problems. As a consequence, we have several polynomially solvable cases of QBOP.
Recommendations
Cites work
- scientific article; zbMATH DE number 3564691 (Why is no real title available?)
- scientific article; zbMATH DE number 1766721 (Why is no real title available?)
- A new unifying heuristic algorithm for the undirected minimum cut problems using minimum range cut algorithms
- A strongly polynomial algorithm for the uniform balanced network flow problem
- An Algorithm for Minimizing the Range of Lateness on a Single Machine
- An \(\varepsilon\)-approximation scheme for combinatorial optimization problems with minimum variance criterion
- An algorithm to determine a path with minimal cost/capacity ratio
- Balanced optimization problems
- Balanced paths in acyclic networks: Tractable cases and related approaches
- Balanced problems on graphs with categorization of edges
- Bottleneck extrema
- Constrained balanced optimization problems
- Efficient algorithms for minimum range cut problems
- Improved Bounds for the Range of Lateness on a Single Machine
- Independent sets of maximum weight in apple-free graphs
- Lexicographic balanced optimization problems
- Maximum weight independent sets in hole- and co-chair-free graphs
- Minimization of maximum absolute deviation in integers
- Minimizing The Range Of Lateness On A Single Machine Under Generalized Due Dates
- Minimizing maximum absolute lateness and range of lateness under generalized due dates on a single machine
- Minimizing the Range of Lateness on a Single Machine
- Minimum Range Balanced Cuts via Dynamic Subset Sums
- Minimum cost-reliability ratio path problem
- Minimum deviation and balanced optimization: A unified approach
- Minimum dispersion problems
- Most and least uniform spanning trees
- On combined minmax-minsum optimization
- On finding most uniform spanning trees
- On generalized balanced optimization problems
- Paths with minimum range and ratio of arc lengths
- Paths, trees and matchings under disjunctive constraints
- Quadratic bottleneck knapsack problems
- Quadratic bottleneck problems
- The balanced linear programming problem
- The balanced traveling salesman problem
- The color-balanced spanning tree problem.
- The minimum spanning tree problem with conflict constraints and its variations
Cited in
(7)- The quadratic Gaussian CEO problem
- Effective metaheuristic algorithms for the minimum differential dispersion problem
- scientific article; zbMATH DE number 7033214 (Why is no real title available?)
- Tabu search guided by reinforcement learning for the max-mean dispersion problem
- Constrained balanced optimization problems
- A hybrid metaheuristic of integrating estimation of distribution algorithm with Tabu search for the max-mean dispersion problem
- Balanced optimization problems
This page was built for publication: The quadratic balanced optimization problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2339810)
