Mixed integer minimization models for piecewise-linear functions of a single variable
From MaRDI portal
Cites work
Cited in
(17)- Representability in mixed integer programming. I: Characterization results
- A simplification for some disjunctive formulations
- An algebra for piecewise-linear minimax problems
- Integer programming formulation of combinatorial optimization problems
- The value function of a mixed integer program: I
- Two mixed integer programming formulations arising in manufacturing management
- Ellipsoidal mixed-integer representability
- Representability of functions
- A computational analysis of multidimensional piecewise-linear models with applications to oil production optimization
- Mixed integer linear programming formulation techniques
- On the Mixed Binary Representability of Ellipsoidal Regions
- 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
- Branch-and-cut for complementarity-constrained optimization
- Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
- Constructive characterizations of the value-function of a mixed-integer program. I
- A special ordered set approach for optimizing a discontinuous separable piecewise linear function
This page was built for publication: Mixed integer minimization models for piecewise-linear functions of a single variable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1234631)