Let T = (V,E) be a tree with associated costs on its subtrees. A minmax k-partition of T is a partition into k subtrees, minimizing the maximum cost of a subtree over all possible partitions. In the centered version of the problem, the cost of a subtree cost is defined as the minimum cost of “servicing” that subtree using a center located within it. The problem motivating this work was the sink...

We consider a two-player, sequential location game, with n stages. At each stage, players 1 and 2 choose locations from a feasible set in sequence. After all moves are made, consumers each purchase one unit of the good from the closest location. Since player 1 has a natural first-mover disadvantage here (player 2 can obtain a payoff of 12 just by replicating player 1’s moves), we examine her mi...

For evolutive Hamilton-Jacobi equations, we propose a refined definition of C-variational solution, adapted to Cauchy problems for continuous initial data. In this weaker framework we investigate the Markovian (or semigroup) property for these solutions. In the case of p-convex Hamiltonians, when variational solutions are known to be identical to viscosity solutions, we verify directly the Mark...

This paper proposes a frame rate-control scheme with a MINMAX distortion criterion in the framework of a rate-distortion optimized motion compensated embedded wavelet coder. The MINMAX criterion aims to minimize the maximum distortion in a group of pictures (GOP) for a given bit rate. The proposed frame level bit allocation scheme combined with R-D optimized within frame allocation allows preci...

The purpose of this paper is to develop a fairly large number of sets of global parametric sufficient optimality conditions under various generalized (F, b, φ, ρ, θ)univexity assumptions for a continuous minmax fractional programming problem involving arbitrary norms.

We consider a multiple criterion Boolean programming problem with MINMAX partial criteria. The extreme level of independent perturbations of partial criteria parameters such that efficient (Pareto optimal) solution preserves optimality was obtained. MSC: 90C29, 90C31

In this article, we propose a computationally efficient approach to estimate (large) p-dimensional covariance matrices of ordered (or longitudinal) data based on an independent sample of size n. To do this, we construct the estimator based on a k-band partial autocorrelation matrix with the number of bands chosen using an exact multiple hypothesis testing procedure. This approach is considerabl...