Recommendations
- scientific article; zbMATH DE number 4209912
- Numerical solution of bilinear programming problems
- Jointly constrained bilinear programs and related problems: An overview
- A branch-and-cut algorithm for mixed-integer bilinear programming
- A new reformulation-linearization technique for bilinear programming problems
Cites work
- scientific article; zbMATH DE number 3550467 (Why is no real title available?)
- scientific article; zbMATH DE number 3282977 (Why is no real title available?)
- A Decomposition Algorithm for a Discrete Location-Allocation Problem
- A Modified Benders' Partitioning Algorithm for Mixed Integer Programming
- A cutting plane algorithm for solving bilinear programs
- A versatile scheme for ranking the extreme points of an assignment polytope
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- An Additive Algorithm for Solving Linear Programs with Zero-One Variables
- An Improved Implicit Enumeration Approach for Integer Programming
- Benders' partitioning scheme applied to a new formulation of the quadratic assignment problem
- Duality in Discrete Programming: II. The Quadratic Case
- Duality in quadratic programming
- Further Reduction of Zero-One Polynomial Programming Problems to Zero-One linear Programming Problems
- Generalized Benders decomposition
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems
- Minimization of a Non-Separable Objective Function Subject to Disjoint Constraints
- Mixed-integer quadratic programming
- Multicommodity Distribution System Design by Benders Decomposition
- On the choice of step size in subgradient optimization
- On the generation of deep disjunctive cutting planes
- Partitioning procedures for solving mixed-variables programming problems
- Pivot and Complement–A Heuristic for 0-1 Programming
- Solving Certain Nonconvex Quadratic Minimization Problems by Ranking the Extreme Points
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
- Technical Note—Surrogate Constraints and the Strength of Bounds Derived from 0-1 Benders' Partitioning Procedures
- Validation of subgradient optimization
Cited in
(52)- 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
- Solving mixed integer bilinear problems using MILP formulations
- On embedding the volume algorithm in a variable target value method.
- A trust region target value method for optimizing nondifferentiable Lagrangian duals of linear programs
- A multivariate adaptive regression splines cutting plane approach for solving a two-stage stochastic programming fleet assignment model
- Enabling research through the SCIP Optimization Suite 8.0
- On the mixed integer signomial programming problems
- An algorithm for indefinite integer quadratic programming
- Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations
- Two-stage quadratic integer programs with stochastic right-hand sides
- An integer linear programming approach for bilinear integer programming
- Enumeration approach for linear complementarity problems based on a reformulation-linearization technique
- Probabilistic partial set covering with an oracle for chance constraints
- A branch-and-cut algorithm for mixed-integer bilinear programming
- An LP-based characterization of solvable QAP instances with chess-board and graded structures
- Mixed settings for linear problems
- Jointly constrained bilinear programs and related problems: An overview
- A new reformulation-linearization technique for bilinear programming problems
- DRL\(^*\): A hierarchy of strong block-decomposable linear relaxations for 0-1 mips
- SOCP relaxation bounds for the optimal subset selection problem applied to robust linear regression
- Generation expansion planning with revenue adequacy constraints
- A recombination‐based matheuristic for mixed integer programming problems with binary variables
- LP-based approximations for disjoint bilinear and two-stage adjustable robust optimization
- Parametrical approach for bilinear programming and its application for solving integer and combinatorial optimization problems
- Scheduling under linear constraints
- Simultaneous convexification of bilinear functions over polytopes with application to network interdiction
- Untersuchungen zu speziellen linearen gemischt-ganzzahligen 0-1-optimierungsaufgaben
- Numerical solution of bilinear programming problems
- A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
- A disjunctive cutting plane algorithm for bilinear programming
- Biconvex Models and Algorithms for Risk Management Problems
- Recovery of primal solutions when using subgradient optimization methods to solve Lagrangian duals of linear programs
- Reduced first-level representations via the reformulation-linearization technique: Results, counterexamples, and computations
- Short paper -- The binary linearization complexity of pseudo-Boolean functions
- 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
- scientific article; zbMATH DE number 1389085 (Why is no real title available?)
- Univariate parameterization for global optimization of mixed-integer polynomial problems
- Knapsack with variable weights satisfying linear constraints
- Application-oriented mixed integer non-linear programming
- Approximating rectangles by juntas and weakly exponential lower bounds for LP relaxations of CSPs
- scientific article; zbMATH DE number 2000146 (Why is no real title available?)
- Combinatorial optimization with interaction costs: complexity and solvable cases
- A localization and reformulation discrete programming approach for the rectilinear distance location-allocation problem
- Improvement of binary integer programming through employment of the Boolean algebra logic
- Concise RLT forms of binary programs: a computational study of the quadratic knapsack problem
- Tighter representations for set partitioning problems
- Discretization and global optimization for mixed integer bilinear programming
- Characterizing linearizable QAPs by the level-1 reformulation-linearization technique
This page was built for publication: Mixed-integer bilinear programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q687032)
