Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems
From MaRDI portal
Publication:5202509
DOI10.1287/opre.38.2.217zbMath0724.90046OpenAlexW2034432217MaRDI QIDQ5202509
Warren P. Adams, Hanif D. Sherali
Publication date: 1990
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.38.2.217
Integer programming (90C10) Mixed integer programming (90C11) Nonlinear programming (90C30) Quadratic programming (90C20) Boolean programming (90C09)
Related Items
Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches, Optimal procurement decisions in the presence of total quantity discounts and alternative product recipes, A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems, Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems, SOCP relaxation bounds for the optimal subset selection problem applied to robust linear regression, Lower bounding procedure for the asymmetric quadratic traveling salesman problem, Speeding up IP-based algorithms for constrained quadratic 0-1 optimization, The quadratic three-dimensional assignment problem: exact and approximate solution methods, A survey for the quadratic assignment problem, Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs, Lower bounds for the quadratic minimum spanning tree problem based on reduced cost computation, A level-2 reformulation-linearization technique bound for the quadratic assignment problem, The quadratic cycle cover problem: special cases and efficient bounds, Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2, The multi-story space assignment problem, 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 products, Characterizing linearizable QAPs by the level-1 reformulation-linearization technique, A novel clustering approach and prediction of optimal number of clusters: global optimum search with enhanced positioning, An LP-based characterization of solvable QAP instances with chess-board and graded structures, Shortest Paths in Graphs of Convex Sets, On linearization techniques for budget-constrained binary quadratic programming problems, Exact solution of emerging quadratic assignment problems, A network approach for specially structured linear programs arising in 0-1 quadratic optimization, An exact solution method for quadratic matching: the one-quadratic-term technique and generalisations, Mixed-integer bilinear programming problems, Global optimization of general nonconvex problems with intermediate polynomial substructures, RLT: A unified approach for discrete and continuous nonconvex optimization, RLT insights into lift-and-project closures, Selected topics on assignment problems, A new linearization technique for multi-quadratic 0-1 programming problems., Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique, Global optimization of general non-convex problems with intermediate bilinear substructures, Perspectives on modeling hub location problems, An algorithm for the generalized quadratic assignment problem, A linear formulation with \(O(n^2)\) variables for quadratic assignment problems with Manhattan distance matrices, A Level-3 Reformulation-Linearization Technique-Based Bound for the Quadratic Assignment Problem, Lower and upper bounds for linear production games, The linearization problem of a binary quadratic problem and its applications, Reliable hub-and-spoke systems with multiple capacity levels and flow dependent discount factor, A linearization method for mixed 0--1 polynomial programs, Linear programming insights into solvable cases of the quadratic assignment problem, A revised reformulation-linearization technique for the quadratic assignment problem, A new global approach for \(0\)-\(1\) polynomial programs, Univariate parameterization for global optimization of mixed-integer polynomial problems, Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods, A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems, Approximated perspective relaxations: a project and lift approach
