Constructing integer programming models by the predicate calculus
From MaRDI portal
Publication:918417
DOI10.1007/BF02022101zbMath0705.90062OpenAlexW1983565714MaRDI QIDQ918417
K. I. M. McKinnon, H. Paul Williams
Publication date: 1989
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02022101
Related Items (9)
Exact stochastic constraint optimisation with applications in network analysis ⋮ Logic applied to integer programming and integer programming applied to logic ⋮ A strategic model for supply chain design with logical constraints: Formulation and solution. ⋮ A mathematical programming model for multiple integrated MRP planning stages ⋮ Modelling either-or relations in integer programming ⋮ A linear and discrete programming framework for representing qualitative knowledge ⋮ Formulating logical implications in combinatorial optimisation ⋮ Tools for reformulating logical forms into zero-one mixed integer programs ⋮ An alternative explanation of disjunctive formulations
Cites Work
- Unnamed Item
- Unnamed Item
- Redundancy in mathematical programming. A state-of-the-art survey
- Representability in mixed integer programming. I: Characterization results
- Modelling with integer variables
- Experimental Results on the New Techniques for Integer Programming Formulations
- Multicommodity Distribution System Design by Benders Decomposition
- Analysis of mathematical programming problems prior to applying the simplex algorithm
- The reformulation of two mixed integer programming problems
- Contributions to the Theory of Optimal Control. A General Procedure for the Computation of Switching Manifolds
This page was built for publication: Constructing integer programming models by the predicate calculus