Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems
From MaRDI portal
Recommendations
- A linearization method for mixed 0--1 polynomial programs
- An efficient linearization approach for mixed-integer problems
- An improved linearization strategy for zero-one quadratic programming problems
- Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs
- Linearization-based algorithms for mixed-integer nonlinear programs with convex continuous relaxation
- The multiparametric 0-1-integer linear programming problem: A unified approach
- Nonlinear 0–1 programming: I. Linearization techniques
- scientific article; zbMATH DE number 3296914
- Mixed zero-one linear programming and optimal control problem
- Parametric mixed-integer 0-1 linear programming: The general case for a single parameter
Cited in
(59)- RLT insights into lift-and-project closures
- Approximated perspective relaxations: a project and lift approach
- RLT: A unified approach for discrete and continuous nonconvex optimization
- An improved linearization strategy for zero-one quadratic programming problems
- A novel clustering approach and prediction of optimal number of clusters: global optimum search with enhanced positioning
- The linearization problem of a binary quadratic problem and its applications
- Mixed-integer bilinear programming problems
- Selected topics on assignment problems
- Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2
- Enabling research through the SCIP Optimization Suite 8.0
- Speeding up IP-based algorithms for constrained quadratic 0-1 optimization
- A new linearization technique for multi-quadratic 0-1 programming problems.
- Linear programming insights into solvable cases of the quadratic assignment problem
- Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems
- An LP-based characterization of solvable QAP instances with chess-board and graded structures
- Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods
- A survey for the quadratic assignment problem
- A linearization method for mixed 0--1 polynomial programs
- Multi-objective mathematical programming for optimally sizing and managing battery energy storage for solar photovoltaic system integration of a multi-apartment building
- Efficient separation of RLT cuts for implicit and explicit bilinear terms
- Global optimization of mixed-integer nonlinear programs with SCIP 8
- The multi-story space assignment problem
- An exact solution method for quadratic matching: the one-quadratic-term technique and generalisations
- SOCP relaxation bounds for the optimal subset selection problem applied to robust linear regression
- A level-2 reformulation-linearization technique bound for the quadratic assignment problem
- An algorithm for the generalized quadratic assignment problem
- Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique
- LP-based approximations for disjoint bilinear and two-stage adjustable robust optimization
- Lower bounding procedure for the asymmetric quadratic traveling salesman problem
- Lower bounds for the quadratic minimum spanning tree problem based on reduced cost computation
- Adjustable robust positive influence dominating set with partial payment
- A new global approach for \(0\)-\(1\) polynomial programs
- An efficient linearization approach for mixed-integer problems
- Shortest Paths in Graphs of Convex Sets
- A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
- Lower and upper bounds for linear production games
- Short paper -- The binary linearization complexity of pseudo-Boolean functions
- Global optimization of general non-convex problems with intermediate bilinear substructures
- A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems
- Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs
- Efficient separation of RLT cuts for implicit and explicit bilinear products
- Optimal procurement decisions in the presence of total quantity discounts and alternative product recipes
- Univariate parameterization for global optimization of mixed-integer polynomial problems
- Lagrangian dual for integer optimization with zero duality gap that admits decomposition
- Exact solution of emerging quadratic assignment problems
- A linear formulation with \(O(n^2)\) variables for quadratic assignment problems with Manhattan distance matrices
- Linear forms of nonlinear expressions: new insights on old ideas
- The quadratic three-dimensional assignment problem: exact and approximate solution methods
- The quadratic cycle cover problem: special cases and efficient bounds
- Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches
- Reliable hub-and-spoke systems with multiple capacity levels and flow dependent discount factor
- A level-3 reformulation-linearization technique-based bound for the quadratic assignment problem
- On linearization techniques for budget-constrained binary quadratic programming problems
- A network approach for specially structured linear programs arising in 0-1 quadratic optimization
- Global optimization of general nonconvex problems with intermediate polynomial substructures
- A conditional logic approach for strengthening mixed 0-1 linear programs
- Perspectives on modeling hub location problems
- Characterizing linearizable QAPs by the level-1 reformulation-linearization technique
- A revised reformulation-linearization technique for the quadratic assignment problem
This page was built for publication: Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5202509)
