Logic cuts for processing networks with fixed charges

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

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

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 programminglogical constraintsdesign of chemical processing networks

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Mixed integer programming (90C11)

Related Items

Constraint programming and operations research, Symbolic integration of logic in MILP branch and bound methods for the synthesis of process networks, Petroleum refinery optimization, New constructs for the description of combinatorial optimization problems in algebraic modeling languages, Valid inequalities for mixed-integer programmes with fixed charges on sets of variables, Optimally solving the joint order batching and picker routing problem, Logic cuts for multilevel generalized assignment problems., A strategic model for supply chain design with logical constraints: Formulation and solution., Mixed logical-linear programming, Local search inequalities

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