scientific article; zbMATH DE number 1263202
From MaRDI portal
Publication:4234073
zbMath0920.90105MaRDI QIDQ4234073
Publication date: 15 September 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)
Related Items (15)
Theoretical complexity of grid cover problems used in radar applications ⋮ Shrinking maxima, decreasing costs: new online packing and covering problems ⋮ On dependent randomized rounding algorithms ⋮ Approximation algorithms for a genetic diagnostics problem ⋮ Approximation of the quadratic set covering problem ⋮ Two sensitivity theorems in fuzzy integer programming. ⋮ Scheduling split intervals with non-uniform demands ⋮ Ranking with Fairness Constraints ⋮ Improved parallel approximation of a class of integer programming problems ⋮ Fixed-parameter tractability of satisfying beyond the number of variables ⋮ Approximating the online set multicover problems via randomized winnowing ⋮ Tight approximability results for test set problems in bioinformatics ⋮ A \(\Theta (\log n)\)-approximation for the set cover problem with set ownership ⋮ On interval and circular-arc covering problems ⋮ A fuzzy genetic algorithm for driver scheduling
This page was built for publication:
