scientific article; zbMATH DE number 6297783
From MaRDI portal
Publication:5417704
zbMath1288.90131MaRDI QIDQ5417704
Erick Wong, Gábor Pataki, Mustafa Kemal Tural
Publication date: 22 May 2014
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms (68W40) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (9)
Theoretical complexity of grid cover problems used in radar applications ⋮ Branch-and-bound solves random binary IPs in poly\((n)\)-time ⋮ Lower bounds on the size of general branch-and-bound trees ⋮ Thinner is not always better: cascade knapsack problems ⋮ Lattice preconditioning for the real relaxation branch-and-bound approach for integer least squares problems ⋮ Unnamed Item ⋮ On the integrality gap of binary integer programs with Gaussian data ⋮ Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II ⋮ Lower bound on size of branch-and-bound trees for solving lot-sizing problem
This page was built for publication:
