The convex hull of a linear congruence relation in zero-one variables

DOI10.1007/BF01415061MaRDI QIDQ4698117zbMATH OpenOpenAlexFDO

Authors Dimitris Alevras, Minendra P. Rijal

Publication date 1 April 1996

Published in ZOR Zeitschrift f�r Operations Research Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01415061

zbMATH Keywords

linear congruence relationportfolio selectionpredicate logicPresburger arithmeticzero-one linear program

Mathematics Subject Classification ID

Linear programming (90C05) Boolean programming (90C09) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
• Cones of Matrices and Set-Functions and 0–1 Optimization
• Linear programming approaches to the convex hull problem in \(\mathbb{R}^ m\)
• scientific article; zbMATH DE number 828002

Cites work

• Canonical Cuts on the Unit Hypercube
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• Odd Minimum Cut-Sets and b-Matchings

Cited in

(2)

• Über eine spezielle lineare o-l-optimlermagsaufgabe
• The polytope of binary sequences with bounded variation

This page was built for publication: The convex hull of a linear congruence relation in zero-one variables

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