scientific article; zbMATH DE number 2086430
From MaRDI portal
Publication:4736885
zbMath1054.68170MaRDI QIDQ4736885
Publication date: 11 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2292/22920198.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abstract computational complexity for mathematical programming problems (90C60) Approximation methods and heuristics in mathematical programming (90C59) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Related Items (3)
Priority-based bin packing with subset constraints ⋮ Polynomial time algorithms for optimal length tree-like refutations of linear infeasibility in UTVPI constraints ⋮ Profit maximization problem with coupons in social networks
This page was built for publication:
