Bin Packing via Discrepancy of Permutations

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.

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 ...

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 ...

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 ...

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 ...

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 ...

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 ...

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 ...

Bin Packing via Discrepancy of Permutations

Chat with Graph Search

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

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

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

New Graph Algorithms via Polyhedral Techniques

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

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

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