Approximative Algorithms for Discrete Optimization Problems

DOI10.1016/S0167-5060(08)70820-3MaRDI QIDQ4198337zbMATH OpenFDO

Authors Bernhard Korte

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)

Full work available at URL https://doi.org/10.1016/S0167-5060(08)70820-3

zbMATH Keywords

approximative algorithmsdiscrete optimization problemsgreedy methodindependence systeminteger programmingknapsack problemsurveyworst case behaviorworst case bounds

Mathematics Subject Classification ID

Integer programming (90C10)

Cited in

(13)

• Triangle inequality and symmetry in connection with the assignment and the traveling salesman problem
• On an approximate computation of the height of the maximal upper zero of a monotone Boolean function
• On the computational complexity of reliability redundancy allocation in a series system
• Approximations for the maximum acyclic subgraph problem
• 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
• The reversing number of a digraph
• A survey on the linear ordering problem for weighted or unweighted tournaments
• Evaluation of Heuristic Algorithms for the TSP: A New Statistical Approach
• Rational solutions of the graphsack problem
• Meaningfulness of conclusions from combinatorial optimization
• An updated survey on the linear ordering problem for weighted or unweighted tournaments

This page was built for publication: Approximative Algorithms for Discrete Optimization Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4198337)