We consider mixed 0-1 linear programs in which one is given a collection of (not necessarily disjoint) sets of variables and, for each set, a fixxed charge is incurred if and only if at least one of the variables in the set takes a positive value. We derive strong valid linear inequalities for these problems, and show that they generalise and dominate a subclass of the well-known flow cover inequalities for the classical fixed-charge problem
AbstractThis paper discusses a simple procedure to derive network inequalities for capacitated fixed...
In this work we focus on various cutting-plane methods for Mixed-integer Linear Programming (MILP) p...
Capacitated fixed-charge network flow problems (CFCNF) are used to model a variety of problems in te...
We consider mixed 0-1 linear programs in which one is given a collection of (not necessarily disjoin...
The most effective software packages for solving mixed 0-1 linear programs use strong valid linear i...
A wide variety of important problems, in Operational Research and other fields, can be modelled as o...
This tutorial presents a theory of valid inequalities for mixed integer linear sets. It introduces t...
We consider a mixed integer set which generalizes two well-known sets: the single node fixed-charge ...
We consider a variant of the well-known Single Node Fixed-Charge Network (SNFCN) set where a set-up ...
In this paper we discuss the polyhedral structure of the integer single node flow set with two possi...
In this paper a mixed integer set resulting from the intersection of a single constrained mixed 0–1 ...
Laurent and Poljak introduced a very general class of valid linear inequalities, called gap inequali...
My work focuses on cutting planes technology in Mixed Integer Programming. I explore novel classes o...
Many problems arising in OR/MS can be formulated as mixed-integer linear programs (MILPs): see the a...
This paper studies the polyhedral structure of dynamic fixed-charge problems that have nested relati...
AbstractThis paper discusses a simple procedure to derive network inequalities for capacitated fixed...
In this work we focus on various cutting-plane methods for Mixed-integer Linear Programming (MILP) p...
Capacitated fixed-charge network flow problems (CFCNF) are used to model a variety of problems in te...
We consider mixed 0-1 linear programs in which one is given a collection of (not necessarily disjoin...
The most effective software packages for solving mixed 0-1 linear programs use strong valid linear i...
A wide variety of important problems, in Operational Research and other fields, can be modelled as o...
This tutorial presents a theory of valid inequalities for mixed integer linear sets. It introduces t...
We consider a mixed integer set which generalizes two well-known sets: the single node fixed-charge ...
We consider a variant of the well-known Single Node Fixed-Charge Network (SNFCN) set where a set-up ...
In this paper we discuss the polyhedral structure of the integer single node flow set with two possi...
In this paper a mixed integer set resulting from the intersection of a single constrained mixed 0–1 ...
Laurent and Poljak introduced a very general class of valid linear inequalities, called gap inequali...
My work focuses on cutting planes technology in Mixed Integer Programming. I explore novel classes o...
Many problems arising in OR/MS can be formulated as mixed-integer linear programs (MILPs): see the a...
This paper studies the polyhedral structure of dynamic fixed-charge problems that have nested relati...
AbstractThis paper discusses a simple procedure to derive network inequalities for capacitated fixed...
In this work we focus on various cutting-plane methods for Mixed-integer Linear Programming (MILP) p...
Capacitated fixed-charge network flow problems (CFCNF) are used to model a variety of problems in te...