Optimal allocation in multivariate sampling through Chebyshev approximation.
Optimal Location of Production Centers Interconnected Materials and Products Allocation
Penalty Method for Fuzzy Linear Programming With Trapezoidal Numbers
Pexider's equation and aggregation of allocations.
Quantitative concentration inequalities on sample path space for mean field interaction
We consider the approximation of a mean field stochastic process by a large interacting particle system. We derive non-asymptotic large deviation bounds measuring the concentration of the empirical measure of the paths of the particles around the law of the process. The method is based on a coupling argument, strong integrability estimates on the paths in Hölder norm, and a general concentration result for the empirical measure of identically distributed independent paths.
Ranking of Banks in Serbia
Remarks on the time transportation problem
Researches of the transportation problem
Sensor Location Problem for a Multigraph
MSC 2010: 05C50, 15A03, 15A06, 65K05, 90C08, 90C35We introduce sparse linear underdetermined systems with embedded network structure. Their structure is inherited from the non-homogeneous network ow programming problems with nodes of variable intensities. One of the new applications of the researched underdetermined systems is the sensor location problem (SLP) for a multigraph. That is the location of the minimum number of sensors in the nodes of the multigraph, in order to determine the arcs ow...
Sign-consistency and solvability of constrained linear systems.
Some Properties of Transportation Manifold
Sur les modèles probabilistes de prévision des localisations et des déplacements dans une agglomération
The constrained gravity model with power function as a cost function.
The determination of necessary and sufficient conditions for the existence of a solution to the multi-index problem
Modifications to a procedure for determining necessary and sufficient conditions for the existence of a solution to the multi-index problem are described. These modifications reduce the computation required to such an extent that necessary and sufficient conditions for the existence of a solution to the 3x3x3 multi-index problem can now be determined. These conditions are given in this paper.
Three Dimensional Fixed Charge Bi-Criterion Indefinite Quadratic Transportation Problem
Time Minimizing Transportation Problem with Fractional Bottleneck Objective Function
Total Time Minimizing Transportation Problem
Transportation Technique for a Particular Convex Programming Problem
Transports industriels routiers, un problème d'affectation avec réemploi sous contraintes
Tree based models and algorithms for the preemptive asymmetric Stacker Crane problem
In this paper we deal with the preemptive asymmetric stacker crane problem in a heuristic way. We first present some theoretical results which allow us to turn this problem into a specific tree design problem. We next derive from this new representation an integer linear programming model together with simple and efficient greedy and local search heuristics. We conclude by presenting experimental results which aim at both testing the efficiency of our heuristic and evaluating the impact of the...