Paris Dauphine University

About: Paris Dauphine University is a education organization based out in Paris, France. It is known for research contribution in the topics: Population & Approximation algorithm. The organization has 1766 authors who have published 6909 publications receiving 162747 citations. The organization is also known as: Paris Dauphine & Dauphine.

Improved rolling horizon approaches to the aircraft sequencing problem

Abstract: In a scenario characterized by a continuous growth of air transportation demand, the runways of large airports serve hundreds of aircraft every day. Aircraft sequencing is a challenging problem that aims to increase runway capacity in order to reduce delays as well as the workload of air traffic controllers. In many cases, the air traffic controllers solve the problem using the simple "first-come-first-serve" (FCFS) rule. In this paper, we present a rolling horizon approach which partitions a sequence of aircraft into chunks and solves the aircraft sequencing problem (ASP) individually for each of these chunks. Some rules for deciding how to partition a given aircraft sequence are proposed and their effects on solution quality investigated. Moreover, two mixed integer linear programming models for the ASP are reviewed in order to formalize the problem, and a tabu search heuristic is proposed for finding solutions to the ASP in a short computation time. Finally, we develop an IRHA which, using different chunking rules, is able to find solutions significantly improving on the FCFS rule for real-world air traffic instances from Milano Linate Airport.

Multiagent resource allocation in k -additive domains: preference representation and complexity

Abstract: We study a framework for multiagent resource allocation where autonomous software agents negotiate over the allocation of bundles of indivisible resources. Connections to well-known combinatorial optimisation problems, including the winner determination problem in combinatorial auctions, shed light on the computational complexity of the framework. We give particular consideration to scenarios where the preferences of agents are modelled in terms of k-additive utility functions, i.e. scenarios where synergies between different resources are restricted to bundles of at most k items.

Fast diffusion flow on manifolds of nonpositive curvature

Abstract: We consider the fast diffusion equation (FDE) ut = Δum (0 0. In that case solutions vanish in finite time, and we estimate from below and from above the extinction time.

On the Pettis Integral of Closed Valued Multifunctions

Abstract: In this work, the study of Pettis integrability for multifunctions (alias set-valued maps), whose values are allowed to be unbounded, is initiated For this purpose, two notions of Pettis integrability, and of Pettis integral, are considered and compared The first notion is similar to that of the weak integral, already known for vector-valued functions, and is defined via support functions The second notion resembles the classical Aumann definition using integrable selections, but it involves the Pettis integrable selections rather than the Bochner integrable ones The above two integrals are shown to coincide in a quite general setting Several criteria for a multifunction to be Pettis integrable (in one sense or the other) are proved On the other hand, due to the possibility of infinite values for the support functions, we are led to introduce a more general notion of scalar integrability involving the negative part of these functions We compare the scalar integrability of a multifunction with that of its measurable selections We also provide some new results concerning multifunctions with bounded values and/or new proofs of already existing ones Examples are included to illustrate the results and to introduce open problems