scientific article; zbMATH DE number 1754587
From MaRDI portal
Publication:4535012
zbMath0986.90024MaRDI QIDQ4535012
Endre Boros, Kazuhisa Makino, Leonid G. Khachiyan, Khaled M. Elbassioni, Vladimir A. Gurvich
Publication date: 12 June 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2076/20760092
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Integer programmingdualizationquasi-polynomial timecomplexity of incremental algorithmsmonotone discrete binary functionsmonotone inequalitiesregular discrete functions
Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60)
Related Items (6)
Invited talks ⋮ An inequality for polymatroid functions and its applications. ⋮ Scientific contributions of Leo Khachiyan (a short overview) ⋮ Generating dual-bounded hypergraphs ⋮ On the complexity of solution extension of optimization problems ⋮ Efficient dualization of \(O(\log n\))-term monotone disjunctive normal forms
This page was built for publication:
