Zobrazeno 1 - 10
of 49
pro vyhledávání: '"Sanjeeb Dash"'
Publikováno v:
Nature Communications, Vol 15, Iss 1, Pp 1-14 (2024)
Abstract The discovery of scientific formulae that parsimoniously explain natural phenomena and align with existing background theory is a key goal in science. Historically, scientists have derived natural laws by manipulating equations based on exis
Externí odkaz:
https://doaj.org/article/2d23b1f9d7e0455f91b3343f060e3fb4
Autor:
Cristina Cornelio, Sanjeeb Dash, Vernon Austel, Tyler R. Josephson, Joao Goncalves, Kenneth L. Clarkson, Nimrod Megiddo, Bachir El Khadir, Lior Horesh
Publikováno v:
Nature Communications, Vol 14, Iss 1, Pp 1-10 (2023)
Abstract Scientists aim to discover meaningful formulae that accurately describe experimental data. Mathematical models of natural phenomena can be manually created from domain knowledge and fitted to data, or, in contrast, created automatically from
Externí odkaz:
https://doaj.org/article/a071e93910ae4c9eb6c7c38c46e4bf03
Publikováno v:
Discrete Applied Mathematics. 324:67-79
Binary polynomial optimization is equivalent to the problem of minimizing a linear function over the intersection of the multilinear set with a polyhedron. Many families of valid inequalities for the multilinear set are available in the literature, t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fa315d3f6460a2112b2cca052bc76782
https://doi.org/10.1016/j.dam.2022.09.010
https://doi.org/10.1016/j.dam.2022.09.010
Publikováno v:
Mathematical Programming. 192:149-175
Many practical integer programming problems involve variables with one or two-sided bounds. Dunkel and Schulz (A refined Gomory–Chvatal closure for polytopes in the unit cube, http://www.optimization-online.org/DB_FILE/2012/03/3404.pdf , 2012) cons
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::77641d2e448887e5f6dea4e6ddafb767
https://doi.org/10.1007/s10107-021-01697-0
https://doi.org/10.1007/s10107-021-01697-0
Autor:
Yatharth Dubey, Sanjeeb Dash
In this paper we study the rank of polytopes contained in the 0-1 cube with respect to $t$-branch split cuts and $t$-dimensional lattice cuts for a fixed positive integer $t$. These inequalities are the same as split cuts when $t=1$ and generalize sp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::510ef9bf0db7643da5b791e2915cb63e
http://arxiv.org/abs/2110.04344
http://arxiv.org/abs/2110.04344
Autor:
Sanjeeb Dash
Publikováno v:
TOP. 27:174-177
In the paper, “Perspectives on Integer Programming for Time-Dependent models”, Boland and Savelsbergh discuss integer programming (IP) models of optimization problems involving activities that have time restrictions, or resources that vary with t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::48b5ce7160fbc4ae0518740d15be90eb
https://doi.org/10.1007/s11750-019-00511-7
https://doi.org/10.1007/s11750-019-00511-7
Publikováno v:
Mathematical Programming. 181:119-147
Given $$P\subset {\mathbb {R}}^n$$, a mixed-integer set $$P^I=P\cap ({\mathbb {Z}}^{t}\times {\mathbb {R}}^{n-t}$$), and a k-tuple of n-dimensional integral vectors $$(\pi _1, \ldots , \pi _k)$$ where the last $$n-t$$ entries of each vector is zero,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c6ab9e2e0221cb84b1ff7215bf9090e2
https://doi.org/10.1007/s10107-019-01379-y
https://doi.org/10.1007/s10107-019-01379-y
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030532611
ISCO
ISCO
The problem of minimizing a multilinear function of binary variables is a well-studied NP-hard problem. The set of solutions of the standard linearization of this problem is called the multilinear set, and many valid inequalities for its convex hull
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2f90d9847212da55e082bb3c9886a3a5
https://doi.org/10.1007/978-3-030-53262-8_5
https://doi.org/10.1007/978-3-030-53262-8_5
Publikováno v:
Mathematical Programming. 170:207-236
We analyze different ways of constructing binary extended formulations of polyhedral mixed-integer sets with bounded integer variables and compare their relative strength with respect to split cuts. We show that among all binary extended formulations
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8d35a33ec3911edc20aada7fcba31cba
https://doi.org/10.1007/s10107-018-1294-0
https://doi.org/10.1007/s10107-018-1294-0
Publikováno v:
SIAM Journal on Optimization. 27:1340-1361
For a fixed integer $t > 0$, we say that a $t$-branch split set (the union of $t$ split sets) is dominated by another one on a polyhedron $P$ if all cuts for $P$ obtained from the first $t$-branch split set are implied by cuts obtained from the secon
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::76d72aeb4a0ff3c0dc3ad8f1c6181330
https://doi.org/10.1137/16m1087783
https://doi.org/10.1137/16m1087783