Symbolic integration of logic in MILP branch and bound methods for the synthesis of process networks
From MaRDI portal
Publication:2368099
Recommendations
Cites work
- A Computing Procedure for Quantification Theory
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Fixed Order Branch-and-Bound Methods for Mixed-Integer Programming: The <scp>zoom</scp> System
- Generalized Benders decomposition
- scientific article; zbMATH DE number 3891096 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 3804893 (Why is no real title available?)
- Logic cuts for processing networks with fixed charges
- Modeling and integer programming techniques applied to propositional calculus
- Partitioning procedures for solving mixed-variables programming problems
- Pivot and Complement–A Heuristic for 0-1 Programming
- Solving Mixed Integer Programming Problems Using Automatic Reformulation
- Solving propositional satisfiability problems
Cited in
(6)- Logic cuts for processing networks with fixed charges
- A strategic model for supply chain design with logical constraints: Formulation and solution.
- Mixed logical-linear programming
- scientific article; zbMATH DE number 1058968 (Why is no real title available?)
- scientific article; zbMATH DE number 2158986 (Why is no real title available?)
- scientific article; zbMATH DE number 970371 (Why is no real title available?)
This page was built for publication: Symbolic integration of logic in MILP branch and bound methods for the synthesis of process networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2368099)