Progress in computational mixed integer programming -- a look back from the other side of the tipping point
type: Item
instance of: scholarly article
title: Progress in computational mixed integer programming -- a look back from the other side of the tipping point
zbMATH Open document ID: 1213.90011
author: Edward Rothberg
author: Robert E. Bixby
published in: Annals of Operations Research
publication date: 2011-05-20T00:00:00Z
Mathematics Subject Classification ID: 90-03
Mathematics Subject Classification ID: 01A60
Mathematics Subject Classification ID: 90C11
zbMATH DE Number: 5898422
MaRDI profile type: Publication
Wikidata QID: Q114227582
full work available at URL: s10479-006-0091-y
OpenAlex ID: W2026514179
cites work: Conflict graphs in solving integer programming problems
cites work: Disjunctive Programming
cites work: Gomory cuts revisited
cites work: MIP: Theory and practice -- closing the gap
cites work: Solving Large-Scale Zero-One Linear Programming Problems
cites work: Integer Programming and Pricing
cites work: Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs
cites work: Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut
cites work: Degree-two Inequalities, Clique Facets, and Biperfect Graphs
cites work: Aggregation and Mixed Integer Rounding to Solve MIPs
cites work: Valid Linear Inequalities for Fixed Charge Problems
cites work: Valid inequalities and separation for uncapacitated fixed charge networks
cites work: On the \(0/1\) knapsack polytope
DOI: 10.1007/S10479-006-0091-Y
description: scientific article; zbMATH DE number 5898422