Publication

Network Formulations of Mixed-Integer Programs

Friedrich Eisenbrand, Marco Di Summa
2009
Journal paper

Abstract

We consider mixed-integer sets described by system of linear inequalities in which the constraint matrix A is totally unimodular; the right-hand side is arbitrary vector; and a subset of the variables is required to be integer. We show that the problem of checking nonemptiness of a set of this type is NP-complete, even in the case in which the linear system describes mixed-integer network flows with half-integral requirement on the nodes.

Official source

https://infoscience.epfl.ch/record/161332?ln=en

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Network Formulations of Mixed-Integer Programs

Graph Chatbot

Chat with Graph Search

Results on Sparse Integer Programming and Geometric Independent Sets

Removing algorithmic discrimination (with minimal individual error)

Results on Sparse Integer Programming and Geometric Independent Sets

Removing algorithmic discrimination (with minimal individual error)