Related papers: An ode to Phipps' jeep convoys
In this survey we consider the classical overdetermined problem which was studied by Serrin in 1971. The original proof relies on Alexandrov's moving plane method, maximum principles, and a refinement of Hopf's boundary point Lemma. Since…
We solve a difficult problem involving velocity and acceleration components along oblique axes, and propose two problems of central force motion to be solved using oblique axes.
We construct automorphisms of $\C^n$ which map certain discrete sequences one onto another with prescribed finite jet at each point, thus solving a general Mittag-Leffler interpolation problem for automorphisms. Under certain circumstances,…
In order to keep a green planet, in particular its important to limiting the pollution with gas emissions. In a specific capacitated fixed-charge transportation problem with fixed capacities for distribution centers and customers with…
The problem of optimal mass transport arises in numerous applications including image registration, mesh generation, reflector design, and astrophysics. One approach to solving this problem is via the Monge-Amp\`ere equation. While recent…
We study a variant of the Riemann-Hilbert problem on the complements of hyperplane arrangements. This problem asks whether a given local system on the complement can be realized as the solution sheaf of a logarithmic Pfaffian system with…
The convex rope problem is to find a counterclockwise or clockwise convex rope starting at the vertex a and ending at the vertex b of a simple polygon P, where a is a vertex of the convex hull of P and b is visible from infinity. The convex…
Given a graph, the shortest-path problem requires finding a sequence of edges with minimum cumulative length that connects a source vertex to a target vertex. We consider a variant of this classical problem in which the position of each…
Paper provides a method for solving the reverse Monge-Kantorovich transport problem (TP). It allows to accumulate positive decision-taking experience made by decision-taker in situations that can be presented in the form of TP. The initial…
We give short elementary expositions of combinatorial proofs of some variants of Euler's partitition problem that were first addressed analytically by George Andrews, and later combinatorially by others. Our methods, based on ideas from a…
The Capacitated Vehicle Routing Problem (CVRP) is a fundamental NP-hard problem with broad applications in logistics and transportation. Real-world CVRPs often involve diverse objectives and complex constraints, such as time windows or…
The complementarity knapsack problem (CKP) is a knapsack problem with real-valued variables and complementarity conditions between pairs of its variables. We extend the polyhedral studies of De Farias et al. for CKP, by proposing three new…
The abstract first order Cauchy problem is solved in terms of Taylor's series leading to a series of operators which is a propagator. It is found that higher order Cauchy problems can be solved in the same way. Since derivatives of order…
In 1960, G. B. Robison discovered the general equations relating roads and wheels, where either can have an unusual shape (e.g., the square wheel rolls smoothly on a catenary). But he used some inobvious assumptions regarding the meaning of…
A central conjecture in inverse Galois theory, proposed by D\`{e}bes and Deschamps, asserts that every finite split embedding problem over an arbitrary field can be regularly solved. We give an unconditional proof of a consequence of this…
The Dial-a-Ride Problem (DARP) is an optimization problem that involves determining optimal routes and schedules for several vehicles to pick up and deliver items at minimum cost. Motivated by real-world carpooling and crowdshipping…
This paper is concerned with solution algorithms for general convex vector optimization problems (CVOPs). So far, solution concepts and approximation algorithms for solving CVOPs exist only for bounded problems [Ararat et al. 2022, Doerfler…
A convex duality result for martingale optimal transport problems with two marginals was established in Beiglb\"ock et al. (2013). In this paper we provide a generalization of this result to the multi-period setting.
In this paper we introduce a new class of finite element discretizations of the quadratic optimal transport problem based on its dynamical formulation. These generalize to the finite element setting the finite difference scheme proposed by…
The main result establishes the existence of a solution in a generalized sense for a nonlinear Dirichlet problem driven by a competing operator and exhibiting a convection term composed with an intrinsic operator. A finite dimensional…