A linearization method for mixed 0--1 polynomial programs
From MaRDI portal
Recommendations
Cites work
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- A Linearization Procedure for Quadratic and Cubic Mixed-Integer Problems
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
- An approximate approach of global optimization for polynomial programming problems
- An approximate method for local optima for nonlinear mixed integer programming problems
- Computational study of a family of mixed-integer quadratic programming problems
- Exploiting special structures in constructing a hierarchy of relaxations for \(0-1\) mixed integer problems
- Global Optimization for Mixed 0-1 Programs with Convex or Separable Continuous Functions
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems
- Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
- Solving Mixed Integer Programming Problems Using Automatic Reformulation
- Solving zero-one mixed integer programming problems using tabu search
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
Cited in
(31)- Generating convex polynomial inequalities for mixed 0-1 programs
- Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs
- Weber problems with mixed distances and regional demand
- Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem
- An alternative efficient representation for the project portfolio selection problem
- A fuzzy-budgeted robust optimization model for joint network design-pricing problem in a forward-reverse supply chain: the viewpoint of third-party logistics
- A polytope for a product of real linear functions in 0/1 variables
- A simple recipe for concise mixed 0-1 linearizations
- A class of polynomially solvable 0-1 programming problems and an application
- Mixed 0-1 Linear Programs Under Objective Uncertainty: A Completely Positive Representation
- An efficient linearization technique for mixed 0-1 polynomial problem
- Optimal procurement decisions in the presence of total quantity discounts and alternative product recipes
- A novel model for the time dependent competitive vehicle routing problem: modified random topology particle swarm optimization
- A new global approach for \(0\)-\(1\) polynomial programs
- Continuous solution method for 0-1 programming based on the sinusoidal smooth polish function
- A conditional logic approach for strengthening mixed 0-1 linear programs
- ``Miniaturized linearizations for quadratic 0/1 problems
- Mixed integer programming for the 0--1 maximum probability model.
- Concise RLT forms of binary programs: a computational study of the quadratic knapsack problem
- Health service network design: a robust possibilistic approach
- Linear forms of nonlinear expressions: new insights on old ideas
- A unified model for Weber problems with continuous and network distances
- On the polynomial mixed 0-1 fractional programming problems
- Optimization approach for data allocation in multidisk database
- Global Optimization for Mixed 0-1 Programs with Convex or Separable Continuous Functions
- Linear reformulation of polynomial discrete programming for fast computation
- A linearized value-at-risk model with transaction costs and short selling
- Selective capacitated location-routing problem with incentive-dependent returns in designing used products collection network
- Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems
- A new multi-objective competitive open vehicle routing problem solved by particle swarm optimization
- A global approach for general \(0-1\) fractional programming
This page was built for publication: A linearization method for mixed 0--1 polynomial programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1577382)
