相关论文: Combinatorial settlement planning
When electron correlations are important it is often necessary to use numerical methods to solve the Hamiltonian for a finite system (cluster) "exactly". Unfortunately, such methods are restricted to small systems. We propose to combine the…
Recent research has proposed neural architectures for solving combinatorial problems in structured output spaces. In many such problems, there may exist multiple solutions for a given input, e.g. a partially filled Sudoku puzzle may have…
We consider the shape optimization problem which consists in placing a given mass $m$ of elastic material in a design region so that the compliance is minimal. Having in mind optimal light structures, our purpose is to show that the problem…
Decision trees have been a very popular class of predictive models for decades due to their interpretability and good performance on categorical features. However, they are not always robust and tend to overfit the data. Additionally, if…
A preferential arrangement of a set is a total ordering of the elements of that set with ties allowed. A barred preferential arrangement is one in which the tied blocks of elements are ordered not only amongst themselves but also with…
In this paper, a flexibility-oriented microgrid optimal scheduling model is proposed to mitigate distribution network net load variability caused by large penetration distributed solar generation. The distributed solar generation…
Recall that Janson showed that if the edges of the complete graph $K_n$ are assigned exponentially distributed independent random weights, then the expected length of a shortest path between a fixed pair of vertices is asymptotically equal…
This paper proposes a coordinated optimal scheduling model for hybrid AC/DC microgrids. The objective of the proposed model is to minimize the total microgrid operation cost when considering interactions between AC and DC sub-systems of the…
We consider the problem of minimizing the size of a family of sets G such that every subset of 1,...,n can be written as a disjoint union of at most k members of G, where k and n are given numbers. This problem originates in a real-world…
We study a discrete version of a geometric stable marriage problem originally proposed in a continuous setting by Hoffman, Holroyd, and Peres, in which points in the plane are stably matched to cluster centers, as prioritized by their…
We consider the classical problem of making mobile processes gather or converge at a same position (as performed by swarms of animals in Nature). Existing works assume that each process can see all other processes, or all processes within a…
We produce combinatorial models for configuration space in a simplicial complex, and for configurations near a single point ("local configuration space.") The model for local configuration space is built out of the poset of poset structures…
In an isolated power grid or a micro-grid with a small carbon footprint, the penetration of renewable energy is usually high. In such power grids, energy storage is important to guarantee an uninterrupted and stable power supply for end…
A substantial share of the Earth's land surface is managed by humans, with cities representing the most extreme form of anthropogenic land use. There are zillion ways in which settlements can be arranged across a given area, and their…
The problem that we consider is the following: given an $n \times n$ array $A$ of positive numbers, find a tiling using at most $p$ rectangles (which means that each array element must be covered by some rectangle and no two rectangles must…
Let $\mathcal{A}_1,\ldots,\mathcal{A}_m$ be families of $k$-subsets of an $n$-set. Suppose that one cannot choose pairwise disjoint edges from $s+1$ distinct families. Subject to this condition we investigate the maximum of…
This article describes a model and an exact solution method for facility location problems with decision-dependent uncertainties. The model allows characterizing the probability distribution of the random elements as a function of the…
The Minimum Spanning Tree with Conflicting Edge Pairs is a generalization that adds conflict constraints to a classical optimization problem on graphs used to model several real-world applications. In the last few years several approaches,…
The energy sector has become priority around the world with developing technology and increasing power and energy demand. That all sources for energy production are not renewable increases greenhouse gas emissions and causes global warming.…
For multiparametric mixed-integer convex programming problems such as those encountered in hybrid model predictive control, we propose an algorithm for generating a feasible partition of a subset of the parameter space. The result is a…