Mixed-integer bilinear programming problems
From MaRDI portal
Publication:687032
DOI10.1007/BF01581249zbMath0801.90085OpenAlexW2015127564MaRDI QIDQ687032
Hanif D. Sherali, Warren P. Adams
Publication date: 4 April 1994
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01581249
Related Items
A localization and reformulation discrete programming approach for the rectilinear distance location-allocation problem, A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems, SOCP relaxation bounds for the optimal subset selection problem applied to robust linear regression, Generation expansion planning with revenue adequacy constraints, Scheduling under linear constraints, Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs, An algorithm for indefinite integer quadratic programming, A trust region target value method for optimizing nondifferentiable Lagrangian duals of linear programs, Tighter representations for set partitioning problems, DRL\(^*\): A hierarchy of strong block-decomposable linear relaxations for 0-1 mips, Biconvex Models and Algorithms for Risk Management Problems, Knapsack with variable weights satisfying linear constraints, Simultaneous Convexification of Bilinear Functions over Polytopes with Application to Network Interdiction, Efficient separation of RLT cuts for implicit and explicit bilinear products, Characterizing linearizable QAPs by the level-1 reformulation-linearization technique, An LP-based characterization of solvable QAP instances with chess-board and graded structures, A multivariate adaptive regression splines cutting plane approach for solving a two-stage stochastic programming fleet assignment model, Two-stage quadratic integer programs with stochastic right-hand sides, Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations, Probabilistic Partial Set Covering with an Oracle for Chance Constraints, Reduced first-level representations via the reformulation-linearization technique: Results, counterexamples, and computations, RLT: A unified approach for discrete and continuous nonconvex optimization, RLT insights into lift-and-project closures, On embedding the volume algorithm in a variable target value method., Combinatorial optimization with interaction costs: complexity and solvable cases, A branch-and-cut algorithm for mixed-integer bilinear programming, Enumeration approach for linear complementarity problems based on a reformulation-linearization technique, Concise RLT forms of binary programs: A computational study of the quadratic knapsack problem, Approximating Rectangles by Juntas and Weakly Exponential Lower Bounds for LP Relaxations of CSPs, Recovery of primal solutions when using subgradient optimization methods to solve Lagrangian duals of linear programs, Discretization and global optimization for mixed integer bilinear programming, Univariate parameterization for global optimization of mixed-integer polynomial problems, A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems, Approximated perspective relaxations: a project and lift approach
Cites Work
- Unnamed Item
- Unnamed Item
- Partitioning procedures for solving mixed-variables programming problems
- On the choice of step size in subgradient optimization
- Generalized Benders decomposition
- Duality in quadratic programming
- A versatile scheme for ranking the extreme points of an assignment polytope
- A Decomposition Algorithm for a Discrete Location-Allocation Problem
- Benders' partitioning scheme applied to a new formulation of the quadratic assignment problem
- Pivot and Complement–A Heuristic for 0-1 Programming
- On the generation of deep disjunctive cutting planes
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- Mixed-integer quadratic programming
- Multicommodity Distribution System Design by Benders Decomposition
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- Minimization of a Non-Separable Objective Function Subject to Disjoint Constraints
- Technical Note—Surrogate Constraints and the Strength of Bounds Derived from 0-1 Benders' Partitioning Procedures
- A cutting plane algorithm for solving bilinear programs
- A Modified Benders' Partitioning Algorithm for Mixed Integer Programming
- Validation of subgradient optimization
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
- Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems
- An Improved Implicit Enumeration Approach for Integer Programming
- Solving Certain Nonconvex Quadratic Minimization Problems by Ranking the Extreme Points
- Duality in Discrete Programming: II. The Quadratic Case
- An Additive Algorithm for Solving Linear Programs with Zero-One Variables
- Further Reduction of Zero-One Polynomial Programming Problems to Zero-One linear Programming Problems
