Results 81 to 90 of about 5,134,655 (243)
Strategic Flip‐Flopping in Political Competition
International Economic Review, EarlyView.ABSTRACT We study candidates' position adjustments in response to information about voters' preferences. Repositioning allows candidates to move closer to the median voter, but it incurs financial and electoral costs. In a subgame‐perfect equilibrium, candidates diverge from the center ex ante if the costs of adjustment are sufficiently large.
Gaëtan Fournier +2 more
wiley +1 more source
Lexicographic cones and the ordered projective tensor product
, 2018 We introduce lexicographic cones, a method of assigning an ordered vector space $\Lex(S)$ to a poset $S$, generalising the standard lexicographic cone.
A. L. Peressini +8 more
core +1 more source
Broadcast domination of lexicographic and modular products of graphs
AKCE International Journal of Graphs and Combinatorics, 2022 A dominating broadcast labeling of a graph G is a function [Formula: see text] such that [Formula: see text] for all [Formula: see text] where e(v) is the eccentricity of v, and for every vertex [Formula: see text] there exists a vertex v with [Formula ...
Jishnu Sen, Srinivasa Rao Kola
doaj +1 more source
Sequential properties of lexicographic products
Topology and its Applications, 2014 In what follows, \(X\) denotes a Tychonoff (i.e., completely regular, Hausdorff) topological space. Let \(C(X)\) be the ring of all real valued continuous functions defined on \(X\). Each \(f \in C(X)\) defines a \textit{zeroset} of the form \(Z(f) = \{x \in X: f(x) = 0\}\). The complement of a zeroset is a \textit{cozeroset}.
Azarpanah, F., Etebar, M.
openaire +1 more source
Exact solution algorithms for biobjective mixed integer programming problems
International Transactions in Operational Research, EarlyView.Abstract We consider criterion space algorithms for biobjective mixed integer programs. The algorithms solve scalarization models in order to explore predetermined regions of the objective space called boxes, defined by two nondominated points. When exploring, the algorithm exploits information on its corner points and chooses the scalarization problem
Deniz Emre, Özlem Karsu, Firdevs Ulus
wiley +1 more source
Edge-coloring of generalized lexicographic product of graphs
AIMS MathematicsAn edge-coloring of a graph $ G $ is an assignment of colors to its edges so that no two edges incident to the same vertex receive the same color. The chromatic index of $ G $, denoted by $ \chi'(G) $, is the least $ k $ for which $ G $ has a $ k $ edge ...
Shuangliang Tian, Ping Chen
doaj +1 more source
An iterated greedy‐based metaheuristic with local search for the rank pricing problem
International Transactions in Operational Research, EarlyView.Abstract The rank pricing problem involves determining optimal prices for a set of products while accounting for customers' budgets and preferences. This study develops an iterated greedy‐based metaheuristic to efficiently solve this problem. The core idea is to generate a sequence of solutions by iteratively applying destruction and reconstruction ...
Herminia I. Calvete +3 more
wiley +1 more source
Dominating sequences in grid-like and toroidal graphs [PDF]
, 2016 A longest sequence $S$ of distinct vertices of a graph $G$ such that each vertex of $S$ dominates some vertex that is not dominated by its preceding vertices, is called a Grundy dominating sequence; the length of $S$ is the Grundy domination number of $G$
Brešar, Boštjan +7 more
core +1 more source
The Distinguishing Number and Distinguishing Index of the Lexicographic Product of Two Graphs
Discussiones Mathematicae Graph Theory, 2018 The distinguishing number (index) D(G) (D′(G)) of a graph G is the least integer d such that G has a vertex labeling (edge labeling) with d labels that is preserved only by the trivial automorphism.
Alikhani Saeid, Soltani Samaneh
doaj +1 more source
On the Packing Partitioning Problem on Directed Graphs
Mathematics, 2021 This work is aimed to continue studying the packing sets of digraphs via the perspective of partitioning the vertex set of a digraph into packing sets (which can be interpreted as a type of vertex coloring of digraphs) and focused on finding the minimum ...
Babak Samadi, Ismael G. Yero
doaj +1 more source