Mathematical Foundations of Computer Science 2005

DOI10.1007/11549345MaRDI QIDQ5492889zbMATH OpenOpenAlexFDO

Authors Endre Boros, Leonid G. Khachiyan, Khaled Elbassioni, Vladimir Gurvich

Publication date 20 October 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11549345

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Combinatorial aspects of matroids and geometric lattices (05B35)

Recommendations

• scientific article; zbMATH DE number 1754587
• Dual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities
• Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions
• Approximative Methods for Monotone Systems of Min-Max-Polynomial Equations
• Generating convex polynomial inequalities for mixed 0-1 programs
• Matroid optimization problems with monotone monomials in the objective
• On minimal elements in the set of integer nonnegative solutions of a system of linear equations
• ENUMERATION OF ALL SOLUTIONS OF A COMBINATORIAL LINEAR INEQUALITY SYSTEM ARISING FROM THE POLYHEDRAL HOMOTOPY CONTINUATION METHOD
• A method to find all solutions of a system of multivariate polynomial equalities and inequalities in the max algebra
• Monotone generalized variational inequalities and generalized complementarity problems

Cited in

(6)

• scientific article; zbMATH DE number 2038737 (Why is no real title available?)
• Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data
• Dual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities
• scientific article; zbMATH DE number 1754587 (Why is no real title available?)
• Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions
• Scientific contributions of Leo Khachiyan (a short overview)

This page was built for publication: Mathematical Foundations of Computer Science 2005

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