The following pages link to Modelling with integer variables (Q3217950):
Displaying 50 items.
- Normalized multiparametric disaggregation: an efficient relaxation for mixed-integer bilinear problems (Q280099) (← links)
- A reformulation framework for global optimization (Q367160) (← links)
- 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)
- An adaptive neighborhood search metaheuristic for the integrated railway rapid transit network design and line planning problem (Q1652047) (← links)
- Staircase compatibility and its applications in scheduling and piecewise linearization (Q1662653) (← links)
- Solving linear optimization over arithmetic constraint formula (Q1675635) (← links)
- Global optimization of disjunctive programs (Q1679482) (← links)
- Modeling the shelter site location problem using chance constraints: a case study for Istanbul (Q1754735) (← links)
- Ellipsoidal mixed-integer representability (Q1801008) (← links)
- Representability of functions (Q1825755) (← links)
- Mixed logical-linear programming (Q1961464) (← links)
- Discrete and continuous-time formulations for dealing with break periods: preemptive and non-preemptive scheduling (Q1999390) (← links)
- An effective logarithmic formulation for piecewise linearization requiring no inequality constraint (Q2044490) (← links)
- Worst-case analysis of clique MIPs (Q2089781) (← links)
- Between steps: intermediate relaxations between big-M and convex hull formulations (Q2117230) (← links)
- Ideal, non-extended formulations for disjunctive constraints admitting a network representation (Q2149570) (← links)
- Mixed-integer bilevel representability (Q2220657) (← links)
- A computational analysis of multidimensional piecewise-linear models with applications to oil production optimization (Q2255987) (← links)
- Piecewise linear approximation of functions of two variables in MILP models (Q2270322) (← links)
- Valid inequalities for concave piecewise linear regression (Q2294266) (← links)
- A geometric way to build strong mixed-integer programming formulations (Q2294389) (← links)
- Balas formulation for the union of polytopes is optimal (Q2297650) (← links)
- Solution methods for a min-max facility location problem with regional customers considering closest Euclidean distances (Q2301150) (← links)
- Characterizations of mixed binary convex quadratic representable sets (Q2316624) (← links)
- Mixed-integer linear methods for layout-optimization of screening systems in recovered paper production (Q2357214) (← links)
- Locally ideal formulations for piecewise linear functions with indicator variables (Q2450745) (← links)
- Incremental and encoding formulations for mixed integer programming (Q2450751) (← links)
- Piecewise polyhedral formulations for a multilinear term (Q2661606) (← links)
- On piecewise linear approximations of bilinear terms: structural comparison of univariate and bivariate mixed-integer programming formulations (Q2694515) (← links)
- Mixed Integer Linear Programming Formulation Techniques (Q2808240) (← links)
- Structural Investigation of Piecewise Linearized Network Flow Problems (Q2954170) (← links)
- On the Mixed Binary Representability of Ellipsoidal Regions (Q3186504) (← links)
- On the Derivation of Continuous Piecewise Linear Approximating Functions (Q3386781) (← links)
- Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints (Q3503848) (← links)
