Representability of functions
From MaRDI portal
Publication:1825755
DOI10.1016/0166-218X(89)90023-1zbMath0684.90066OpenAlexW2078053321WikidataQ126382764 ScholiaQ126382764MaRDI QIDQ1825755
Publication date: 1989
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(89)90023-1
Related Items
Representability in mixed integer programming. I: Characterization results, Mathematical programming formulations for piecewise polynomial functions, On piecewise linear approximations of bilinear terms: structural comparison of univariate and bivariate mixed-integer programming formulations, Modeling disjunctive constraints with a logarithmic number of binary variables and constraints, Mixed Integer Linear Programming Formulation Techniques
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Representability in mixed integer programming. I: Characterization results
- Mixed integer minimization models for piecewise-linear functions of a single variable
- Integer programming formulation of combinatorial optimization problems
- Representations of unbounded optimization problems as integer programs
- Disjunctive programming: Properties of the convex hull of feasible points
- Integer and mixed-integer programming models: General properties
- Modelling with integer variables
- Experimental Results on the New Techniques for Integer Programming Formulations
- Rational Mixed-Integer and Polyhedral Union Minimization Models
- A theoretical and computational comparison of “equivalent” mixed-integer formulations
- On the existence of optimal solutions to integer and mixed-integer programming problems
- New results on equivalent integer programming formulations
- Polyhedral annexation in mixed integer and combinatorial programming
- Branch and Bound Methods for Mathematical Programming Systems
- Disjunctive Programming
- ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS
- Discrete-Variable Extremum Problems
- Hypercylindrically Deduced Cuts in Zero-One Integer Programs
