Combinatorial Problems: Reductibility and Approximation
From MaRDI portal
Publication:4168785
DOI10.1287/opre.26.5.718zbMath0386.90048MaRDI QIDQ4168785
Publication date: 1978
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.26.5.718
90C35: Programming involving graphs or networks
68Q25: Analysis of algorithms and problem complexity
65K05: Numerical mathematical programming methods
90C10: Integer programming
90B35: Deterministic scheduling theory in operations research
90B10: Deterministic network models in operations research
90C09: Boolean programming
90-02: Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming
05A99: Enumerative combinatorics
Related Items
Approximation algorithms for combinatorial fractional programming problems, Approximate algorithms for the Knapsack problem on parallel computers, Approximation of min-max and min-max regret versions of some combinatorial optimization problems, Min-max and min-max regret versions of combinatorial optimization problems: A survey, Approximations to clustering and subgraph problems on trees, Exact methods for the knapsack problem and its generalizations, Parallel approximation schemes for subset sum and knapsack problems, The principle of optimality in the design of efficient algorithms, Non deterministic polynomial optimization problems and their approximations, Discrete extremal problems, Bin packing can be solved within 1+epsilon in linear time, Fully polynomial approximation schemes for locating a tree-shaped facility: A generalization of the knapsack problem, Single machine scheduling with batch deliveries, List scheduling algorithms to minimize the makespan on identical parallel machines, A polynomial approximation scheme for problem \(F2/r_ j/C_{\text{max}}\), Bewertung heuristischer Methoden
