Combinatorial Problems: Reductibility and Approximation
From MaRDI portal
Publication:4168785
DOI10.1287/opre.26.5.718zbMath0386.90048OpenAlexW2109155166MaRDI 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
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10) Boolean programming (90C09) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Enumerative combinatorics (05A99)
Related Items
Knapsack problem with objective value gaps, 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, List scheduling algorithms to minimize the makespan on identical parallel machines, Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints, Approximation of min-max and min-max regret versions of some combinatorial optimization problems, On fault-tolerant path optimization under QoS constraint in multi-channel wireless networks, A polynomial approximation scheme for problem \(F2/r_ j/C_{\text{max}}\), Integer knapsack problems with profit functions of the same value range, Improving the solution complexity of the scheduling problem with deadlines: A general technique, Non deterministic polynomial optimization problems and their approximations, Discrete extremal problems, Bin packing can be solved within 1+epsilon in linear time, Approximation algorithms for maximizing the weighted number of early jobs on a single machine with non-availability intervals, Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date, Min-max and min-max regret versions of combinatorial optimization problems: A survey, Fully polynomial approximation schemes for locating a tree-shaped facility: A generalization of the knapsack problem, Approximate algorithms for the Knapsack problem on parallel computers, Single machine scheduling with batch deliveries, Approximation algorithms for combinatorial fractional programming problems, Approximations to clustering and subgraph problems on trees, Bewertung heuristischer Methoden
