Automatic Complexity Analysis of Integer Programs via Triangular Weakly Non-Linear Loops
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
In: 10.1007/978-3-031-10769-6_43
- Event
-
Veröffentlichung
- (where)
-
Aachen
- (who)
-
Universitätsbibliothek der RWTH Aachen
- (when)
-
2022
- Creator
-
Lommen, Nils
Meyer, Fabian Niklas
Giesl, Jürgen
- DOI
-
10.18154/RWTH-2022-08510
- URN
-
urn:nbn:de:101:1-2022091001341801604408
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
25.03.2025, 1:49 PM CET
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Lommen, Nils
- Meyer, Fabian Niklas
- Giesl, Jürgen
- Universitätsbibliothek der RWTH Aachen
Time of origin
- 2022
Other Objects (12)
Termination of Triangular Integer Loops is Decidable
Wilson loops for triangular contours with circular edges
Multiple discrete endogenous variables in weakly-separable triangular models
Multistage Stochastic Integer Programs
Multistage stochastic integer programs
On elementary loops of logic programs
Equivalence of utilitarian maximal and weakly maximal programs
Sect. 5: integer linear programs (ILP)
Parameterized complexity of configuration integer programs
Exact primal algorithms for general integer and mixed integer linear programs
Decomposition of Integer Programs with Matchability Structure
Reducing mixed-integer to zero-one programs
Termination of Triangular Integer Loops is Decidable
Wilson loops for triangular contours with circular edges
Multiple discrete endogenous variables in weakly-separable triangular models
Multistage Stochastic Integer Programs
Multistage stochastic integer programs
On elementary loops of logic programs
Equivalence of utilitarian maximal and weakly maximal programs
Sect. 5: integer linear programs (ILP)
Parameterized complexity of configuration integer programs
Exact primal algorithms for general integer and mixed integer linear programs
Decomposition of Integer Programs with Matchability Structure
Reducing mixed-integer to zero-one programs
Termination of Triangular Integer Loops is Decidable
Wilson loops for triangular contours with circular edges
Multiple discrete endogenous variables in weakly-separable triangular models
Multistage Stochastic Integer Programs
Multistage stochastic integer programs
On elementary loops of logic programs
Equivalence of utilitarian maximal and weakly maximal programs
Sect. 5: integer linear programs (ILP)
Parameterized complexity of configuration integer programs
Exact primal algorithms for general integer and mixed integer linear programs
Decomposition of Integer Programs with Matchability Structure