Concept
Dual d'un polyèdre
Publications associées (33)
Perturbed Utility Stochastic Traffic Assignment
This paper develops a fast algorithm for computing the equilibrium assignment with the perturbed utility route choice (PURC) model. Without compromise, this allows the significant advantages of the PURC model to be used in large-scale applications. We form ...
Informs2024Grand canonical Brownian dynamics simulations of adsorption and self-assembly of SAS-6 rings on a surface
Pierre Gönczy, Niccolo Banterle
The Spindle Assembly Abnormal Protein 6 (SAS-6) forms dimers, which then self-assemble into rings that are critical for the nine-fold symmetry of the centriole organelle. It has recently been shown experimentally that the self-assembly of SAS-6 rings is st ...
AIP Publishing2023Robust numerical integration on curved polyhedra based on folded decompositions
Annalisa Buffa, Pablo Antolin Sanchez, Xiaodong Wei
We present a novel method to perform numerical integration over curved polyhedra enclosed by high-order parametric surfaces. Such a polyhedron is first decomposed into a set of triangular and/or rectangular pyramids, whose certain faces correspond to the g ...
ELSEVIER SCIENCE SA2022Preserving Self-Duality During Logic Synthesis for Emerging Reconfigurable Nanotechnologies
Giovanni De Micheli, Heinz Riener, Shubham Rai, Akash Kumar
Emerging reconfigurable nanotechnologies allow the implementation of self-dual functions with a fewer number of transistors as compared to traditional CMOS technologies. To achieve better area results for Reconfigurable Field-Effect Transistors (RFET)-base ...
2021Complexity of linear relaxations in integer programming
For a set X of integer points in a polyhedron, the smallest number of facets of any polyhedron whose set of integer points coincides with X is called the relaxation complexity rc(X). This parameter was introduced by Kaibel & Weltge (2015) and captures the ...
2020New Results in Integer and Lattice Programming
An integer program (IP) is a problem of the form , where , , , and is a separable convex objective function.
The problem o ...
EPFL2020A Fast Gradient Method for Nonnegative Sparse Regression With Self-Dictionary
A nonnegative matrix factorization (NMF) can be computed efficiently under the separability assumption, which asserts that all the columns of the given input data matrix belong to the cone generated by a (small) subset of them. The provably most robust met ...
Ieee-Inst Electrical Electronics Engineers Inc2018On some problems related to 2-level polytopes
In this thesis we investigate a number of problems related to 2-level polytopes, in particular from the point of view of the combinatorial structure and the extension complexity. 2-level polytopes were introduced as a generalization of stable set polytopes ...
EPFL2018