Modelling with integer variables
From MaRDI portal
Recommendations
Cited in
(67)- Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints
- Characterizations of mixed binary convex quadratic representable sets
- On the Mixed Binary Representability of Ellipsoidal Regions
- Piecewise linear trees as surrogate models for system design and planning under high-frequency temporal variability
- Tight mixed-integer optimization formulations for prescriptive trees
- Global optimization of disjunctive programs
- Discrete and continuous-time formulations for dealing with break periods: preemptive and non-preemptive scheduling
- Two mixed integer programming formulations arising in manufacturing management
- Between steps: intermediate relaxations between big-M and convex hull formulations
- Normalized multiparametric disaggregation: an efficient relaxation for mixed-integer bilinear problems
- Representability in mixed integer programming. I: Characterization results
- Strong mixed-integer formulations for the floor layout problem
- On integer and MPCC representability of affine sparsity
- Cardinality minimization, constraints, and regularization: a survey
- On piecewise linear approximations of bilinear terms: structural comparison of univariate and bivariate mixed-integer programming formulations
- scientific article; zbMATH DE number 7015150 (Why is no real title available?)
- scientific article; zbMATH DE number 7015237 (Why is no real title available?)
- An exact algorithmic framework for a class of mixed-integer programs with equilibrium constraints
- Modeling the shelter site location problem using chance constraints: a case study for Istanbul
- Mixed-integer linear representability, disjunctions, and Chvátal functions -- modeling implications
- An adaptive neighborhood search metaheuristic for the integrated railway rapid transit network design and line planning problem
- Piecewise polyhedral formulations for a multilinear term
- Constructive characterizations of the value-function of a mixed-integer program. I
- Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
- COMPARISON BETWEEN FIVE MINLP SOLVERS AND NEW RESULTS RELATED TO TRIGONOMETRIC FUNCTIONS
- MIP relaxations in factorable programming
- A combinatorial approach for small and strong formulations of disjunctive constraints
- Representability of functions
- Valid inequalities for concave piecewise linear regression
- Solving propositional satisfiability problems
- Incremental and encoding formulations for mixed integer programming
- Ideal, non-extended formulations for disjunctive constraints admitting a network representation
- Compact normal forms in propositional logic and integer programming formulations
- Mixed-integer linear methods for layout-optimization of screening systems in recovered paper production
- Modelling either-or relations in integer programming
- On the Derivation of Continuous Piecewise Linear Approximating Functions
- Some results and experiments in programming techniques for propositional logic
- A geometric way to build strong mixed-integer programming formulations
- A simplification for some disjunctive formulations
- A reformulation framework for global optimization
- Mixed integer linear programming formulation techniques
- Staircase compatibility and its applications in scheduling and piecewise linearization
- An effective logarithmic formulation for piecewise linearization requiring no inequality constraint
- A hierarchy of relaxations for linear generalized disjunctive programming
- A diving heuristic for mixed-integer problems with unbounded semi-continuous variables
- Mixed-integer convex representability
- An algorithm for disjunctive programs
- Using separation algorithms to generate mixed integer model reformulations
- Structural investigation of piecewise linearized network flow problems
- Mixed logical-linear programming
- Solving linear optimization over arithmetic constraint formula
- Optimal facility layout design
- Fitting piecewise linear continuous functions
- Ellipsoidal mixed-integer representability
- Locally ideal formulations for piecewise linear functions with indicator variables
- A pseudopolynomial network flow formulation for exact knapsack separation
- A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems
- Mixed-integer bilevel representability
- Constructing integer programming models by the predicate calculus
- A computational analysis of multidimensional piecewise-linear models with applications to oil production optimization
- Piecewise linear approximation of functions of two variables in MILP models
- Solution methods for a min-max facility location problem with regional customers considering closest Euclidean distances
- Worst-case analysis of clique MIPs
- Modeling combinatorial disjunctive constraints via junction trees
- Shapes and recession cones in mixed-integer convex representability
- Balas formulation for the union of polytopes is optimal
- Strong formulations for mixed integer programming: A survey
This page was built for publication: Modelling with integer variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3217950)
