Zobrazeno 1 - 10
of 18
pro vyhledávání: '"Joseph Paat"'
Publikováno v:
Mathematical Programming.
Publikováno v:
Integer Programming and Combinatorial Optimization ISBN: 9783031327254
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ad39e21b8995e5f78b7244ff9112d7ea
https://doi.org/10.1007/978-3-031-32726-1_25
https://doi.org/10.1007/978-3-031-32726-1_25
Publikováno v:
Integer Programming and Combinatorial Optimization ISBN: 9783031069000
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d00f86569e0b78d6dcb38579ec49f72e
https://doi.org/10.1007/978-3-031-06901-7_7
https://doi.org/10.1007/978-3-031-06901-7_7
Publikováno v:
SIAM Journal on Discrete Mathematics. 33:755-783
We explore the lifting question in the context of cut-generating functions. Most of the prior literature on this question focuses on cut-generating functions that have the unique lifting property. ...
We study integer-valued matrices with bounded determinants. Such matrices appear in the theory of integer programs (IP) with bounded determinants. For example, Artmann et al. showed that an IP can be solved in strongly polynomial time if the constrai
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::023695738d8e7541a9179d42ae658d4b
Publikováno v:
Integer Programming and Combinatorial Optimization ISBN: 9783030457709
IPCO
IPCO
Lattice-free gradient polyhedra are optimality certificates for mixed integer convex minimization models. We consider how to construct these polyhedra for unconstrained models with two integer variables. A classic result of Bell, Doignon, and Scarf s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::25fc1d53f10c2202fc33bf7e752ffa60
https://doi.org/10.1007/978-3-030-45771-6_28
https://doi.org/10.1007/978-3-030-45771-6_28
Publikováno v:
Integer Programming and Combinatorial Optimization ISBN: 9783030457709
IPCO
IPCO
We introduce the integrality number of an integer program (IP) in inequality form. Roughly speaking, the integrality number is the smallest number of integer constraints needed to solve an IP via a mixed integer (MIP) relaxation. One notable property
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9b2319bf2a172a3c43030b6736977bb4
https://doi.org/10.1007/978-3-030-45771-6_26
https://doi.org/10.1007/978-3-030-45771-6_26
Publikováno v:
Mathematical Programming. 179:455-468
A classic result of Cook et al. (Math. Program. 34:251–264, 1986) bounds the distances between optimal solutions of mixed-integer linear programs and optimal solutions of the corresponding linear relaxations. Their bound is given in terms of the nu
Autor:
Thomas Schlechte, Joseph Paat, Alexander Tesch, Rosemarie Martienssen, Brady Gilg, Senan Seymen, Torsten Klug, Christof Schulz
Publikováno v:
Journal of Rail Transport Planning & Management. 8:16-28
Managing rolling stock with no passengers aboard is a critical component of railway operations. One aspect of managing rolling stock is to park the rolling stock on a given set of tracks at the end of a day or service. Depending on the parking assign
We consider the asymptotic distribution of the IP sparsity function, which measures the minimal support of optimal IP solutions, and the IP to LP distance function, which measures the distance between optimal IP and LP solutions. We create a framewor
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::de73c7b1639d56cb5073f82c06c8d4e1
http://arxiv.org/abs/1907.07960
http://arxiv.org/abs/1907.07960