AbstractWe describe an effective method for doing binary-encoded modeling, in the context of 0/1 linear programming, when the number of feasible configurations is not a power of two. Our motivation comes from modeling all-different restrictions
This paper presents an exact algorithm for the bilevel integer linear programming (BILP) problem. Th...
We consider mixed-integer linear programs with arbitrary bounded integer variables. We first describe...
We introduce a new class of valid inequalities for general integer linear programs, called binary cl...
AbstractWe describe an effective method for doing binary-encoded modeling, in the context of 0/1 lin...
In this work we show how Binary Decision Diagrams can be used as a powerful tool for 0/1~Integer Pr...
We show how to efficiently model binary constraint problems (BCP) as integer programs. After conside...
We present a new polyhedral approach to nonlinear boolean optimization problems. Compared to other m...
We introduce a general technique to create an extended formulation of a mixed-integer program. We ...
We show that a 2-variable integer program, defined by m constraints involving coefficients with at m...
In integer programming, {0,1/2}-cuts are Gomory–Chvátal cuts that can be derived from the original l...
We investigate integer programs containing monomial constraints. Due to the number-theoretic nature ...
The thesis argues the case for exploiting certain structures in integer linear programs.\ud \ud Inte...
Solution techniques for combinatorial optimization and integer programming problems are core discipl...
AbstractMany combinatorial optimization problems call for the optimization of a linear function over...
We consider mixed-integer linear programs with arbitrary bounded integer variables. We first describ...
This paper presents an exact algorithm for the bilevel integer linear programming (BILP) problem. Th...
We consider mixed-integer linear programs with arbitrary bounded integer variables. We first describe...
We introduce a new class of valid inequalities for general integer linear programs, called binary cl...
AbstractWe describe an effective method for doing binary-encoded modeling, in the context of 0/1 lin...
In this work we show how Binary Decision Diagrams can be used as a powerful tool for 0/1~Integer Pr...
We show how to efficiently model binary constraint problems (BCP) as integer programs. After conside...
We present a new polyhedral approach to nonlinear boolean optimization problems. Compared to other m...
We introduce a general technique to create an extended formulation of a mixed-integer program. We ...
We show that a 2-variable integer program, defined by m constraints involving coefficients with at m...
In integer programming, {0,1/2}-cuts are Gomory–Chvátal cuts that can be derived from the original l...
We investigate integer programs containing monomial constraints. Due to the number-theoretic nature ...
The thesis argues the case for exploiting certain structures in integer linear programs.\ud \ud Inte...
Solution techniques for combinatorial optimization and integer programming problems are core discipl...
AbstractMany combinatorial optimization problems call for the optimization of a linear function over...
We consider mixed-integer linear programs with arbitrary bounded integer variables. We first describ...
This paper presents an exact algorithm for the bilevel integer linear programming (BILP) problem. Th...
We consider mixed-integer linear programs with arbitrary bounded integer variables. We first describe...
We introduce a new class of valid inequalities for general integer linear programs, called binary cl...
DOI
Add to ORKG