Pages that link to "Item:Q1089258"
From MaRDI portal
The following pages link to Representability in mixed integer programming. I: Characterization results (Q1089258):
Displaying 44 items.
- A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support (Q403644) (← links)
- A hierarchy of relaxations for linear generalized disjunctive programming (Q421708) (← links)
- Comments on ``enhancements on the hyperplanes arrangements in mixed-integer programming techniques'' (Q463016) (← links)
- Modeling disjunctive constraints with a logarithmic number of binary variables and constraints (Q543399) (← links)
- Lift-and-project for mixed 0-1 programming: recent progress (Q697568) (← links)
- Projection, lifting and extended formulation integer and combinatorial optimization (Q817203) (← links)
- Constructing integer programming models by the predicate calculus (Q918417) (← links)
- Modelling either-or relations in integer programming (Q1026568) (← links)
- Constructive characterizations of the value function of a mixed-integer program. II (Q1062914) (← links)
- Two mixed integer programming formulations arising in manufacturing management (Q1262212) (← links)
- Logic cuts for processing networks with fixed charges (Q1317071) (← links)
- Logic cuts for multilevel generalized assignment problems. (Q1406973) (← links)
- Formulating logical implications in combinatorial optimisation (Q1598766) (← links)
- Branch-and-cut for linear programs with overlapping SOS1 constraints (Q1646682) (← links)
- A note on representations of linear inequalities in non-convex mixed-integer quadratic programs (Q1728372) (← links)
- An enhanced logarithmic method for signomial programming with discrete variables (Q1752141) (← links)
- Logical constraints as cardinality rules: Tight representation (Q1768603) (← links)
- Ellipsoidal mixed-integer representability (Q1801008) (← links)
- Representability of functions (Q1825755) (← links)
- A closed-form representation of mixed-integer program value functions (Q1914070) (← links)
- Mixed logical-linear programming (Q1961464) (← links)
- Combining leximax fairness and efficiency in a mathematical programming model (Q2077983) (← links)
- Nonlinear chance-constrained problems with applications to hydro scheduling (Q2118083) (← links)
- A computationally useful algebraic representation of nonlinear disjunctive convex sets using the perspective function (Q2181606) (← links)
- Mathematical programming formulations for piecewise polynomial functions (Q2182855) (← links)
- Mixed-integer bilevel representability (Q2220657) (← links)
- Optimality conditions for disjunctive optimization in reflexive Banach spaces (Q2260683) (← links)
- Enhanced linear reformulation for engineering optimization models with discrete and bounded continuous variables (Q2295318) (← links)
- On the structure of linear programs with overlapping cardinality constraints (Q2297664) (← links)
- Characterizations of mixed binary convex quadratic representable sets (Q2316624) (← links)
- Single-facility scheduling by logic-based Benders decomposition (Q2442086) (← links)
- Optimality conditions for disjunctive programs with application to mathematical programs with equilibrium constraints (Q2642976) (← links)
- On piecewise linear approximations of bilinear terms: structural comparison of univariate and bivariate mixed-integer programming formulations (Q2694515) (← links)
- Mixed integer linear programming formulation techniques (Q2808240) (← links)
- Finite Disjunctive Programming Characterizations for General Mixed-Integer Linear Programs (Q3013929) (← links)
- On the Mixed Binary Representability of Ellipsoidal Regions (Q3186504) (← links)
- Modelling with integer variables (Q3217950) (← links)
- Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints (Q3503848) (← links)
- New verifiable stationarity concepts for a class of mathematical programs with disjunctive constraints (Q4639115) (← links)
- Mixed-Integer Convex Representability (Q5076722) (← links)
- MIP* = RE (Q5871067) (← links)
- Shapes and recession cones in mixed-integer convex representability (Q6120855) (← links)
- A solution algorithm for chance-constrained problems with integer second-stage recourse decisions (Q6126651) (← links)
- Convex mixed-integer nonlinear programs derived from generalized disjunctive programming using cones (Q6498414) (← links)
