Simultaneous Convexification of Bilinear Functions over Polytopes with Application to Network Interdiction
From MaRDI portal
Publication:5348475
DOI10.1137/16M1066166zbMath1377.90066OpenAlexW2747035244MaRDI QIDQ5348475
Danial Davarnia, Mohit Tawarmalani, Jean-Philippe P. Richard
Publication date: 18 August 2017
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/16m1066166
Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Games involving graphs (91A43)
Related Items
Strong relaxations for continuous nonlinear programs based on decision diagrams, Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem, (Global) optimization: historical notes and recent developments, Shortest Paths in Graphs of Convex Sets, The Convex Hull of a Quadratic Constraint over a Polytope, Convexification techniques for linear complementarity constraints, New SOCP relaxation and branching rule for bipartite bilinear programs
Cites Work
- Unnamed Item
- Unnamed Item
- Mixed-integer nonlinear programs featuring ``on/off constraints
- Mixed-integer bilinear programming problems
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
- Bidimensional packing by bilinear programming
- Generalized bilinear programming. I: Models, applications and linear programming relaxation
- A new reformulation-linearization technique for bilinear programming problems
- Disjunctive programming: Properties of the convex hull of feasible points
- Different transformations for solving non-convex trim-loss problems by MINLP
- Global minimization by reducing the duality gap
- Deriving convex hulls through lifting and projection
- Convex envelopes for edge-concave functions
- Deterministic network interdiction
- The mathematics of playing golf, or: A new class of difficult nonlinear mixed integer programs
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Trilinear monomials with mixed sign domains: Facets of the convex and concave envelopes
- Some results on the strength of relaxations of multilinear functions
- On convex relaxations for quadratically constrained quadratic programming
- Explicit convex and concave envelopes through polyhedral subdivisions
- Convex hull representation of the deterministic bipartite network interdiction problem
- The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability
- An explicit characterization of the convex envelope of a bivariate bilinear function over special polytopes
- On mathematical programming with indicator constraints
- On convex envelopes for bivariate functions over polytopes
- Strong valid inequalities for orthogonal disjunctions and bilinear covering sets
- Exploiting Special Structures in Constructing a Hierarchy of Relaxations for 0-1 Mixed Integer Problems
- Solving Mixed Integer Bilinear Problems Using MILP Formulations
- Perspective Reformulation and Applications
- Convexification Techniques for Linear Complementarity Constraints
- Pooling Problem: Alternate Formulations and Solution Methods
- Computational Difficulties of Bilevel Linear Programming
- Jointly Constrained Biconvex Programming
- The polynomial hierarchy and a simple model for competitive analysis
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Shortest-path network interdiction
- Removing Arcs from a Network
