Boolean Elements in Combinatorial Optimization

DOI10.1016/S0167-5060(08)70818-5MaRDI QIDQ3050131zbMATH OpenOpenAlexFDO

Authors 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

linear or nonlinear inequalitiesswitching theorysurveyShapley valueset covering problemsresolvantpseudo-boolean translationpacking problemsn-person game0-1 variablesknapsack problemsinteger programminggraph theorygame theoryfacets of knapsack polytopesdiscrete optimizationBoolean programmingBoolean algebra

Mathematics Subject Classification ID

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

Cited in

(3)

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

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

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