scientific article; zbMATH DE number 1865680
From MaRDI portal
Publication:4792058
zbMath1140.90011MaRDI QIDQ4792058
Vangelis Th. Paschos, Jérôme Monnot, Sophie Toulouse
Publication date: 10 February 2003
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abstract computational complexity for mathematical programming problems (90C60) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Research exposition (monographs, survey articles) pertaining to computer science (68-02)
Related Items (5)
Differential approximation of MIN SAT, MAX SAT and related problems ⋮ Local approximations for maximum partial subgraph problem. ⋮ Approximation of the double traveling salesman problem with multiple stacks ⋮ Approximate solution of a resource-constrained scheduling problem ⋮ Differential approximation of NP-hard problems with equal size feasible solutions
This page was built for publication:
