Publication

On the n-dimensional Dirichlet problem for isometric maps

Related publications (32)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

A refined estimate for the topological degree

Hoài-Minh Nguyên

We sharpen an estimate of [4] for the topological degree of continuous maps from a sphere Sdinto itself in the case d >= 2. This provides the answer for d >= 2 to a question raised by Brezis. The problem is still open for d = 1. (C) 2017 Academie des scien ...

2017

The multi-objective railway timetable rescheduling problem

Michel Bierlaire, Mohammad Yousef Maknoon, Stefan Yves Gabriel Binder

Unexpected disruptions occur for many reasons in railway networks and cause delays, cancelations, and, eventually, passenger inconvenience. This research focuses on the railway timetable rescheduling problem from a macroscopic point of view in case of larg ...

Pergamon-Elsevier Science Ltd2017

The gene family-free median of three

Metin Balaban

Background: The gene family-free framework for comparative genomics aims at providing methods for gene order analysis that do not require prior gene family assignment, but work directly on a sequence similarity graph. We study two problems related to the b ...

2017

Optimization based methods for highly heterogeneous multiscale problems and multiscale methods for elastic waves

Multiscale or multiphysics partial differential equations are used to model a wide range of physical systems with various applications, e.g. from material and natural science to problems in biology or engineering. When the ratio between the smallest scale ...

EPFL2017

Approximation algorithms for geometric dispersion

Alfonso Bolívar Cevallos Manzano

The most basic form of the max-sum dispersion problem (MSD) is as follows: given n points in R^q and an integer k, select a set of k points such that the sum of the pairwise distances within the set is maximal. This is a prominent diversity problem, with w ...

EPFL2016

Passenger Centric Train Timetabling Problem

Michel Bierlaire, Shadi Sharif Azadeh, Mohammad Yousef Maknoon, Tomas Robenek

The aim of this paper is to analyze and to improve the current planning process of the passenger railway service in light of the recent railway market changes. In order to do so, we introduce the Passenger Centric Train Timetabling Problem. The originality ...

Pergamon-Elsevier Science Ltd2016

On the configuration LP for maximum budgeted allocation

Ola Nils Anders Svensson, Christos Kalaitzis, Lukas Polacek, Aleksander Madry

We study the maximum budgeted allocation problem, i.e., the problem of selling a set of m indivisible goods to n players, each with a separate budget, such that we maximize the collected revenue. Since the natural assignment LP is known to have an integral ...

Springer Heidelberg2015

Path-following gradient-based decomposition algorithms for separable convex optimization

Quoc Tran Dinh

A new decomposition optimization algorithm, called path-following gradient-based decomposition, is proposed to solve separable convex optimization problems. Unlike path-following Newton methods considered in the literature, this algorithm does not require ...

Springer Verlag2014

FETI-DP Domain Decomposition Method

Christoph Jäggli

FETI-DP is a dual iterative, nonoverlapping domain decomposition method. By a Schur complement procedure, the solution of a boundary value problem is reduced to solving a symmetric and positive definite dual problem in which the variables are directly rela ...

2014

Optimal expulsion and optimal confinement of a Brownian particle with a switching cost

Robert Dalang, Laura Vinckenbosch

We solve two stochastic control problems in which a player tries to minimize or maximize the exit time from an interval of a Brownian particle, by controlling its drift. The player can change from one drift to another but is subject to a switching cost. In ...

Elsevier Science Bv2014