相关论文: Combinatorial settlement planning
We propose a general framework for solving inverse self-assembly problems, i.e. designing interactions between elementary units such that they assemble spontaneously into a predetermined structure. Our approach uses patchy particles as…
Interdiction problems ask about the worst-case impact of a limited change to an underlying optimization problem. They are a natural way to measure the robustness of a system, or to identify its weakest spots. Interdiction problems have been…
In Bipartite Correlation Clustering (BCC) we are given a complete bipartite graph $G$ with `+' and `-' edges, and we seek a vertex clustering that maximizes the number of agreements: the number of all `+' edges within clusters plus all `-'…
In this technical communique we study the maximal robust positively invariant set for state-constrained continuous-time nonlinear systems subjected to a bounded disturbance. Extending results from the theory of barriers, we show that this…
In this work, we study the problem of scheduling a maximal set of transmitters subjected to an interference constraint across all the nodes. Given a set of nodes, the problem reduces to finding the maximum cardinality of a subset of nodes…
We propose a methodology, based on machine learning and optimization, for selecting a solver configuration for a given instance. First, we employ a set of solved instances and configurations in order to learn a performance function of the…
We study the problem of aggregating polygons by covering them with disjoint representative regions, thereby inducing a clustering of the polygons. Our objective is to minimize a weighted sum of the total area and the total perimeter of the…
With spectrum auctions as our prime motivation, in this paper we analyze combinatorial auctions where agents' valuations exhibit complementarities. Assuming that the agents only value bundles of size at most $k$ and also assuming that we…
We propose a novel method to fit and segment multi-structural data via convex relaxation. Unlike greedy methods --which maximise the number of inliers-- this approach efficiently searches for a soft assignment of points to models by…
In classic robust optimization, it is assumed that a set of possible parameter realizations, the uncertainty set, is modeled in a previous step and part of the input. As recent work has shown, finding the most suitable uncertainty set is in…
This paper deals with the convergence time analysis of a class of fixed-time stable systems with the aim to provide a new non-conservative upper bound for its settling time. Our contribution is fourfold. First, we revisit the well-known…
Energy and pollution are urging problems of the 21th century. By gradually changing the actual power grid system, smart grid may evolve into different systems by means of size, elements and strategies, but its fundamental requirements and…
As a type of search design, a detecting array can be used to generate test suites to identify and detect faults caused by interactions of factors in a component-based system. Recently, the construction and optimality of detecting arrays…
We consider the assortment optimization problem with disjoint-cardinality constraints under two-level nested logit model. To solve this problem, we first identify a candidate set with $O(mn^2)$ assortments and show that at least one optimal…
In geographic information systems and in the production of digital maps for small devices with restricted computational resources one often wants to round coordinates to a rougher grid. This removes unnecessary detail and reduces space…
We study the optimization version of the set partition problem (where the difference between the partition sums are minimized), which has numerous applications in decision theory literature. While the set partitioning problem is NP-hard and…
In this paper, we focus attention on extending the topological conjugacy of adding machine maps and minimal systems to iterated function systems. We provide necessary and sufficient conditions for an iterated function system to be…
In this paper, we develop an optimization-based systematic approach for the challenging, less studied, and important problem of optimal partitioning of multi-thermal zone buildings for the decentralized control. The proposed method consists…
In computational design and fabrication, neural networks are becoming important surrogates for bulky forward simulations. A long-standing, intertwined question is that of inverse design: how to compute a design that satisfies a desired…
Many random combinatorial objects have a component structure whose joint distribution is equal to that of a process of mutually independent random variables, conditioned on the value of a weighted sum of the variables. It is interesting to…