Experimental Results on the New Techniques for Integer Programming Formulations
From MaRDI portal
Publication:3680609
DOI10.2307/2582879zbMath0565.90047OpenAlexW4235100476MaRDI QIDQ3680609
Robert G. Jeroslow, James K. Lowe
Publication date: 1985
Published in: The Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2582879
Numerical mathematical programming methods (65K05) Integer programming (90C10) Mixed integer programming (90C11)
Related Items (16)
Representability in mixed integer programming. I: Characterization results ⋮ A simplification for some disjunctive formulations ⋮ A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems ⋮ 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 ⋮ Constructing integer programming models by the predicate calculus ⋮ Generating cuts in integer programming with families of special ordered sets ⋮ 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 ⋮ Mixed Integer Linear Programming Formulation Techniques ⋮ Two mixed integer programming formulations arising in manufacturing management ⋮ Modelling either-or relations in integer programming ⋮ Future paths for integer programming and links to artificial intelligence ⋮ Representability of functions ⋮ Optimal facility layout design ⋮ Inference flexibility in Horn clause knowledge bases and the simplex method
This page was built for publication: Experimental Results on the New Techniques for Integer Programming Formulations
