scholar.google.com › citations
Oct 16, 2010 · In particular, we show that GBaOP can be solved in polynomial time if an associated bottleneck problem can be solved in polynomial time. For the ...
In the generalized balanced optimization problem (GBaOP) the objective value $${\max_{e \in S}{|c(e)-k\max(S)|}}$$ is minimized over all feasible subsets S ...
Explore millions of resources from scholarly journals, books, newspapers, videos and more, on the ProQuest Platform.
We show that any game is k-balanced for a suitable choice of k, so that the corresponding k-additive core is not empty. For the games in the k-additive core, we ...
Oct 16, 2010 · Abstract In the generalized balanced optimization problem (GBaOP) the objec- tive value maxe∈S |c(e) − k max(S)| is minimized over all ...
Abstract: In the generalized balanced optimization problem (GBaOP) the objective value max e ∈ S | c ( e ) − k max ( S ) | is minimized over all feasible ...
Oct 16, 2010 · In particular, we show that GBaOP can be solved in polynomial time if an associated bottleneck problem can be solved in polynomial time. For the ...
Abstract: In the generalized balanced optimization problem (GBaOP) the objective value max e ∈ S | c ( e ) - k max ( S ) is minimized over all feasible subsets ...
On generalized balanced optimization problems. Math. Methods Oper. Res. 73(1): 19-27 (2011). a service of Schloss Dagstuhl - Leibniz Center for Informatics.
People also ask
What is general optimization problem?
What are the 3 parts of any optimization problem?
What are the different types of optimization problems?
What are the five steps in solving optimization problems?
Minimum deviation and balanced optimization: A unified approach
www.sciencedirect.com › article › pii
We introduce a general solution scheme that is also suited for balanced optimization, i.e., the problem to find a solution that has a minimal deviation ...