Bin Packing via Discrepancy of Permutations

About
Privacy
Disclaimer

Graph Chatbot

Related publications (32)

Page 2 of 2

Efficient Allocations in Constant Time: Towards Scalable Solutions in the Era of Large Scale Intelligent Systems

Boi Faltings, Panayiotis Danassis

The next technological revolution will be interwoven to the proliferation of intelligent systems. As we bridge the gap between physical and cyber worlds, we will give rise to large-scale, multi-agent based technologies. A key challenge that cities of the f ...

IOS PRESS2020

Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma

Friedrich Eisenbrand

We consider integer programming problems in standard form max{c(T)x : Ax = b, x >= 0, x is an element of Z(n)} where A is an element of Z(mxn), b is an element of Z(m), and c is an element of Z(n). We show that such an integer program can be solved in time ...

ASSOC COMPUTING MACHINERY2020

A general framework for the integration of complex choice models into mixed integer optimization

Meritxell Pacheco Paneque

The objective of this thesis is to develop a general methodology to incorporate a disaggregate demand representation in supply-oriented optimization problems that allows to capture the interplay between the behavior of individuals and the decisions to be o ...

EPFL2020

Reliable Frequency Regulation through Vehicle-to-Grid: Encoding Legislation with Robust Constraints

Daniel Kuhn, François Richard Vuille, Dirk Lauinger

Problem definition: Vehicle-to-grid increases the low utilization rate of privately owned electric vehicles by making their batteries available to electricity grids. We formulate a robust optimization problem that maximizes a vehicle owner’s expected profi ...

2024

Fast assembly of Galerkin matrices for 3D solid laminated composites using finite element and isogeometric discretizations

Pablo Antolin Sanchez

This work presents a novel methodology for speeding up the assembly of stiffness matrices for laminate composite 3D structures in the context of isogeometric and finite element discretizations. By splitting the involved terms into their in-plane and out-of ...

2020

No Small Linear Program Approximates Vertex Cover Within a Factor 2-epsilon

Ola Nils Anders Svensson, Abbas Bazzi

The vertex cover problem is one of the most important and intensively studied combinatorial optimization problems. Khot and Regev [Khot S, Regev O (2008) Vertex cover might be hard to approximate to within 2 - epsilon. J. Comput. System Sci. 74(3): 335-349 ...

INFORMS2019

New Graph Algorithms via Polyhedral Techniques

Jakub Tarnawski

In this thesis we give new algorithms for two fundamental graph problems. We develop novel ways of using linear programming formulations, even exponential-sized ones, to extract structure from problem instances and to guide algorithms in making progress. S ...

EPFL2019

Size Matters: Cardinality-Constrained Clustering and Outlier Detection via Conic Optimization

Daniel Kuhn, Wolfram Wiesemann, Napat Rujeerapaiboon, Kilian Schindler

Plain vanilla K-means clustering is prone to produce unbalanced clusters and suffers from outlier sensitivity. To mitigate both shortcomings, we formulate a joint outlier-detection and clustering problem, which assigns a prescribed number of datapoints to ...

SIAM Publications2019

Analytical Approach for Active Distribution Network Restoration Including Optimal Voltage Regulation

Sidi-Rachid Cherkaoui, Hossein Sekhavatmanesh

The ever-increasing utilization of sensitive loads in the industrial, commercial, and residential areas in distribution networks requires enhanced reliability and quality of supply. This can be achieved, thanks to self-healing features of smart grids that ...

IEEE Institute of Electrical and Electronics Engineers2019

Linear-parameter-varying approximation of nonlinear dynamics for model predictive flow control of urban multi-region systems

Nikolaos Geroliminis, Mohammadreza Saeedmanesh, Anastasios Kouvelas

An alternative approach for real-time network- wide traffic control in cities that has recently gained a lot of interest is perimeter flow control. The focus of the current work is to study two aspects that are not covered in the perimeter control literatu ...

2019

A Fast Gradient Method for Nonnegative Sparse Regression With Self-Dictionary

Robert Gerhard Jérôme Luce

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 Inc2018

A totally unimodular view of structured sparsity

Volkan Cevher, Marwa El Halabi

This paper describes a simple framework for structured sparse recovery based on convex optimization. We show that many interesting structured sparsity models can be naturally represented by linear matrix inequalities on the support of the unknown parameter ...

2015