Logic cuts for processing networks with fixed charges
- 31 March 1994
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 21 (3) , 265-279
- https://doi.org/10.1016/0305-0548(94)90089-2
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- Edmonds polytopes and a hierarchy of combinatorial problemsPublished by Elsevier ,2002
- Solving propositional satisfiability problemsAnnals of Mathematics and Artificial Intelligence, 1990
- Optimization model for long range planning in the chemical industryComputers & Chemical Engineering, 1989
- Representability in mixed integer programmiing, I: Characterization resultsDiscrete Applied Mathematics, 1987
- Solving Mixed Integer Programming Problems Using Automatic ReformulationOperations Research, 1987
- An MILP formulation for heat‐integrated distillation sequence synthesisAIChE Journal, 1985