Integer and mixed-integer programming models: General properties

DOI10.1007/BF01262932MaRDI QIDQ1844588zbMATH OpenOpenAlexFDO

Authors 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

Mathematics Subject Classification ID

Integer programming (90C10)

Cites work

• scientific article; zbMATH DE number 3314878 (Why is no real title available?)
• scientific article; zbMATH DE number 3410784 (Why is no real title available?)
• On the continuity of the minimum set of a continuous function

Cited in

(24)

• Ellipsoidal mixed-integer representability
• On the termination of integer loops
• Representability in mixed integer programming. I: Characterization results
• The value function of an infinite-horizon single-item lot-sizing problem
• Quadratic cone cutting surfaces for quadratic programs with on-off constraints
• Mixed integer minimization models for piecewise-linear functions of a single variable
• Two mixed integer programming formulations arising in manufacturing management
• The number of additional variables required for the integer programming formulation
• A special ordered set approach for optimizing a discontinuous separable piecewise linear function
• The piecewise linear optimization polytope: new inequalities and intersection with semi-continuous constraints
• Stability in disjunctive optimization II:continuity of the feasible and optimal set
• Exact augmented Lagrangian duality for mixed integer convex optimization
• Representability of functions
• Constructive characterizations of the value-function of a mixed-integer program. I
• Mixed integer linear programming formulation techniques
• Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
• Branch-and-cut for complementarity-constrained optimization
• A simplification for some disjunctive formulations
• Non-convex nested Benders decomposition
• Exact augmented Lagrangian duality for mixed integer linear programming
• On the Mixed Binary Representability of Ellipsoidal Regions
• Future paths for integer programming and links to artificial intelligence
• Representations of unbounded optimization problems as integer programs
• Locally ideal formulations for piecewise linear functions with indicator variables

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1844588)