A reformulation-linearization technique for solving discrete and continuous nonconvex problems
From MaRDI portal
Publication:1280199
zbMath0926.90078MaRDI QIDQ1280199
Warren P. Adams, Hanif D. Sherali
Publication date: 11 March 1999
Published in: Nonconvex Optimization and Its Applications (Search for Journal in Brave)
branch-and-boundbilinear programmingvalid inequalitiesfacetsnonconvex polynomial programmingrelaxation for discrete and continuous nonconvex programming problemssquared-Euclidean distance location-allocation
Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Boolean programming (90C09) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
On Generalized Surrogate Duality in Mixed-Integer Nonlinear Programming, A disjunctive cut strengthening technique for convex MINLP, The effect of strengthened linear formulations on improving the lower bounds for the part families with precedence constraints problem, On the numerical solution of the quadratic eigenvalue complementarity problem, Probabilistic logic with independence, Convexification of Queueing Formulas by Mixed-Integer Second-Order Cone Programming: An Application to a Discrete Location Problem with Congestion, The probabilistic travelling salesman problem with crowdsourcing, Computable representations for convex hulls of low-dimensional quadratic forms, Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations, The quadratic three-dimensional assignment problem: exact and approximate solution methods, Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs, On Throughput Maximization Problem for UWB-Based Sensor Networks via Reformulation–Linearization Technique, Uncertainty Preferences in Robust Mixed-Integer Linear Optimization with Endogenous Uncertainty, Strategic bidding in price coupled regions, Large-scale standard pooling problems with constrained pools and fixed demands, Generalized S-lemma and strong duality in nonconvex quadratic programming, A multi-commodity flow formulation for the generalized pooling problem, Strong formulations for the pooling problem, Robust Investment Management with Uncertainty in Fund Managers’ Asset Allocation, On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study, A branch and bound algorithm for quantified quadratic programming, A bounded degree SOS hierarchy for polynomial optimization, Tightening methods based on nontrivial bounds on bilinear terms, On subspace properties of the quadratically constrained quadratic program, Spherical cuts for integer programming problems, Inductive linearization for binary quadratic programs with linear constraints, Recycling inequalities for robust combinatorial optimization with budget uncertainty, Variable Bound Tightening and Valid Constraints for Multiperiod Blending, Enhancing the normalized multiparametric disaggregation technique for mixed-integer quadratic programming, Characterizing linearizable QAPs by the level-1 reformulation-linearization technique, Using Two-Dimensional Projections for Stronger Separation and Propagation of Bilinear Terms, An LP-based characterization of solvable QAP instances with chess-board and graded structures, A conditional-logic interpretation for Miller-Tucker-Zemlin inequalities and extensions, Strengthened SDP relaxation for an extended trust region subproblem with an application to optimal power flow, A reformulation-linearization technique for optimization over simplices, A penalized nonlinear ADMM algorithm applied to the multi-constrained traffic assignment problem, Kronecker Product Constraints with an Application to the Two-Trust-Region Subproblem, Linear programing relaxations for a strategic pricing problem in electricity markets, Overcoming the Key Challenges in De Novo Protein Design: Enhancing Computational Efficiency and Incorporating True Backbone Flexibility, Unbounded convex sets for non-convex mixed-integer quadratic programming, The Convex Hull of a Quadratic Constraint over a Polytope, A compact variant of the QCR method for quadratically constrained quadratic \(0-1\) programs, Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations, Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs, Maximization of a PSD quadratic form and factorization, Extremal problems for convex polygons, Consistency Analysis for Massively Inconsistent Datasets in Bound-to-Bound Data Collaboration, Exact solution of emerging quadratic assignment problems, Spectral Relaxations and Branching Strategies for Global Optimization of Mixed-Integer Quadratic Programs, Unification of lower-bound analyses of the lift-and-project rank of combinatorial optimization polyhedra, A new framework to relax composite functions in nonlinear programs, A branch-and-cut algorithm using polar cuts for solving nonconvex quadratic programming problems, Relax-tighten-round algorithm for optimal placement and control of valves and chlorine boosters in water networks, Combining qualitative information and semi‐quantitative data for guaranteed invalidation of biochemical network models, ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations, RLT insights into lift-and-project closures, On the problem of packing spheres in a cube, Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming, A scalable global optimization algorithm for stochastic nonlinear programs, Second order cone constrained convex relaxations for nonconvex quadratically constrained quadratic programming, On solving discrete two-stage stochastic programs having mixed-integer first- and second-stage variables, Novel formulations for the sequence selection problem in de novo protein design with flexible templates, Source localization using TDOA and FDOA measurements based on semidefinite programming and reformulation linearization, A Two-Variable Approach to the Two-Trust-Region Subproblem, Constraint aggregation for rigorous global optimization, Intersection cuts for nonlinear integer programming: convexification techniques for structured sets, The trust region subproblem with non-intersecting linear constraints, Reformulations in Mathematical Programming: Definitions and Systematics, Mixed Integer Linear Programming Formulation Techniques, An efficient global algorithm for worst-case linear optimization under uncertainties based on nonlinear semidefinite relaxation, Quadratic optimization with switching variables: the convex hull for \(n=2\), Convexification techniques for linear complementarity constraints, Convex hull representations for bounded products of variables, On new methods to construct lower bounds in simplicial branch and bound based on interval arithmetic, Computing in combinatorial optimization, Convergence rates of RLT and Lasserre-type hierarchies for the generalized moment problem over the simplex and the sphere, Properties, extensions and application of piecewise linearization for Euclidean norm optimization in \(\mathbb{R}^2\), Computational comparison studies of quadratic assignment like formulations for the in silico sequence selection problem in De Novo protein design, Accelerating branch-and-bound through a modeling language construct for relaxation-specific constraints, Robust solution of nonconvex global optimization problems, Linear programming insights into solvable cases of the quadratic assignment problem, SDP-quality bounds via convex quadratic relaxations for global optimization of mixed-integer quadratic programs, Probability estimation via policy restrictions, convexification, and approximate sampling, On sample average approximation for two-stage stochastic programs without relatively complete recourse, Univariate parameterization for global optimization of mixed-integer polynomial problems, A binary decision diagram based algorithm for solving a class of binary two-stage stochastic programs, On generalized surrogate duality in mixed-integer nonlinear programming, A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation, An accelerating algorithm for globally solving nonconvex quadratic programming, A strong conic quadratic reformulation for machine-job assignment with controllable processing times, How to select a small set of diverse solutions to mixed integer programming problems, A simple recipe for concise mixed 0-1 linearizations, Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems, Duality for mixed-integer convex minimization, A review of recent advances in global optimization, Lifting inequalities: a framework for generating strong cuts for nonlinear programs, Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, Matroid optimisation problems with nested non-linear monomials in the objective function, A survey for the quadratic assignment problem, Optimization of a quadratic function with a circulant matrix, Binary extended formulations of polyhedral mixed-integer sets, Beam search heuristics for the single and multi-commodity capacitated multi-facility Weber problems, Generating cutting planes for the semidefinite relaxation of quadratic programs, An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms, RLT-POS: reformulation-linearization technique-based optimization software for solving polynomial programming problems, Constrained optimization with integer and continuous variables using inexact restoration and projected gradients, On linear programming relaxations for solving polynomial programming problems, A level-2 reformulation-linearization technique bound for the quadratic assignment problem, GLOMIQO: global mixed-integer quadratic optimizer, Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness, Semidefinite relaxations for non-convex quadratic mixed-integer programming, Chebyshev model arithmetic for factorable functions, Fractional 0-1 programming: applications and algorithms, Computing lower and upper expectations under epistemic independence, Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations, On convex relaxations for quadratically constrained quadratic programming, Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality, A piecewise linearization framework for retail shelf space management models, The multi-story space assignment problem, An efficient linearization technique for mixed 0-1 polynomial problem, A framework for globally optimizing mixed-integer signomial programs, A generalization of the classical \(\alpha \)BB convex underestimation via diagonal and nondiagonal quadratic terms, A parametric linear relaxation algorithm for globally solving nonconvex quadratic programming, Domain reduction techniques for global NLP and MINLP optimization, Reduced RLT representations for nonconvex polynomial programming problems, An integer linear programming approach for bilinear integer programming, Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation, Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations, A continuation approach for the capacitated multi-facility weber problem based on nonlinear SOCP reformulation, Least squares for practitioners, Enhancing RLT-based relaxations for polynomial programming problems via a new class of \(v\)-semidefinite cuts, Rigorous filtering using linear relaxations, Global minimization using an augmented Lagrangian method with variable lower-level constraints, Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations, Compact linearization for binary quadratic problems subject to assignment constraints, Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods, Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem, A cost minimization heuristic for the pooling problem, A reliable affine relaxation method for global optimization, Two new reformulation convexification based hierarchies for 0-1 MIPs, Quadratic reformulations of nonlinear binary optimization problems, The packing while traveling problem, A comparative analysis of several asymmetric traveling salesman problem formulations, An enhanced logarithmic method for signomial programming with discrete variables, A new lift-and-project operator, A copositive approach for two-stage adjustable robust optimization with uncertain right-hand sides, Quadratic convex reformulation for nonconvex binary quadratically constrained quadratic programming via surrogate constraint, New multi-commodity flow formulations for the pooling problem, The minimum distance superset problem: formulations and algorithms, Maximum-entropy sampling and the Boolean quadric polytope, Higher-level RLT or disjunctive cuts based on a partial enumeration strategy for 0-1 mixed-integer programs, RLT: A unified approach for discrete and continuous nonconvex optimization, A computational study on the quadratic knapsack problem with multiple constraints, Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem, Globally solving nonconvex quadratic programming problems via completely positive programming, On the solution of NP-hard linear complementarity problems, Piecewise-linear approximations of multidimensional functions, Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique, Lagrangian decomposition of block-separable mixed-integer all-quadratic programs, A fractional programming approach for retail category price optimization, A rigorous global filtering algorithm for quadratic constraints, Penalized semidefinite programming for quadratically-constrained quadratic optimization, \({{\mathcal {D}(\mathcal {C})}}\)-optimization and robust global optimization, Extensions on ellipsoid bounds for quadratic integer programming, A fast branch-and-bound algorithm for non-convex quadratic integer optimization subject to linear constraints using ellipsoidal relaxations, DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs, Valid inequalities for mixed integer linear programs, An algorithm for the generalized quadratic assignment problem, Convergent Lagrangian and domain cut method for nonlinear knapsack problems, Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming, Faster, but weaker, relaxations for quadratically constrained quadratic programs, On the polyhedral lift-and-project methods and the fractional stable set polytope, Difference of convex solution of quadratically constrained optimization problems., Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation, Tight convex underestimators for \({{\mathcal C}^2}\)-continuous problems. I: Univariate functions, Editorial: Reformulation techniques in mathematical programming, Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method, A linearization framework for unconstrained quadratic (0-1) problems, Reformulation in mathematical programming: An application to quantum chemistry, A reformulation-linearization technique (RLT) for semi-infinite and convex programs under mixed 0-1 and general discrete restrictions, Risk preference modeling with conditional average: An application to portfolio optimization, Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming, On optimal zero-preserving corrections for inconsistent linear systems, Evolution and state-of-the-art in integer programming, A conditional logic approach for strengthening mixed 0-1 linear programs, A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems, ``Miniaturized linearizations for quadratic 0/1 problems
