The following pages link to Modelling with integer variables (Q3217950):
Displayed 22 items.
- A hierarchy of relaxations for linear generalized disjunctive programming (Q421708) (← links)
- Fitting piecewise linear continuous functions (Q439615) (← links)
- Modeling disjunctive constraints with a logarithmic number of binary variables and constraints (Q543399) (← links)
- Constructive characterizations of the value-function of a mixed-integer program. I (Q798260) (← links)
- Compact normal forms in propositional logic and integer programming formulations (Q910335) (← links)
- Constructing integer programming models by the predicate calculus (Q918417) (← links)
- Modelling either-or relations in integer programming (Q1026568) (← links)
- Representability in mixed integer programming. I: Characterization results (Q1089258) (← links)
- Some results and experiments in programming techniques for propositional logic (Q1100931) (← links)
- A simplification for some disjunctive formulations (Q1104856) (← links)
- Strong formulations for mixed integer programming: A survey (Q1121789) (← links)
- A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems (Q1122488) (← links)
- An algorithm for disjunctive programs (Q1173796) (← links)
- Using separation algorithms to generate mixed integer model reformulations (Q1178714) (← links)
- Two mixed integer programming formulations arising in manufacturing management (Q1262212) (← links)
- Optimal facility layout design (Q1306388) (← links)
- Solving propositional satisfiability problems (Q1356218) (← links)
- Representability of functions (Q1825755) (← links)
- Mixed logical-linear programming (Q1961464) (← links)
- Piecewise linear approximation of functions of two variables in MILP models (Q2270322) (← links)
- Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints (Q3503848) (← links)
- A pseudopolynomial network flow formulation for exact knapsack separation (Q4014772) (← links)