Integer and mixed-integer programming models: General properties
From MaRDI portal
Publication:1844588
DOI10.1007/BF01262932zbMATH Open0283.90032OpenAlexW2084572427MaRDI QIDQ1844588FDOQ1844588
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
Cites Work
Cited In (24)
- A special ordered set approach for optimizing a discontinuous separable piecewise linear function
- Non-convex nested Benders decomposition
- Representations of unbounded optimization problems as integer programs
- Mixed integer minimization models for piecewise-linear functions of a single variable
- Two mixed integer programming formulations arising in manufacturing management
- Representability in mixed integer programming. I: Characterization results
- Stability in disjunctive optimization II:continuity of the feasible and optimal set
- Future paths for integer programming and links to artificial intelligence
- The value function of an infinite-horizon single-item lot-sizing problem
- Constructive characterizations of the value-function of a mixed-integer program. I
- Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
- The number of additional variables required for the integer programming formulation
- Representability of functions
- On the termination of integer loops
- Quadratic cone cutting surfaces for quadratic programs with on-off constraints
- Mixed integer linear programming formulation techniques
- A simplification for some disjunctive formulations
- Branch-and-cut for complementarity-constrained optimization
- Locally ideal formulations for piecewise linear functions with indicator variables
- Ellipsoidal mixed-integer representability
- Exact augmented Lagrangian duality for mixed integer linear programming
- Exact augmented Lagrangian duality for mixed integer convex optimization
- The piecewise linear optimization polytope: new inequalities and intersection with semi-continuous constraints
- On the Mixed Binary Representability of Ellipsoidal Regions
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)