Network Formulations of Mixed-Integer Programs
نویسندگان
چکیده
منابع مشابه
Network Formulations of Mixed-Integer Programs
We consider mixed-integer sets of the type MIX = {x : Ax ≥ b; xi integer, i ∈ I}, where A is a totally unimodular matrix, b is an arbitrary vector and I is a nonempty subset of the column indices of A. We show that the problem of checking nonemptiness of a setMIX is NP-complete even in the case in which the system describes mixed-integer network flows with half-integral requirements on the node...
متن کاملTight formulations for some simple mixed integer programs and convex objective integer programs
We study the polyhedral structure of simple mixed integer sets that generalize the two variable set {(s, z) ∈ IR1+×Z 1 : s ≥ b−z}. These sets form basic building blocks that can be used to derive tight formulations for more complicated mixed integer programs. For four such sets we give a complete description by valid inequalities and/or an integral extended formulation, and we also indicate wha...
متن کاملStrong formulations for mixed integer programs: valid inequalities and extended formulations
We examine progress over the last fifteen years in finding strong valid inequalities and tight extended formulations for simple mixed integer sets lying both on the “easy” and “hard” sides of the complexity frontier. Most progress has been made in studying sets arising from knapsack and single node flow sets, and a variety of sets motivated by different lot-sizing models. We conclude by citing ...
متن کاملExtended Formulations in Mixed-Integer Convex Programming
We present a unifying framework for generating extended formulations for the polyhedral outer approximations used in algorithms for mixed-integer convex programming (MICP). Extended formulations lead to fewer iterations of outer approximation algorithms and generally faster solution times. First, we observe that all MICP instances from the MINLPLIB2 benchmark library are conic representable wit...
متن کاملPresolving Mixed-Integer Linear Programs
We survey the techniques used for presolving Mixed-integer linear programs (MILPs). Presolving is an important component of all modern MILP solvers. It is used for simplifying a given instance, for detecting any obvious problems or errors, and for identifying structures and characteristics that are useful for solving an instance.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Operations Research
سال: 2009
ISSN: 0364-765X,1526-5471
DOI: 10.1287/moor.1080.0354