Boolean Elements in Combinatorial Optimization

DOI10.1016/S0167-5060(08)70818-5zbMath0414.90062OpenAlexW4242462359MaRDI QIDQ3050131

Peter L. Hammer

Publication date: 1979

Published in: Discrete Optimization I, Proceedings of the Advanced Research Institute on Discrete Optimization and Systems Applications of the Systems Science Panel of NATO and of the Discrete Optimization Symposium (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-5060(08)70818-5

zbMATH Keywords

surveygame theoryinteger programmingBoolean algebraShapley valuegraph theorydiscrete optimizationBoolean programmingknapsack problemspacking problemsset covering problemsswitching theoryresolvantn-person game0-1 variablesfacets of knapsack polytopeslinear or nonlinear inequalitiespseudo-boolean translation

Mathematics Subject Classification ID

Integer programming (90C10) Cooperative games (91A12) Graph theory (including graph drawing) in computer science (68R10) Boolean programming (90C09) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items (3)

Testing optimality for quadratic 0?1 unconstrained problems ⋮ Regular (2, 2)-systems ⋮ Roof duality, complementation and persistency in quadratic 0–1 optimization

This page was built for publication: Boolean Elements in Combinatorial Optimization