Linear forms of nonlinear expressions: new insights on old ideas
From MaRDI portal
Publication:2457269
DOI10.1016/j.orl.2006.08.008zbMath1149.90396OpenAlexW2004328891WikidataQ60395654 ScholiaQ60395654MaRDI QIDQ2457269
Warren P. Adams, Richard J. Forrester
Publication date: 30 October 2007
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2006.08.008
Related Items
Deterministic global optimization of binary hybrid distillation/melt-crystallization processes based on relaxed MINLP formulations, Fortification Against Cascade Propagation Under Uncertainty, Modeling Defender-Attacker Problems as Robust Linear Programs with Mixed-Integer Uncertainty Sets, Structured linear reformulation of binary quadratically constrained quadratic programs, Fractional 0-1 programming: applications and algorithms, On maximum ratio clique relaxations, A simple technique to improve linearized reformulations of fractional (hyperbolic) 0-1 programming problems, Two-stage quadratic integer programs with stochastic right-hand sides, Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems, A note on linearized reformulations for a class of bilevel linear integer problems, Linear forms of nonlinear expressions: new insights on old ideas, A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs, A computational study on the quadratic knapsack problem with multiple constraints, Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem, Mixed Integer Linear Programming Formulation Techniques, Concise RLT forms of binary programs: A computational study of the quadratic knapsack problem
Cites Work
- A new linearization technique for multi-quadratic 0-1 programming problems.
- A conditional logic approach for strengthening mixed 0-1 linear programs
- An efficient linearization approach for mixed-integer problems
- A linearization method for mixed 0--1 polynomial programs
- A simple recipe for concise mixed 0-1 linearizations
- Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs
- Linear forms of nonlinear expressions: new insights on old ideas
- Exploiting Special Structures in Constructing a Hierarchy of Relaxations for 0-1 Mixed Integer Problems
- Equivalent Formulations of Nonlinear Integer Problems for Efficient Optimization
- A Linearization Procedure for Quadratic and Cubic Mixed-Integer Problems
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- Global Optimization for Mixed 0-1 Programs with Convex or Separable Continuous Functions
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
