Simultaneous convexification of bilinear functions over polytopes with application to network interdiction
From MaRDI portal
Recommendations
- An explicit characterization of the convex envelope of a bivariate bilinear function over special polytopes
- Extended formulations for convex hulls of some bilinear functions
- Polyhedral subdivisions and functional forms for the convex envelopes of bilinear, fractional and other bivariate functions over general polytopes
- Convex hull representation of the deterministic bipartite network interdiction problem
- A convex envelope formula for multilinear functions
Cites work
- A new reformulation-linearization technique for bilinear programming problems
- Advances for the pooling problem: modeling, global optimization, and computational studies (Survey)
- Algorithms for network interdiction and fortification games
- An explicit characterization of the convex envelope of a bivariate bilinear function over special polytopes
- Bidimensional packing by bilinear programming
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Computational Difficulties of Bilevel Linear Programming
- Convex envelopes for edge-concave functions
- Convex hull representation of the deterministic bipartite network interdiction problem
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Convexification techniques for linear complementarity constraints
- Deriving convex hulls through lifting and projection
- Deterministic network interdiction
- Different transformations for solving non-convex trim-loss problems by MINLP
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- Disjunctive programming: Properties of the convex hull of feasible points
- Explicit convex and concave envelopes through polyhedral subdivisions
- Exploiting special structures in constructing a hierarchy of relaxations for 0-1 mixed integer problems
- Generalized bilinear programming. I: Models, applications and linear programming relaxation
- Global minimization by reducing the duality gap
- Jointly Constrained Biconvex Programming
- Mixed-integer bilinear programming problems
- Mixed-integer nonlinear programs featuring ``on/off constraints
- On convex envelopes for bivariate functions over polytopes
- On convex relaxations for quadratically constrained quadratic programming
- On mathematical programming with indicator constraints
- Perspective reformulation and applications
- Pooling problem: alternate formulations and solution methods
- Removing Arcs from a Network
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
- Shortest-path network interdiction
- Solving mixed integer bilinear problems using MILP formulations
- Some results on the strength of relaxations of multilinear functions
- Strong valid inequalities for orthogonal disjunctions and bilinear covering sets
- The mathematics of playing golf, or: A new class of difficult nonlinear mixed integer programs
- The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability
- The polynomial hierarchy and a simple model for competitive analysis
- Trilinear monomials with mixed sign domains: Facets of the convex and concave envelopes
Cited in
(12)- Convexification techniques for linear complementarity constraints
- Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem
- New SOCP relaxation and branching rule for bipartite bilinear programs
- Strong relaxations for continuous nonlinear programs based on decision diagrams
- The convex hull of a quadratic constraint over a polytope
- (Global) optimization: historical notes and recent developments
- Shortest Paths in Graphs of Convex Sets
- Relaxations and cutting planes for linear programs with complementarity constraints
- A disjunctive cutting plane algorithm for bilinear programming
- Simultaneous convexification for the planar obnoxious facility location problem
- Aggregation of bilinear bipartite equality constraints and its application to structural model updating problem
- Extended formulations for convex hulls of some bilinear functions
This page was built for publication: Simultaneous convexification of bilinear functions over polytopes with application to network interdiction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5348475)
