scientific article
From MaRDI portal
Publication:2753744
zbMath0976.90082MaRDI QIDQ2753744
Publication date: 11 November 2001
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) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (4)
Data migration on parallel disks: Algorithms and evaluation ⋮ Non-preemptive Scheduling on Machines with Setup Times ⋮ Improved approximation algorithms for data migration ⋮ The generalized maximum coverage problem
This page was built for publication:
