FPT algorithms for a special block-structured integer program with applications in scheduling.
Saved in:
| Title: | FPT algorithms for a special block-structured integer program with applications in scheduling. |
|---|---|
| Authors: | Chen, Hua1 (AUTHOR), Chen, Lin2 (AUTHOR), Zhang, Guochuan1 (AUTHOR) zgc@zju.edu.cn |
| Source: | Mathematical Programming. Nov2024, Vol. 208 Issue 1/2, p463-496. 34p. |
| Subjects: | Computable functions, Absolute value, Integer programming, Integers, Logarithms |
| Abstract: | In this paper, a special case of the generalized 4-block n-fold IPs is investigated, where B i = B and B has a rank at most 1. Such IPs, called almost combinatorial 4-block n-fold IPs, include the generalized n-fold IPs as a subcase. We are interested in fixed parameter tractable (FPT) algorithms by taking as parameters the dimensions of the blocks and the largest coefficient. For almost combinatorial 4-block n-fold IPs, we first show that there exists some λ ≤ g (γ) such that for any nonzero kernel element g , λ g can always be decomposed into kernel elements in the same orthant whose ℓ ∞ -norm is bounded by g (γ) (while g itself might not admit such a decomposition), where g is a computable function and γ is an upper bound on the dimensions of the blocks and the largest coefficient. Based on this, we are able to bound the ℓ ∞ -norm of Graver basis elements by O (g (γ) n) and develop an O (g (γ) n 3 + o (1) L ^ 2) -time algorithm (here L ^ denotes the logarithm of the largest absolute value occurring in the input). Additionally, we show that the ℓ ∞ -norm of Graver basis elements is Ω (n) . As applications, almost combinatorial 4-block n-fold IPs can be used to model generalizations of classical problems, including scheduling with rejection, bi-criteria scheduling, and a generalized delivery problem. Therefore, our FPT algorithm establishes a general framework to settle these problems. [ABSTRACT FROM AUTHOR] |
| Copyright of Mathematical Programming is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
|
Full text is not displayed to guests.
Login for full access.
|
|
| Abstract: | In this paper, a special case of the generalized 4-block n-fold IPs is investigated, where B i = B and B has a rank at most 1. Such IPs, called almost combinatorial 4-block n-fold IPs, include the generalized n-fold IPs as a subcase. We are interested in fixed parameter tractable (FPT) algorithms by taking as parameters the dimensions of the blocks and the largest coefficient. For almost combinatorial 4-block n-fold IPs, we first show that there exists some λ ≤ g (γ) such that for any nonzero kernel element g , λ g can always be decomposed into kernel elements in the same orthant whose ℓ ∞ -norm is bounded by g (γ) (while g itself might not admit such a decomposition), where g is a computable function and γ is an upper bound on the dimensions of the blocks and the largest coefficient. Based on this, we are able to bound the ℓ ∞ -norm of Graver basis elements by O (g (γ) n) and develop an O (g (γ) n 3 + o (1) L ^ 2) -time algorithm (here L ^ denotes the logarithm of the largest absolute value occurring in the input). Additionally, we show that the ℓ ∞ -norm of Graver basis elements is Ω (n) . As applications, almost combinatorial 4-block n-fold IPs can be used to model generalizations of classical problems, including scheduling with rejection, bi-criteria scheduling, and a generalized delivery problem. Therefore, our FPT algorithm establishes a general framework to settle these problems. [ABSTRACT FROM AUTHOR] |
|---|---|
| ISSN: | 00255610 |
| DOI: | 10.1007/s10107-023-02046-z |
