Suchergebnisse - "Quadratic pseudo-boolean functions"

FPTAS for half-products minimization with scheduling applications

Autoren: Erel, E. Ghosh J.B.

Quelle: Discrete Applied Mathematics

Schlagwörter: Pseudo-boolean functions, Approximation scheme, Dynamic Programming, Scheduling, Polynomial approximation, Applied Mathematics, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, Approximation Scheme, Half-products, Np-hard, Dynamic programming, 01 natural sciences, Special class, Nuclear propulsion, Fully polynomial time approximation scheme, Quadratic Pseudo-boolean Functions, Quadratic pseudo-boolean functions, Discrete Mathematics and Combinatorics, Boolean functions

Dateibeschreibung: application/pdf

Zugangs-URL: https://hdl.handle.net/11693/23041
https://hdl.handle.net/11693/11652

Efficient Minimization of Higher Order Submodular Functions using Monotonic Boolean Functions

Autoren: Ramalingam, Srikumar Russell, Chris Ladický, Ľubor et al.

Quelle: Discrete Applied Mathematics, 220

Schlagwörter: Submodular functions, Quadratic pseudo-Boolean functions, Monotonic Boolean functions, Dedekind number, Max-flow/mincut algorithm

Relation: info:eu-repo/semantics/altIdentifier/wos/000394063900001; http://hdl.handle.net/20.500.11850/123100

Verfügbarkeit: https://hdl.handle.net/20.500.11850/123100

A decomposition method for minimizing quadratic pseudo-Boolean functions

Autoren: Brigitte Jaumard Alain Billionnet

Quelle: Operations Research Letters. 8:161-163

Schlagwörter: Decomposition methods, Combinatorial optimization, 0211 other engineering and technologies, Boolean programming, quadratic pseudo-Boolean functions, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, strongly connected components

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/4095216
https://doi.org/10.1016/0167-6377(89)90043-6
https://www.sciencedirect.com/science/article/pii/0167637789900436
https://dl.acm.org/doi/10.1016/0167-6377%2889%2990043-6
http://www.sciencedirect.com/science/article/pii/0167637789900436

Weighted König-Egerváry graphs and pseudo-Boolean optimization

Autoren: Bourjolly, J.-M. Hammer, P. L. Simeone, B.

Schlagwörter: Graph theory, Graph theory (including graph drawing) in computer science, Applications of graph theory to circuits and networks, gap-free functions, linear relaxation, weighted graph, quadratic pseudo-Boolean functions, Quadratic programming

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/3845638