scientific article; zbMATH DE number 1072400

MaRDI QIDQ4359293zbMATH OpenFDO

Authors Marc Demange, Vangelis Th. Paschos

Publication date 8 October 1997

Full work available at URL http://www.numdam.org/item?id=MSH_1996__135__51_0, https://eudml.org/doc/94486

zbMATH Keywords

combinatorial optimizationpolynomial approximationconstructibilitycontradictions in complexity theory

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• Complete solutions and extremality criteria to polynomial optimization problems
• An optimization principle applied to certain extremal problems for polynomials
• A polynomial algorithm for finding a prescribed number of best solutions of extremal problems on matroids
• Combinatorial optimization solution of the optimal extremum problem of function
• scientific article; zbMATH DE number 5823944
• scientific article; zbMATH DE number 3855685
• scientific article; zbMATH DE number 3551311
• scientific article; zbMATH DE number 4134382
• Computation with polynomial equations and inequalities arising in combinatorial optimization

Cited in

(5)

• Complete solutions and extremality criteria to polynomial optimization problems
• scientific article; zbMATH DE number 609981 (Why is no real title available?)
• Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : de la structure de NPO à la structure des instances
• Refuting conjectures in extremal combinatorics via linear programming
• Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : formalisme unifié et classes d'approximation

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 Q4359293)