scientific article; zbMATH DE number 6469179
From MaRDI portal
Publication:5501294
zbMath1317.68291MaRDI QIDQ5501294
Publication date: 3 August 2015
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (6)
Smoothed analysis of integer programming ⋮ Branch-and-bound solves random binary IPs in poly\((n)\)-time ⋮ The smoothed number of Pareto-optimal solutions in bicriteria integer optimization ⋮ Efficient heuristic algorithms for path-based hardware/software partitioning ⋮ On the integrality gap of binary integer programs with Gaussian data ⋮ On the integrality gap of binary integer programs with Gaussian data
This page was built for publication:
