Modelling with integer variables

DOI10.1007/BFb0121015zbMath0554.90081OpenAlexW2027627501MaRDI QIDQ3217950

Robert G. Jeroslow, James K. Lowe

Publication date: 1984

Published in: Mathematical Programming Studies (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bfb0121015

zbMATH Keywords

modellinglinear relaxationsbranch-and-bound treesbounded MIP-representationunion of representable sets

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Mixed integer programming (90C11)

Related Items

COMPARISON BETWEEN FIVE MINLP SOLVERS AND NEW RESULTS RELATED TO TRIGONOMETRIC FUNCTIONS, Strong mixed-integer formulations for the floor layout problem, Normalized multiparametric disaggregation: an efficient relaxation for mixed-integer bilinear problems, Representability in mixed integer programming. I: Characterization results, Some results and experiments in programming techniques for propositional logic, Ideal, non-extended formulations for disjunctive constraints admitting a network representation, Solving propositional satisfiability problems, On the Mixed Binary Representability of Ellipsoidal Regions, A simplification for some disjunctive formulations, An adaptive neighborhood search metaheuristic for the integrated railway rapid transit network design and line planning problem, Mixed-Integer Convex Representability, Staircase compatibility and its applications in scheduling and piecewise linearization, A reformulation framework for global optimization, Strong formulations for mixed integer programming: A survey, Piecewise polyhedral formulations for a multilinear term, A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems, A pseudopolynomial network flow formulation for exact knapsack separation, Solving linear optimization over arithmetic constraint formula, Global optimization of disjunctive programs, Structural Investigation of Piecewise Linearized Network Flow Problems, Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints, A Combinatorial Approach for Small and Strong Formulations of Disjunctive Constraints, Mixed-Integer Linear Representability, Disjunctions, and Chvátal Functions—Modeling Implications, Modeling combinatorial disjunctive constraints via junction trees, Shapes and recession cones in mixed-integer convex representability, A hierarchy of relaxations for linear generalized disjunctive programming, On piecewise linear approximations of bilinear terms: structural comparison of univariate and bivariate mixed-integer programming formulations, Compact normal forms in propositional logic and integer programming formulations, Fitting piecewise linear continuous functions, Constructing integer programming models by the predicate calculus, Mixed logical-linear programming, Mixed-integer bilevel representability, Locally ideal formulations for piecewise linear functions with indicator variables, Incremental and encoding formulations for mixed integer programming, An algorithm for disjunctive programs, Using separation algorithms to generate mixed integer model reformulations, 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, Discrete and continuous-time formulations for dealing with break periods: preemptive and non-preemptive scheduling, A computational analysis of multidimensional piecewise-linear models with applications to oil production optimization, Modeling disjunctive constraints with a logarithmic number of binary variables and constraints, Piecewise linear approximation of functions of two variables in MILP models, Ellipsoidal mixed-integer representability, Valid inequalities for concave piecewise linear regression, A geometric way to build strong mixed-integer programming formulations, Mixed Integer Linear Programming Formulation Techniques, An effective logarithmic formulation for piecewise linearization requiring no inequality constraint, Strong mixed-integer programming formulations for trained neural networks, Balas formulation for the union of polytopes is optimal, Two mixed integer programming formulations arising in manufacturing management, Solution methods for a min-max facility location problem with regional customers considering closest Euclidean distances, On the Derivation of Continuous Piecewise Linear Approximating Functions, Modelling either-or relations in integer programming, Characterizations of mixed binary convex quadratic representable sets, Representability of functions, Worst-case analysis of clique MIPs, Optimal facility layout design, Constructive characterizations of the value-function of a mixed-integer program. I, Between steps: intermediate relaxations between big-M and convex hull formulations, Mixed-integer linear methods for layout-optimization of screening systems in recovered paper production