Automatic Complexity Analysis of Integer Programs via Triangular Weakly Non-Linear Loops
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
In: 10.1007/978-3-031-10769-6_43
- Ereignis
-
Veröffentlichung
- (wo)
-
Aachen
- (wer)
-
Universitätsbibliothek der RWTH Aachen
- (wann)
-
2022
- Urheber
-
Lommen, Nils
Meyer, Fabian Niklas
Giesl, Jürgen
- DOI
-
10.18154/RWTH-2022-08510
- URN
-
urn:nbn:de:101:1-2022091001341801604408
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:49 MEZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Lommen, Nils
- Meyer, Fabian Niklas
- Giesl, Jürgen
- Universitätsbibliothek der RWTH Aachen
Entstanden
- 2022
Ähnliche Objekte (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