The many connections between the methods of Computational Logic and Integer Programming (IP) are surveyed. It is shown how computational problems arising in formal logic can be solved by IP. Also it is shown how the methods of logic are applicable both to modelling and solving IP models. It is shown how Fourier-Motzkin elimination for Linear Programming, when specialised to 0–1 IP models gives rise to the logic method of Resolution. Finally conventional IP methods are applied to solving logical inference problems
AbstractThis paper considers in a somewhat general setting when a combinatorial optimization problem...
Linear programming (LP) duality is examined in the context of other dualities in mathematics. The ma...
Integer Programming: Theory, Applications, and Computations provides information pertinent to the th...
The many connections between the methods of Computational Logic and Integer Programming (IP) are sur...
Integer programming (discrete optimization) is best used for solving problems involving discrete, wh...
Abstract This tutorial describes a logic-based approach to formulating and solving pure and mixed in...
abstract (preface): mathematical programming deals with the optimization of a given function under c...
A logic view of 0-1 integer programming problems, providing new insights into the structure of probl...
We generalise polyhedral projection (Fourier-Motzkin elimination) to integer programming (IP) and de...
A modelling language for Integer Programming (IP) based on the Predicate Calculus is described. This...
This paper describes how the Fourier-Motzkin Elimination Method, which can be used for solving Linea...
. This paper proposes a logic-based approach to optimization that combines solution methods from ma...
AbstractThis paper describes how the Fourier-Motzkin Elimination Method, which can be used for solvi...
This paper illustrates how the application of integer programming to logic can reveal parallels betw...
AbstractIn this paper we show how to represent a set of logic propositions as an integer linear prog...
AbstractThis paper considers in a somewhat general setting when a combinatorial optimization problem...
Linear programming (LP) duality is examined in the context of other dualities in mathematics. The ma...
Integer Programming: Theory, Applications, and Computations provides information pertinent to the th...
The many connections between the methods of Computational Logic and Integer Programming (IP) are sur...
Integer programming (discrete optimization) is best used for solving problems involving discrete, wh...
Abstract This tutorial describes a logic-based approach to formulating and solving pure and mixed in...
abstract (preface): mathematical programming deals with the optimization of a given function under c...
A logic view of 0-1 integer programming problems, providing new insights into the structure of probl...
We generalise polyhedral projection (Fourier-Motzkin elimination) to integer programming (IP) and de...
A modelling language for Integer Programming (IP) based on the Predicate Calculus is described. This...
This paper describes how the Fourier-Motzkin Elimination Method, which can be used for solving Linea...
. This paper proposes a logic-based approach to optimization that combines solution methods from ma...
AbstractThis paper describes how the Fourier-Motzkin Elimination Method, which can be used for solvi...
This paper illustrates how the application of integer programming to logic can reveal parallels betw...
AbstractIn this paper we show how to represent a set of logic propositions as an integer linear prog...
AbstractThis paper considers in a somewhat general setting when a combinatorial optimization problem...
Linear programming (LP) duality is examined in the context of other dualities in mathematics. The ma...
Integer Programming: Theory, Applications, and Computations provides information pertinent to the th...