Publications associées à Vectors in a box

A ride time-oriented scheduling algorithm for dial-a-ride problems

Nikolaos Geroliminis, Claudia Bongiovanni, Mor Kaspi

This paper offers a new algorithm to efficiently optimize scheduling decisions for dial-a-ride problems (DARPs), including problem variants considering electric and autonomous vehicles (e-ADARPs). The scheduling heuristic, based on linear programming theor ...

Pergamon-Elsevier Science Ltd2024

Learning to Remove Cuts in Integer Linear Programming

Volkan Cevher, Grigorios Chrysos, Efstratios Panteleimon Skoulakis

Cutting plane methods are a fundamental approach for solving integer linear programs (ILPs). In each iteration of such methods, additional linear constraints (cuts) are introduced to the constraint set with the aim of excluding the previous fractional opti ...

2024

Six-dimensional sphere packing and linear programming

Maryna Viazovska, Maria Margarethe Dostert, Matthew De Courcy-Ireland

We prove that the Cohn-Elkies linear programming bound for sphere packing is not sharp in dimension 6. The proof uses duality and optimization over a space of modular forms, generalizing a construction of Cohn- Triantafillou [Math. Comp. 91 (2021), pp. 491 ...

Amer Mathematical Soc2024

HYPERBOLA METHOD ON TORIC VARIETIES

Marta Pieropan

We develop a very general version of the hyperbola method which extends the known method by Blomer and Brudern for products of projective spaces to complete smooth split toric varieties. We use it to count Campana points of bounded log-anticanonical height ...

Ecole Polytechnique2024

Quantifying the Unknown: Data-Driven Approaches and Applications in Energy Systems

Paul Scharnhorst

In light of the challenges posed by climate change and the goals of the Paris Agreement, electricity generation is shifting to a more renewable and decentralized pattern, while the operation of systems like buildings is increasingly electrified. This calls ...

EPFL2024

Improving SAM Requires Rethinking its Optimization Formulation

Volkan Cevher, Fabian Ricardo Latorre Gomez, Thomas Michaelsen Pethick, Kimon Antonakopoulos, Wanyun Xie

This paper rethinks Sharpness-Aware Minimization (SAM), which is originally formulated as a zero-sum game where the weights of a network and a bounded perturbation try to minimize/maximize, respectively, the same differentiable loss. We argue that SAM shou ...

2024

Results on Sparse Integer Programming and Geometric Independent Sets

Jana Tabea Cslovjecsek

An integer linear program is a problem of the form max{c^T x : Ax=b, x >= 0, x integer}, where A is in Z^(n x m), b in Z^m, and c in Z^n. Solving an integer linear program is NP-hard in general, but there are several assumptions for which it becomes fixed ...

EPFL2023

A Spatial Branch and Bound Algorithm for Continuous Pricing with Advanced Discrete Choice Demand Modeling

Michel Bierlaire

In this paper, we present a spatial branch and bound algorithm to tackle the continuous pricing problem, where demand is captured by an advanced discrete choice model (DCM). Advanced DCMs, like mixed logit or latent class models, are capable of modeling de ...

2023

Augmented Lagrangian Methods for Provable and Scalable Machine Learning

Mehmet Fatih Sahin

Non-convex constrained optimization problems have become a powerful framework for modeling a wide range of machine learning problems, with applications in k-means clustering, large- scale semidefinite programs (SDPs), and various other tasks. As the perfor ...

EPFL2023

Nonlocally-resonant metamaterials

Aleksi Antoine Bossart

In this thesis, we unveil a third design path to manipulate elastic waves within architected media, distinct from the traditional phononic crystal and locally-resonant metamaterial concepts. The core innovation lies in the concept of nonlocal resonances, d ...

EPFL2023

Approximation Algorithms for Allocation and Network Design

Etienne Michel François Bamas

In this thesis, we give new approximation algorithms for some NP-hard problems arising in resource allocation and network design. As a resource allocation problem, we study the Santa Claus problem (also known as the MaxMin Fair Allocation problem) in which ...

EPFL2023

Data-Driven Control and Optimization under Noisy and Uncertain Conditions

Baiwei Guo

Control systems operating in real-world environments often face disturbances arising from measurement noise and model mismatch. These factors can significantly impact the perfor- mance and safety of the system. In this thesis, we aim to leverage data to de ...

EPFL2023

Bootstrapping traceless symmetric O(N) scalars

Alessandro Vichi, Maria Refinetti, Marten Jan Reehorst

We use numerical bootstrap techniques to study correlation functions of traceless sym-metric tensors of O(N) with two indices ti j. We obtain upper bounds on operator dimen-sions for all the relevant representations and several values of N. We discover sev ...

SCIPOST FOUNDATION2023

GRAMM: Fast CGRA Application Mapping Based on A Heuristic for Finding Graph Minors

Mirjana Stojilovic, Guanglei Zhou

A graph H is a minor of a second graph G if G can be transformed into H by two operations: 1) deleting nodes and/or edges, or 2) contracting edges. Coarse-grained reconfigurable array (CGRA) application mapping is closely related to the graph minor problem ...

Los Alamitos2023

Worst-Case Delay Analysis of Time-Sensitive Networks with Network Calculus

Seyed Mohammadhossein Tabatabaee

Time-sensitive networks, as in the context of IEEE Time-Sensitive Networking (TSN) and IETF Deterministic Networking (DetNet), offer deterministic services with guaranteed bounded latency in order to support safety-critical applications. In this thesis, we ...

EPFL2023

Interactive-time Exploration, Querying, and Analysis of Large High-dimensional Datasets

Sachin Basil John

In the current era of big data, aggregation queries on high-dimensional datasets are frequently utilized to uncover hidden patterns, trends, and correlations critical for effective business decision-making. Data cubes facilitate such queries by employing p ...

EPFL2023

Reliable uncertainties: Error correlation, rotated error bars, and linear regressions in three-isotope plots and beyond

Reto Georg Trappitsch

Correlated errors of experimental data are a common but often neglected problem in physical sciences. Various tools are provided here for thorough propagation of uncertainties in cases of correlated errors. Discussed are techniques especially applicable to ...

ELSEVIER2023

Functional estimation of anisotropic covariance and autocovariance operators on the sphere

Victor Panaretos, Julien René Pierre Fageot, Matthieu Martin Jean-André Simeoni, Alessia Caponera

We propose nonparametric estimators for the second-order central moments of possibly anisotropic spherical random fields, within a functional data analysis context. We consider a measurement framework where each random field among an identically distribute ...

2022

Wind farm layout and unconstrained hub height optimization using genetic algorithms applied to different power densities

Fernando Porté Agel, Nicolas Otto Kirchner Bossi

LES and wind tunnel studies have shown significant benefit when allowing turbines (T) in a wind farm to adopt different heights. This work presents two new genetic algorithms (GA) that perform wind farm layout optimization (WFLO) involving continuous and t ...

2022

The Jordan property for local fundamental groups

Roberto Svaldi, Stefano Filipazzi

We show the Jordan property for regional fundamental groups of klt singularities of fixed dimension. Furthermore, we prove the existence of effective simultaneous index 1 covers for n-dimensional klt singularities. We give an application to the study of lo ...

2022