Integer and mixed-integer programming models: General properties
From MaRDI portal
Publication:1844588
DOI10.1007/BF01262932zbMath0283.90032OpenAlexW2084572427MaRDI QIDQ1844588
Publication date: 1975
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01262932
Related Items
On the Termination of Integer Loops, Representability in mixed integer programming. I: Characterization results, On the Mixed Binary Representability of Ellipsoidal Regions, A simplification for some disjunctive formulations, The piecewise linear optimization polytope: new inequalities and intersection with semi-continuous constraints, The number of additional variables required for the integer programming formulation, The value function of an infinite-horizon single-item lot-sizing problem, Locally ideal formulations for piecewise linear functions with indicator variables, Branch-and-cut for complementarity-constrained optimization, A special ordered set approach for optimizing a discontinuous separable piecewise linear function, Exact augmented Lagrangian duality for mixed integer linear programming, Quadratic cone cutting surfaces for quadratic programs with on-off constraints, Modeling disjunctive constraints with a logarithmic number of binary variables and constraints, Mixed integer minimization models for piecewise-linear functions of a single variable, Representations of unbounded optimization problems as integer programs, Ellipsoidal mixed-integer representability, Mixed Integer Linear Programming Formulation Techniques, Two mixed integer programming formulations arising in manufacturing management, Future paths for integer programming and links to artificial intelligence, Representability of functions, Non-convex nested Benders decomposition, Constructive characterizations of the value-function of a mixed-integer program. I, Stability in disjunctive optimization II:continuity of the feasible and optimal set
Cites Work
