Further Reduction of Zero-One Polynomial Programming Problems to Zero-One linear Programming Problems
From MaRDI portal
Cited in
(41)- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
- Reformulating nonlinear combinatorial optimization problems for higher computational efficiency
- An algorithm for the quadratic assignment problem using Benders' decomposition
- On cell size and machine requirements planning in group technology systems
- Configuration of manufacturing software through capability specification and selection
- A branch and bound algorithm for solving separable convex integer programming problems
- Matroid optimisation problems with nested non-linear monomials in the objective function
- On linearization techniques for budget-constrained binary quadratic programming problems
- Compact linearization for binary quadratic problems subject to assignment constraints
- A class of valid inequalities for multilinear 0-1 optimization problems
- Polynomial transformations and data-independent neighborhood functions
- Global solution of nonlinear mixed-integer bilevel programs
- Berge-acyclic multilinear 0-1 optimization problems
- Matroid optimization problems with monotone monomials in the objective
- Structured linear reformulation of binary quadratically constrained quadratic programs
- Theoretical and computational study of several linearisation techniques for binary quadratic problems
- Univariate parameterization for global optimization of mixed-integer polynomial problems
- An improved linearization strategy for zero-one quadratic programming problems
- An algorithm for indefinite integer quadratic programming
- Ellipsoid bounds for convex quadratic integer programming
- Integrated design of cellular manufacturing systems in the presence of alternative process plans
- On the Quadratic Programming Approach for Hub Location Problems
- Reduction of nonlinear integer separable programming problems∗
- Mixed-integer quadratic programming
- An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach
- An enhanced formulation and simple heuristic for scheduling jobs on unrelated parallel machines
- The indefinite zero-one quadratic problem
- Inductive linearization for binary quadratic programs with linear constraints
- Solving unconstrained binary polynomial programs with limited reach: application to low autocorrelation binary sequences
- A proactive aircraft recovery approach based on airport spatiotemporal network supply and demand coordination
- Revisiting some classical linearizations of the quadratic binary optimization problem and linkages with constraint aggregations
- Mixed-integer bilinear programming problems
- Quadratization and convexification in polynomial binary optimization
- An improved linearization technique for a class of quadratic 0-1 programming problems
- The quadratic knapsack problem
- Pseudo-Boolean optimization
- A new linearization technique for multi-quadratic 0-1 programming problems.
- A continuous nonlinear optimization perspective on the spin glass problem
- A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems
- Modeling and integer programming techniques applied to propositional calculus
- Multiple objective decision making approach to cell formation: A goal programming model
This page was built for publication: Further Reduction of Zero-One Polynomial Programming Problems to Zero-One linear Programming Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5677289)
