scientific article
From MaRDI portal
Publication:3050129
zbMath0414.90060MaRDI QIDQ3050129
Publication date: 1979
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
computational complexitycombinatorial problemtraveling salesmanapproximation algorithmknapsack problembinary searchallocation problemgreedy procedurejob-sequencingNp-hard problem
Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Integer programming (90C10) Boolean programming (90C09)
Related Items
Approximation algorithms for the capacitated plant allocation problem ⋮ Parallel approximation schemes for subset sum and knapsack problems ⋮ An approximate binary search algorithm for the multiple-choice knapsack problem ⋮ Analysis of some greedy algorithms for the single-sink fixed-charge transportation problem ⋮ Bi-dimensional knapsack problems with one soft constraint ⋮ Robust combinatorial optimization with locally budgeted uncertainty ⋮ Approximation schemes for subset-sums ratio problems ⋮ A Fast Approximation Algorithm For The Subset-Sum Problem ⋮ Approximating single- and multi-objective nonlinear sum and product knapsack problems ⋮ Approximation schemes for generalized two-dimensional vector packing with application to data placement ⋮ Fast approximation algorithm for job sequencing with deadlines ⋮ Approximation for knapsack problems with multiple constraints ⋮ The multidimensional 0-1 knapsack problem: an overview. ⋮ Capacitated assortment and price optimization for customers with disjoint consideration sets ⋮ Greedy algorithms for the single-demand facility location problem ⋮ Reductions between scheduling problems with non-renewable resources and knapsack problems ⋮ On a general network location--production--allocation problem ⋮ A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem ⋮ Nonconvex piecewise linear knapsack problems ⋮ Bandwidth Constrained Multi-interface Networks ⋮ Fully polynomial approximation schemes for locating a tree-shaped facility: A generalization of the knapsack problem ⋮ The multidimensional 0-1 knapsack problem -- bounds and computational aspects
