Concept

Cutting stock problem

Publications associées (143)

A Benders decomposition for maximum simulated likelihood estimation of advanced discrete choice models

In this paper, we formulate a mixed integer linear program (MILP) for the simulated maximum likelihood estimation (MLSE) problem and devise a Benders decomposition approach to speed up the solution process. This framework can be applied to any advanced dis ...

2022

A Benders decomposition for maximum simulated likelihood estimation of advanced discrete choice models

Michel Bierlaire, Claudia Bongiovanni

2022

Tight Vector Bin Packing with Few Small Items via Fast Exact Matching in Multigraphs

Adam Teodor Polak, Alexandra Anna Lassota

We solve the Bin Packing problem in O^*(2^k) time, where k is the number of items less or equal to one third of the bin capacity. This parameter measures the distance from the polynomially solvable case of only large (i.e., greater than one third) items. O ...

Schloss Dagstuhl – Leibniz-Zentrum fur Informatik2022

Block-Sparse Adversarial Attack To Fool Transformer-Based Text Classifiers

Pascal Frossard, Seyedeh Sahar Sadrizadeh

Recently, it has been shown that, in spite of the significant performance of deep neural networks in different fields, those are vulnerable to adversarial examples. In this paper, we propose a gradient-based adversarial attack against transformer-based tex ...

IEEE2022

Expansion planning of active distribution networks achieving their dispatchability via energy storage systems

Mario Paolone, Ji Hyun Yi, Katarina Knezovic

This paper presents a combined framework for power distribution network expansion planning (DNEP) and energy storage systems (ESSs) allocation in active distribution networks (ADNs) hosting large amount of photovoltaic (PV) generations and loads. The propo ...

2022

Multi-robot task allocation for safe planning against stochastic hazard dynamics

Maryam Kamgarpour, Orcun Karaca

This paper considers the problem of multi-robot safe mission planning in uncertain dynamic environments. This problem arises in several applications including safety-critical exploration, surveillance, and emergency rescue missions. Computation of a multi- ...

2021

A method for faster application of process integration techniques in retrofit situations

Numerous process integration techniques were proved to be highly effective for identifying and estimating potential energy savings in the industry. However, they require high time and effort to collect and analyse process data. As a result, they do not con ...

ELSEVIER SCI LTD2021

Robust Learning-Augmented Caching: An Experimental Study

Adam Teodor Polak

Effective caching is crucial for performance of modern-day computing systems. A key optimization problem arising in caching – which item to evict to make room for a new item – cannot be optimally solved without knowing the future. There are many classical ...

PMLR2021

Knapsack and Subset Sum with Small Items

Adam Teodor Polak, Lars Rohwedder

Knapsack and Subset Sum are fundamental NP-hard problems in combinatorial optimization. Recently there has been a growing interest in understanding the best possible pseudopolynomial running times for these problems with respect to various parameters. In t ...

Schloss Dagstuhl -- Leibniz-Zentrum für Informatik2021

Enhanced Dissipation in the Navier-Stokes Equations Near the Poiseuille Flow

Klaus Martin Widmayer

We consider solutions to the 2d Navier-Stokes equations on T x R close to the Poiseuille flow, with small viscosity nu > 0. Our first result concerns a semigroup estimate for the linearized problem. Here we show that the x-dependent modes of linear solutio ...

SPRINGER2020

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search