scientific article; zbMATH DE number 3873085
From MaRDI portal
Publication:3340632
Permutations, words, matrices (05A05) Extremal problems in graph theory (05C35) Numerical mathematical programming methods (65K05) Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Boolean programming (90C09) Integer programming (90C10)
Recommendations
- scientific article; zbMATH DE number 3873084
- On Approximate Solutions for Combinatorial Optimization Problems
- scientific article; zbMATH DE number 969179
- Approximation algorithms for stochastic combinatorial optimization problems
- Differential approximation algorithms for some combinatorial optimization problems
- scientific article; zbMATH DE number 2077129
- Approximability of hard combinatorial optimization problems: an introduction
- scientific article; zbMATH DE number 3878680
- Approximation algorithms from inexact solutions to semidefinite programming relaxations of combinatorial optimization problems
Cited in
(4)- Approximation algorithms for combinatorial optimization. International ICALP '98 workshop, APPROX '98, Aalborg, Denmark, July 18--19, 1998. Proceedings
- Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms
- On Approximate Solutions for Combinatorial Optimization Problems
- scientific article; zbMATH DE number 1789921 (Why is no real title available?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3340632)
