scientific article; zbMATH DE number 1754587
zbMATH Open0986.90024MaRDI QIDQ4535012FDOQ4535012
Authors: Endre Boros, Kazuhisa Makino, Khaled Elbassioni, Vladimir Gurvich, Leonid G. Khachiyan 
Publication date: 12 June 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2076/20760092
Title of this publication is not available (Why is that?)
Recommendations
- Mathematical Foundations of Computer Science 2005
- Dual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities
- On minimal elements in the set of integer nonnegative solutions of a system of linear equations
- Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions
- On minimal solutions of systems of linear equations with applications
- Minimal solutions of linear diophantine systems : bounds and algorithms
- scientific article; zbMATH DE number 3088052
- On the existence of solutions for linear inequality systems
- Approximative Methods for Monotone Systems of Min-Max-Polynomial Equations
- Mathematical Foundations of Computer Science 2005
dualizationInteger programmingquasi-polynomial timecomplexity of incremental algorithmsmonotone discrete binary functionsmonotone inequalitiesregular discrete functions
Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60)
Cited In (11)
- On the complexity of solution extension of optimization problems
- Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data
- Efficient dualization of \(O(\log n\))-term monotone disjunctive normal forms
- Finding a bounded mixed-integer solution to a system of dual network inequalities
- An inequality for polymatroid functions and its applications.
- Generating dual-bounded hypergraphs
- Dual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities
- Invited talks
- Mathematical Foundations of Computer Science 2005
- 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:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4535012)
