Search results for "upper"
showing 10 items of 987 documents
Interactive Method NIMBUS for Nondifferentiable Multiobjective Optimization Problems
1997
An interactive method, NIMBUS, for nondifferentiable multiobjective optimization problems is introduced. The method is capable of handling several nonconvex locally Lipschitzian objective functions subject to nonlinear (possibly nondifferentiable) constraints. The idea of NIMBUS is that the decision maker can easily indicate what kind of improvements are desired and what kind of impairments are tolerable at the point considered. The decision maker is asked to classify the objective functions into five different classes: those to be improved, those to be improved down to some aspiration level, those to be accepted as they are, those to be impaired till some upper bound, and those allowed to …
Cut-First Branch-and-Price-Second for the Capacitated Arc-Routing Problem
2012
This paper presents the first full-fledged branch-and-price (bap) algorithm for the capacitated arc-routing problem (CARP). Prior exact solution techniques either rely on cutting planes or the transformation of the CARP into a node-routing problem. The drawbacks are either models with inherent symmetry, dense underlying networks, or a formulation where edge flows in a potential solution do not allow the reconstruction of unique CARP tours. The proposed algorithm circumvents all these drawbacks by taking the beneficial ingredients from existing CARP methods and combining them in a new way. The first step is the solution of the one-index formulation of the CARP in order to produce strong cut…
Upper and lower bounds for the vehicle-routing problem with private fleet and common carrier
2019
Abstract The vehicle-routing problem with private fleet and common carrier (VRPPC) extends the capacitated VRP by considering the option of outsourcing customers to subcontractors at a customer-dependent cost instead of serving them with the private fleet. The VRPPC has important applications in small package shipping and manufacturing, but despite its relevance, no exact solution approach has been introduced so far. We propose a branch-price-and-cut algorithm that is able to solve small to medium-sized instances and provides tight lower bounds for larger instances from the literature. In addition, we develop a large neighborhood search that shows a decent solution quality and competitive r…
Higher integrability and stability of (p,q)-quasiminimizers
2023
Using purely variational methods, we prove local and global higher integrability results for upper gradients of quasiminimizers of a $(p,q)$-Dirichlet integral with fixed boundary data, assuming it belongs to a slightly better Newtonian space. We also obtain a stability property with respect to the varying exponents $p$ and $q$. The setting is a doubling metric measure space supporting a Poincar\'e inequality.
The geometry of canal surfaces and the length of curves in de Sitter space
2011
Abstract We find the minimal value of the length in de Sitter space of closed space-like curves with non-vanishing non-space-like geodesic curvature vector. These curves are in correspondence with closed almost-regular canal surfaces, and their length is a natural magnitude in conformal geometry. As an application, we get a lower bound for the total conformal torsion of closed space curves.
Reilly's type inequality for the Laplacian associated to a density related with shrinkers for MCF
2015
Let $(\bar{M},,e^\psi)$ be a Riemannian manifold with a density, and let $M$ be a closed $n$-dimensional submanifold of $\bar{M}$ with the induced metric and density. We give an upper bound on the first eigenvalue $\lambda_1$ of the closed eigenvalue problem for $\Delta_\psi$ (the Laplacian on $M$ associated to the density) in terms of the average of the norm of the vector ${\vec{H}}_{{\psi}} + {\bar \nabla}$ with respect to the volume form induced by the density, where ${\vec{H}}_{{\psi}}$ is the mean curvature of $M$ associated to the density $e^\psi$. When $\bar{M}=\Bbb R^{n+k}$ or $\bar{M}=S^{n+k-1}$, the equality between $\lambda_1$ and its bound implies that $e^\psi$ is a Gaussian den…
Slopes of Kantorovich potentials and existence of optimal transport maps in metric measure spaces
2014
We study optimal transportation with the quadratic cost function in geodesic metric spaces satisfying suitable non-branching assumptions. We introduce and study the notions of slope along curves and along geodesics and we apply the latter to prove suitable generalizations of Brenier's theorem of existence of optimal maps.
Tensorization of quasi-Hilbertian Sobolev spaces
2022
The tensorization problem for Sobolev spaces asks for a characterization of how the Sobolev space on a product metric measure space $X\times Y$ can be determined from its factors. We show that two natural descriptions of the Sobolev space from the literature coincide, $W^{1,2}(X\times Y)=J^{1,2}(X,Y)$, thus settling the tensorization problem for Sobolev spaces in the case $p=2$, when $X$ and $Y$ are infinitesimally quasi-Hilbertian, i.e. the Sobolev space $W^{1,2}$ admits an equivalent renorming by a Dirichlet form. This class includes in particular metric measure spaces $X,Y$ of finite Hausdorff dimension as well as infinitesimally Hilbertian spaces. More generally for $p\in (1,\infty)$ we…
Conical upper density theorems and porosity of measures
2008
Abstract We study how measures with finite lower density are distributed around ( n − m ) -planes in small balls in R n . We also discuss relations between conical upper density theorems and porosity. Our results may be applied to a large collection of Hausdorff and packing type measures.
A matheuristic for the Team Orienteering Arc Routing Problem
2015
In the Team OrienteeringArc Routing Problem (TOARP) the potential customers are located on the arcs of a directed graph and are to be chosen on the basis of an associated profit. A limited fleet of vehicles is available to serve the chosen customers. Each vehicle has to satisfy a maximum route duration constraint. The goal is to maximize the profit of the served customers. We propose a matheuristic for the TOARP and test it on a set of benchmark instances for which the optimal solution or an upper bound is known. The matheuristic finds the optimal solutions on all, except one, instances of one of the four classes of tested instances (with up to 27 vertices and 296 arcs). The average error o…