Logic cuts for processing networks with fixed charges

DOI10.1016/0305-0548(94)90089-2zbMath0789.90057MaRDI QIDQ1317071

Hong Yan, Ignacio E. Grossmann, John N. Hooker, Ramesh Raman

Publication date: 24 March 1994

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(94)90089-2

zbMATH Keywords

mixed integer linear programming; logical constraints; design of chemical processing networks

Mathematics Subject Classification ID

90C90: Applications of mathematical programming

90C11: Mixed integer programming

Related Items

Logic cuts for multilevel generalized assignment problems., A strategic model for supply chain design with logical constraints: Formulation and solution., New constructs for the description of combinatorial optimization problems in algebraic modeling languages, Mixed logical-linear programming, Symbolic integration of logic in MILP branch and bound methods for the synthesis of process networks

Cites Work

• Unnamed Item
• Representability in mixed integer programming. I: Characterization results
• Logic-based decision support. Mixed integer model formulation
• A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
• Generalized resolution for 0--1 linear inequalities
• Solving propositional satisfiability problems
• A lift-and-project cutting plane algorithm for mixed 0-1 programs
• Edmonds polytopes and a hierarchy of combinatorial problems
• Optimal Subtrees and Extensions
• A Computational Study of Satisfiability Algorithms for Propositional Logic
• Solving Mixed Integer Programming Problems Using Automatic Reformulation