A hybrid branch-and-bound approach for exact rational mixed-integer programming
type: Item
instance of: scholarly article
title: A hybrid branch-and-bound approach for exact rational mixed-integer programming
zbMATH Open document ID: 1305.90310
author: William Cook
author: Thorsten Koch
author: Daniel E. Steffy
author: Kati Wolter
published in: Mathematical Programming Computation
publication date: 2014-10-06T00:00:00Z
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 6351717
zbMATH Keywords: mixed integer programming
zbMATH Keywords: branch-and-bound
zbMATH Keywords: exact computation
cites work: QSopt_ex
cites work: Conflict analysis in mixed integer programming
cites work: SCIP: solving constraint integer programs
cites work: Q3425132
cites work: Exact solutions to linear programming problems
cites work: Computation of condition numbers for linear programming problems using Peña’s method
cites work: A new condition number for linear programming
cites work: Solving linear programs with finite precision. I: Condition numbers and random programs
cites work: Solving linear programs with finite precision. II: Algorithms
cites work: Unifying Condition Numbers for Linear Programming
cites work: Numerically safe Gomory mixed-integer cuts
cites work: Combinatorial auctions: a survey
cites work: Q4471306
cites work: Benchmarking optimization software with performance profiles.
cites work: The final NETLIB-LP results
cites work: Q3372341
cites work: Safe bounds in linear and mixed-integer linear programming
cites work: Condition measures and properties of the central trajectory of a linear program
cites work: Computational Experience and the Explanatory Value of Condition Measures for Linear Optimization
cites work: Some perturbation theory for linear programming
cites work: Incorporating Condition Measures into the Complexity Theory of Linear Programming
cites work: Linear programming, complexity theory and elementary functional analysis
cites work: An Exact Rational Mixed-Integer Programming Solver
cites work: On the complexity of linear programming under finite precision arithmetic
describes a project that uses: QSopt_ex
describes a project that uses: Zimpl
describes a project that uses: SoPlex
describes a project that uses: Concorde
describes a project that uses: QSopt-Exact
describes a project that uses: NEOS
describes a project that uses: SCIP
describes a project that uses: CPLEX
describes a project that uses: MIPLIB2003
describes a project that uses: Netlib
describes a project that uses: Benchmarks for Optimization Software
describes a project that uses: gmp
describes a project that uses: MIPLIB
MaRDI profile type: Publication
full work available at URL: s12532-013-0055-6
OpenAlex ID: W2079258636
DOI: 10.1007/S12532-013-0055-6
description: scientific article; zbMATH DE number 6351717