Integer and mixed-integer programming models: General properties

From MaRDI portal
Revision as of 10:46, 1 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1844588

DOI10.1007/BF01262932zbMath0283.90032OpenAlexW2084572427MaRDI QIDQ1844588

Robert R. Meyer

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 (23)

On the Termination of Integer LoopsRepresentability in mixed integer programming. I: Characterization resultsOn the Mixed Binary Representability of Ellipsoidal RegionsA simplification for some disjunctive formulationsThe piecewise linear optimization polytope: new inequalities and intersection with semi-continuous constraintsThe number of additional variables required for the integer programming formulationThe value function of an infinite-horizon single-item lot-sizing problemLocally ideal formulations for piecewise linear functions with indicator variablesBranch-and-cut for complementarity-constrained optimizationA special ordered set approach for optimizing a discontinuous separable piecewise linear functionExact augmented Lagrangian duality for mixed integer linear programmingQuadratic cone cutting surfaces for quadratic programs with on-off constraintsModeling disjunctive constraints with a logarithmic number of binary variables and constraintsMixed integer minimization models for piecewise-linear functions of a single variableRepresentations of unbounded optimization problems as integer programsEllipsoidal mixed-integer representabilityMixed Integer Linear Programming Formulation TechniquesTwo mixed integer programming formulations arising in manufacturing managementFuture paths for integer programming and links to artificial intelligenceRepresentability of functionsNon-convex nested Benders decompositionConstructive characterizations of the value-function of a mixed-integer program. IStability in disjunctive optimization II:continuity of the feasible and optimal set




Cites Work




This page was built for publication: Integer and mixed-integer programming models: General properties