Search results for "ustice"
showing 10 items of 1381 documents
A Cross-Cultural Comparison of Business Complaint Management Expectations
2015
This study explores the complaint management expectations of 72 British and 74 German organizational buyers using automated online means-end laddering and a Hierarchical Value Map presentation. It conceptualizes the links between expected complaint resolution attributes by the buyer (i.e. means) and the buyerâs value perceptions (i.e. ends). Unlike previous research, we highlight similarities and differences in the drivers behind and attributes of complaint management expectations across two countries (Germany and the UK). Even in countries appearing to be similar economically and culturally, we find differences in the desired attributes. British buyers, for example, emphasize softer comp…
A multi-parametric evolution strategies algorithm for vehicle routing problems
2007
Vehicle routing problems are at the heart of most decision support systems for real-life distribution problems. In vehicle routing problem a set of routes must be determined at lowest total cost for a number of resources (i.e. fleet of vehicles) located at one or several points (e.g. depots, warehouses) in order to efficiently service a number of demand or supply points. In this paper an efficient evolution strategies algorithm is developed for both capacitated vehicle routing problem and for vehicle routing problem with time window constraints. The algorithm is based on a new multi-parametric mutation procedure that is applied within the 1 + 1 evolution strategies algorithm. Computational …
Modelling agricultural risk in a large scale positive mathematical programming model
2020
International audience; Mathematical programming has been extensively used to account for risk in farmers' decision making. The recent development of the positive mathematical programming (PMP) has renewed the need to incorporate risk in a more robust and flexible way. Most of the existing PMP-risk models have been tested at farm-type level and for a very limited sample of farms. This paper presents and tests a novel methodology for modelling risk at individual farm level in a large scale model, called individual farm model for common agricultural policy analysis (IFM-CAP). Results show a clear trade-off between including and excluding the risk specification. Albeit both alternatives provid…
A homography formulation to the 3pt plus a common direction relative pose problem
2014
International audience; In this paper we present an alternative formulation for the minimal solution to the 3pt plus a common direction relative pose prob-lem. Instead of the commonly used epipolar constraint we use the homog-raphy constraint to derive a novel formulation for the 3pt problem. This formulation allows the computation of the normal vector of the plane defined by the three input points without any additional computation in addition to the standard motion parameters of the camera. We show the working of the method on synthetic and real data sets and compare it to the standard 3pt method and the 5pt method for relative pose estima-tion. In addition we analyze the degenerate condi…
A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows
2010
In this paper, we present an effective memetic algorithm for the vehicle routing problem with time windows (VRPTW). The paper builds upon an existing edge assembly crossover (EAX) developed for the capacitated VRP. The adjustments of the EAX operator and the introduction of a novel penalty function to eliminate violations of the time window constraint as well as the capacity constraint from offspring solutions generated by the EAX operator have proven essential to the heuristic's performance. Experimental results on Solomon's and Gehring and Homberger benchmarks demonstrate that our algorithm outperforms previous approaches and is able to improve 184 best-known solutions out of 356 instance…
Using the witness method to detect rigid subsystems of geometric constraints in CAD
2010
International audience; This paper deals with the resolution of geometric constraint systems encountered in CAD-CAM. The main results are that the witness method can be used to detect that a constraint system is over-constrained and that the computation of the maximal rigid subsystems of a system leads to a powerful decomposition method. In a first step, we recall the theoretical framework of the witness method in geometric constraint solving and extend this method to generate a witness. We show then that it can be used to incrementally detect over-constrainedness. We give an algorithm to efficiently identify all maximal rigid parts of a geometric constraint system. We introduce the algorit…
Conformal equivalence of visual metrics in pseudoconvex domains
2017
We refine estimates introduced by Balogh and Bonk, to show that the boundary extensions of isometries between smooth strongly pseudoconvex domains in $\C^n$ are conformal with respect to the sub-Riemannian metric induced by the Levi form. As a corollary we obtain an alternative proof of a result of Fefferman on smooth extensions of biholomorphic mappings between pseudoconvex domains. The proofs are inspired by Mostow's proof of his rigidity theorem and are based on the asymptotic hyperbolic character of the Kobayashi or Bergman metrics and on the Bonk-Schramm hyperbolic fillings.
Optimal maps and exponentiation on finite dimensional spaces with Ricci curvature bounded from below
2013
We prove existence and uniqueness of optimal maps on $RCD^*(K,N)$ spaces under the assumption that the starting measure is absolutely continuous. We also discuss how this result naturally leads to the notion of exponentiation.
Geodesic X-ray tomography for piecewise constant functions on nontrapping manifolds
2017
We show that on a two-dimensional compact nontrapping manifold with strictly convex boundary, a piecewise constant function is determined by its integrals over geodesics. In higher dimensions, we obtain a similar result if the manifold satisfies a foliation condition. These theorems are based on iterating a local uniqueness result. Our proofs are elementary.
Approximation by mappings with singular Hessian minors
2018
Let $\Omega\subset\mathbb R^n$ be a Lipschitz domain. Given $1\leq p<k\leq n$ and any $u\in W^{2,p}(\Omega)$ belonging to the little H\"older class $c^{1,\alpha}$, we construct a sequence $u_j$ in the same space with $\operatorname{rank}D^2u_j<k$ almost everywhere such that $u_j\to u$ in $C^{1,\alpha}$ and weakly in $W^{2,p}$. This result is in strong contrast with known regularity behavior of functions in $W^{2,p}$, $p\geq k$, satisfying the same rank inequality.