A complete linear inequality description and volume formula are derived for the convex hull of the graph of a monomial on a nonnegative box with at most one positive lower bound.
Axiomatic characterizations of generalized values.Discrete Applied Mathematics, 155(1):26–43
6 Pith papers cite this work. Polarity classification is still indexing.
6
Pith papers citing it
years
2026 6verdicts
UNVERDICTED 6representative citing papers
VEGA is a derivative-free genetic algorithm that constructs Voronoi neighborhoods around retained elite candidates to balance exploitation and exploration in high-dimensional statistical optimization.
ProxySHAP approximates higher-order Shapley and Banzhaf interactions via tree proxies plus residual correction and a polynomial-time interventional TreeSHAP generalization for tree ensembles.
Characterization and enumeration of gapped repeats in the cyclic Fibonacci word.
Introduces SSAP and reports that an Iterated Local Search heuristic outperforms a commercial solver on complex classroom instances with many conflicts.
Relates signed total Roman domination number on cubic graphs to open packing, 2-tuple total domination, and signed total domination numbers to derive bounds and NP-completeness; shows domatic number determined by degree-3 vertices; computes exact values on complete multipartite graphs.
citing papers explorer
-
On the convex hull of the graph of a simple monomial
A complete linear inequality description and volume formula are derived for the convex hull of the graph of a monomial on a nonnegative box with at most one positive lower bound.
-
Voronoi-Elitism Genetic Algorithm: A Generic Derivative-Free Routine With Theory and Implementation for Statistical Optimization
VEGA is a derivative-free genetic algorithm that constructs Voronoi neighborhoods around retained elite candidates to balance exploitation and exploration in high-dimensional statistical optimization.
-
Proxy-Based Approximation of Shapley and Banzhaf Interactions
ProxySHAP approximates higher-order Shapley and Banzhaf interactions via tree proxies plus residual correction and a polynomial-time interventional TreeSHAP generalization for tree ensembles.
-
On gapped repeats in a cyclic Fibonacci word
Characterization and enumeration of gapped repeats in the cyclic Fibonacci word.
-
Conflict-Aware Seat Assignment in Classroom Environments
Introduces SSAP and reports that an Iterated Local Search heuristic outperforms a commercial solver on complex classroom instances with many conflicts.
-
Signed Total Roman Domination and Domatic Numbers: Degree Three and Complete Multipartite Graphs
Relates signed total Roman domination number on cubic graphs to open packing, 2-tuple total domination, and signed total domination numbers to derive bounds and NP-completeness; shows domatic number determined by degree-3 vertices; computes exact values on complete multipartite graphs.