Generating convex polynomial inequalities for mixed 0-1 programs
From MaRDI portal
Recommendations
- A linearization method for mixed 0--1 polynomial programs
- Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation
- A dynamic inequality generation scheme for polynomial programming
- scientific article; zbMATH DE number 3945887
- scientific article; zbMATH DE number 617915
- On the solution existence to convex polynomial programs and its applications
- Polyhedral approximation in mixed-integer convex optimization
- scientific article; zbMATH DE number 953034
- A new global approach for \(0\)-\(1\) polynomial programs
- On the polynomial mixed 0-1 fractional programming problems
Cited in
(14)- Valid inequalities for mixed 0-1 programs
- Computational approaches for mixed integer optimal control problems with indicator constraints
- A recursive procedure to generate all cuts for 0-1 mixed integer programs
- Valid inequalities and separation for mixed 0-1 constraints with variable upper bounds
- Generating valid linear inequalities for nonlinear programs via sums of squares
- A cutting plane method for risk-constrained traveling salesman problem with random arc costs
- Cuts for mixed 0-1 conic programming
- A dynamic inequality generation scheme for polynomial programming
- Subgradient based outer approximation for mixed integer second order cone programming
- Sequential Pairing of Mixed Integer Inequalities
- Gap inequalities for non-convex mixed-integer quadratic programs
- Mathematical Foundations of Computer Science 2005
- An augmented Lagrangian-based method using primitive directions for mixed-integer nonlinear problems
- Conic mixed-integer rounding cuts
This page was built for publication: Generating convex polynomial inequalities for mixed 0-1 programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1810867)
