Zobrazeno 1 - 10
of 126
pro vyhledávání: '"Hicks, Illya V."'
Autor:
Alston, Brandon, Hicks, Illya V.
Multivariate decision trees are powerful machine learning tools for classification and regression that attract many researchers and industry professionals. An optimal binary tree has two types of vertices, (i) branching vertices which have exactly tw
Externí odkaz:
http://arxiv.org/abs/2408.01297
Publikováno v:
2023 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), 2023, pp. 267-273
We present a new approach for modeling avoidance constraints in 2D environments, in which waypoints are assigned to obstacle-free polyhedral regions. Constraints of this form are often formulated as mixed-integer programming (MIP) problems employing
Externí odkaz:
http://arxiv.org/abs/2312.02016
A tight continuous relaxation is a crucial factor in solving mixed integer formulations of many NP-hard combinatorial optimization problems. The (weighted) max $k$-cut problem is a fundamental combinatorial optimization problem with multiple notoriou
Externí odkaz:
http://arxiv.org/abs/2308.01361
We study mixed-integer programming formulations for the piecewise linear lower and upper bounds (in other words, piecewise linear relaxations) of nonlinear functions that can be modeled by a new class of combinatorial disjunctive constraints (CDCs),
Externí odkaz:
http://arxiv.org/abs/2304.14542
Autor:
Lyu, Bochuan, Hicks, Illya V.
The biclique cover number $(\text{bc})$ of a graph $G$ denotes the minimum number of complete bipartite (biclique) subgraphs to cover all the edges of the graph. In this paper, we show that $\text{bc}(G) \geq \lceil \log_2(\text{mc}(G^c)) \rceil \geq
Externí odkaz:
http://arxiv.org/abs/2302.12775
Decision trees are powerful tools for classification and regression that attract many researchers working in the burgeoning area of machine learning. One advantage of decision trees over other methods is their interpretability, which is often preferr
Externí odkaz:
http://arxiv.org/abs/2206.04857
We introduce techniques to build small ideal mixed-integer programming (MIP) formulations of combinatorial disjunctive constraints (CDCs) via the independent branching scheme. We present a novel pairwise IB-representable class of CDCs, CDCs admitting
Externí odkaz:
http://arxiv.org/abs/2205.06916
Autor:
Lyu, Bochuan, Hicks, Illya V.
The biclique partition number $(\text{bp})$ of a graph $G$ is referred to as the least number of complete bipartite (biclique) subgraphs that are required to cover the edges of the graph exactly once. In this paper, we show that the biclique partitio
Externí odkaz:
http://arxiv.org/abs/2203.02837
Autor:
Smith, Logan A., Hicks, Illya V.
To monitor electrical activity throughout the power grid and mitigate outages, sensors known as phasor measurement units can installed. Due to implementation costs, it is desirable to minimize the number of sensors deployed while ensuring that the gr
Externí odkaz:
http://arxiv.org/abs/2006.03460
We present an integer programming model to compute the strong rainbow connection number, $src(G)$, of any simple graph $G$. We introduce several enhancements to the proposed model, including a fast heuristic, and a variable elimination scheme. Moreov
Externí odkaz:
http://arxiv.org/abs/2006.02988