summary:The paper is a contribution to the general theory of problems of discrete programming. Particularly, the difficulties of such problems are investigated by theoretical means
AbstractThe paper presents a theorem, applicable to many algorithms used in integer programming, whi...
Summary form only given. Integer programming is the problem of maximizing a linear function over the...
This report documents the program and the outcomes of Dagstuhl Seminar 17121 "Computational Complexi...
summary:The paper is a contribution to the general theory of problems of discrete programming. Parti...
Recent developments in the theory of computational complexity as applied to combinatorial problems h...
Discrete optimization problems arise in many different areas and are studied under many different na...
In the first part of this paper, we present a unified framework for analyzing the algorithmic comple...
Recent developments in the theory of computational complexity as applied to combinatorial problems h...
From the 14th of September to the 19th of September, the Dagstuhl Seminar 08381 ``Computational Comp...
This report documents the program and the outcomes of Dagstuhl Seminar 11121 ``Computational Complex...
This book treats the fundamental issues and algorithmic strategies emerging as the core of the disci...
Discrete optimisation problems arise in many different areas and are studied under many different na...
In this paper, we introduce a new and quite natural way of analyzing instances of discrete optimizat...
Estimating the computational complexity of discrete problems constitutes one of the central and clas...
This report documents the program and the outcomes of Dagstuhl Seminar 14121 "Computational Complexi...
AbstractThe paper presents a theorem, applicable to many algorithms used in integer programming, whi...
Summary form only given. Integer programming is the problem of maximizing a linear function over the...
This report documents the program and the outcomes of Dagstuhl Seminar 17121 "Computational Complexi...
summary:The paper is a contribution to the general theory of problems of discrete programming. Parti...
Recent developments in the theory of computational complexity as applied to combinatorial problems h...
Discrete optimization problems arise in many different areas and are studied under many different na...
In the first part of this paper, we present a unified framework for analyzing the algorithmic comple...
Recent developments in the theory of computational complexity as applied to combinatorial problems h...
From the 14th of September to the 19th of September, the Dagstuhl Seminar 08381 ``Computational Comp...
This report documents the program and the outcomes of Dagstuhl Seminar 11121 ``Computational Complex...
This book treats the fundamental issues and algorithmic strategies emerging as the core of the disci...
Discrete optimisation problems arise in many different areas and are studied under many different na...
In this paper, we introduce a new and quite natural way of analyzing instances of discrete optimizat...
Estimating the computational complexity of discrete problems constitutes one of the central and clas...
This report documents the program and the outcomes of Dagstuhl Seminar 14121 "Computational Complexi...
AbstractThe paper presents a theorem, applicable to many algorithms used in integer programming, whi...
Summary form only given. Integer programming is the problem of maximizing a linear function over the...
This report documents the program and the outcomes of Dagstuhl Seminar 17121 "Computational Complexi...
DOI
Add to ORKG