Approximative Algorithms for Discrete Optimization Problems
From MaRDI portal
Publication:4198337
DOI10.1016/S0167-5060(08)70820-3zbMath0411.90052MaRDI QIDQ4198337
Publication date: 1979
Published in: Discrete Optimization I, Proceedings of the Advanced Research Institute on Discrete Optimization and Systems Applications of the Systems Science Panel of NATO and of the Discrete Optimization Symposium (Search for Journal in Brave)
surveyinteger programmingknapsack problemindependence systemdiscrete optimization problemsgreedy methodworst case boundsworst case behaviorapproximative algorithms
Related Items (13)
Approximations for the maximum acyclic subgraph problem ⋮ The reversing number of a digraph ⋮ A survey on the linear ordering problem for weighted or unweighted tournaments ⋮ Triangle inequality and symmetry in connection with the assignment and the traveling salesman problem ⋮ Evaluation of Heuristic Algorithms for the TSP: A New Statistical Approach ⋮ On an approximate computation of the height of the maximal upper zero of a monotone Boolean function ⋮ Rational solutions of the graphsack problem ⋮ On the computational complexity of reliability redundancy allocation in a series system ⋮ An updated survey on the linear ordering problem for weighted or unweighted tournaments ⋮ Meaningfulness of conclusions from combinatorial optimization ⋮ Facilities layout generalized model solved by n-boundary shortest path heuristics ⋮ Heuristic methods and applications: A categorized survey ⋮ The simple plant location problem: Survey and synthesis
This page was built for publication: Approximative Algorithms for Discrete Optimization Problems
